Author 
Message 
TAGS:

Hide Tags

Manager
Status: One last try =,=
Joined: 11 Jun 2010
Posts: 136

What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
Updated on: 29 Oct 2017, 00:32
3
This post received KUDOS
52
This post was BOOKMARKED
Question Stats:
72% (00:56) correct 28% (00:54) wrong based on 1074 sessions
HideShow timer Statistics
What is the remainder when the positive integer n is divided by 12? (1) When n is divided by 6, the remainder is 1. (2) When n is divided by 12, the remainder is greater than 5.
Official Answer and Stats are available only to registered users. Register/ Login.
_________________
There can be Miracles when you believe
Originally posted by windofchange on 07 Oct 2013, 03:05.
Last edited by Bunuel on 29 Oct 2017, 00:32, edited 2 times in total.
Renamed the topic and edited the question.



Math Expert
Joined: 02 Sep 2009
Posts: 44640

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
07 Oct 2013, 04:34
15
This post received KUDOS
Expert's post
34
This post was BOOKMARKED
What is the remainder when the positive integer n is divided by 12?The remainder is always nonnegative integer less than divisor \(0\leq{r}<d\), so in our case \(0\leq{r}<12\). (1) When n is divided by 6, the remainder is 1 > \(n=6q+1\), thus n can be 1, 7, 13, 19, 25, ... This means that the remainder upon division n by 12 can be 1 or 7. Not sufficient. (2) When n is divided by 12, the remainder is greater than 5. This implies that \(5<{r}<12\). Not sufficient. (1)+(2) Since from (2) \(5<{r}<12\), the from (1) r=7. Sufficient. Answer: C. Hope it's clear.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Manager
Joined: 09 Nov 2012
Posts: 65

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
24 Oct 2013, 16:08
Bunuel wrote: What is the remainder when the positive integer n is divided by 12?
The remainder is always nonnegative integer less than divisor \(0\leq{r}<d\), so in our case \(0\leq{r}<12\).
(1) When n is divided by 6, the remainder is 1 > \(n=6q+1\), thus n can be 1, 7, 13, 19, 25, ... This means that the remainder upon division n by 12 can be 1 or 7. Not sufficient.
(2) When n is divided by 12, the remainder is greater than 5. This implies that \(5\leq{r}<12\). Not sufficient.
(1)+(2) Since from (2) \(5\leq{r}<12\), the from (1) r=7. Sufficient.
Answer: C.
Hope it's clear. Hi Bunuel, can you post some practice problems for the 'Remainders' topic? I got this in my GMAT Prep exam and I got it wrong. I'd like to review this topic a bit more. Thanks.



Math Expert
Joined: 02 Sep 2009
Posts: 44640

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
25 Oct 2013, 02:00
2
This post received KUDOS
Expert's post
5
This post was BOOKMARKED
saintforlife wrote: Bunuel wrote: What is the remainder when the positive integer n is divided by 12?
The remainder is always nonnegative integer less than divisor \(0\leq{r}<d\), so in our case \(0\leq{r}<12\).
(1) When n is divided by 6, the remainder is 1 > \(n=6q+1\), thus n can be 1, 7, 13, 19, 25, ... This means that the remainder upon division n by 12 can be 1 or 7. Not sufficient.
(2) When n is divided by 12, the remainder is greater than 5. This implies that \(5\leq{r}<12\). Not sufficient.
(1)+(2) Since from (2) \(5\leq{r}<12\), the from (1) r=7. Sufficient.
Answer: C.
Hope it's clear. Hi Bunuel, can you post some practice problems for the 'Remainders' topic? I got this in my GMAT Prep exam and I got it wrong. I'd like to review this topic a bit more. Thanks. Theory on remainders problems: remainders144665.htmlAll DS remainders problems to practice: search.php?search_id=tag&tag_id=198All PS remainders problems to practice: search.php?search_id=tag&tag_id=199Hope this helps.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Intern
Joined: 18 Apr 2012
Posts: 21

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
22 Sep 2014, 12:20
Hi Bunuel, Maybe I'm just rusty on remainder theory, but you would please explain how you were able to see this: Quote: This means that the remainder upon division n by 12 can be 1 or 7. Not sufficient. Thanks, MDL



Math Expert
Joined: 02 Sep 2009
Posts: 44640

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
23 Sep 2014, 00:36
2
This post received KUDOS
Expert's post
2
This post was BOOKMARKED
mdlyman wrote: Hi Bunuel, Maybe I'm just rusty on remainder theory, but you would please explain how you were able to see this: Quote: This means that the remainder upon division n by 12 can be 1 or 7. Not sufficient. Thanks, MDL 1, 7, 13, 19, 25, 1 divided by 12 gives the remainder of 1; 7 divided by 12 gives the remainder of 7; 13 divided by 12 gives the remainder of 1; 19 divided by 12 gives the remainder of 7; 25 divided by 12 gives the remainder of 1; ... Check links for theory on remainders in my post above. Hope it helps.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Intern
Joined: 03 Jul 2014
Posts: 16

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
24 Nov 2014, 11:21
Bunuel wrote: What is the remainder when the positive integer n is divided by 12?
The remainder is always nonnegative integer less than divisor \(0\leq{r}<d\), so in our case \(0\leq{r}<12\).
(1) When n is divided by 6, the remainder is 1 > \(n=6q+1\), thus n can be 1, 7, 13, 19, 25, ... This means that the remainder upon division n by 12 can be 1 or 7. Not sufficient.
(2) When n is divided by 12, the remainder is greater than 5. This implies that \(5\leq{r}<12\). Not sufficient.
(1)+(2) Since from (2) \(5\leq{r}<12\), the from (1) r=7. Sufficient.
Answer: C.
Hope it's clear. I have a doubt here , like u said \(n=6q+1\), thus n can be 1, 7, 13, 19, 25 so we are substituting q with 0,1 ,2,3 ... so on ... But I wanted to know if we can substitude 0 . .... That means if i divide 1/6 is the remainder 1 . But here I cannot divide in the first place only. Please clear my concept , i guess i m missing something . I thought we can only get remainder when the no is atleast divisible once , means p/q where p > q .... thanks in advance



Math Expert
Joined: 02 Sep 2009
Posts: 44640

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
25 Nov 2014, 07:28
hanschris5 wrote: Bunuel wrote: What is the remainder when the positive integer n is divided by 12?
The remainder is always nonnegative integer less than divisor \(0\leq{r}<d\), so in our case \(0\leq{r}<12\).
(1) When n is divided by 6, the remainder is 1 > \(n=6q+1\), thus n can be 1, 7, 13, 19, 25, ... This means that the remainder upon division n by 12 can be 1 or 7. Not sufficient.
(2) When n is divided by 12, the remainder is greater than 5. This implies that \(5\leq{r}<12\). Not sufficient.
(1)+(2) Since from (2) \(5\leq{r}<12\), the from (1) r=7. Sufficient.
Answer: C.
Hope it's clear. I have a doubt here , like u said \(n=6q+1\), thus n can be 1, 7, 13, 19, 25 so we are substituting q with 0,1 ,2,3 ... so on ... But I wanted to know if we can substitude 0 . .... That means if i divide 1/6 is the remainder 1 . But here I cannot divide in the first place only. Please clear my concept , i guess i m missing something . I thought we can only get remainder when the no is atleast divisible once , means p/q where p > q .... thanks in advance Let me ask you a question: how many leftover apples would you have if you had 1 apple and wanted to distribute in 6 baskets evenly? Each basket would get 0 apples and 1 apple would be leftover (remainder). When a divisor is more than dividend, then the remainder equals to the dividend, for example: 3 divided by 4 yields the reminder of 3: \(3=4*0+3\); 9 divided by 14 yields the reminder of 9: \(9=14*0+9\); 1 divided by 9 yields the reminder of 1: \(1=9*0+1\).
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Current Student
Joined: 20 Mar 2014
Posts: 2652
Concentration: Finance, Strategy
GPA: 3.7
WE: Engineering (Aerospace and Defense)

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
03 Aug 2015, 09:59
naeln wrote: What is the remainder when the positive integer n is divided by 12? 1. When n is divided by 6, the remainder is 1 2. When n is divided by 12, the remainder is greater than 5 The question is asking what would the remainder be when n is divided by 12. We know that remainder obtained when n is divided by p is < p. Thus remainders when any integer is divided is divded by 12 will be one of 0,1,2,3,4,5,6,7,8,9,10,11. Per statement 1, n =6p+1 > n = 7 (remainder when divided by 12 = 7), or n =13 (remainder when divided by 12 = 1). Thus we get 2 different values for the remainder. Not suficient. Per statement 2, n =12q+ r where r >5 > r could be one of 611. Thus not sufficient. Combining, we get that the remainder will be either 1 or 7 and that the remainder will be >5 . Thus remainder will be 7. C is the correct answer.



Veritas Prep GMAT Instructor
Joined: 15 Jul 2015
Posts: 110
GPA: 3.62
WE: Corporate Finance (Consulting)

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
03 Aug 2015, 13:00
mdlyman wrote: Hi Bunuel, Maybe I'm just rusty on remainder theory, but you would please explain how you were able to see this: Quote: This means that the remainder upon division n by 12 can be 1 or 7. Not sufficient. Thanks, MDL The best way to think of remainders is using the Number line. We all know that every 3rd number starting at 3 is multiple of 3. Looking at this another way, every 3rd number on the number line starting with 3, yields a remainder of 0 when divided by 3. Similarly, every 3rd number on the number line starting with the number 4, will yield a remainder of 1 when divided by 3. In the problem above, a number that yields a remainder of 1 when divided by six would be every sixth number on the number line starting a 1 (i.e., 1, 7, 13, 19, .....). Dividing these same numbers by 12, yields remainders of 1 (13) or 7 (19).
_________________
Dennis Veritas Prep  GMAT Instructor
Get started with Veritas Prep GMAT On Demand for $199
Veritas Prep Reviews



Intern
Joined: 28 Sep 2017
Posts: 1

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
30 Nov 2017, 06:04
Instead of testing values, You can just divide the number by 12(or anything for any question) and check for the remainders



Target Test Prep Representative
Status: Founder & CEO
Affiliations: Target Test Prep
Joined: 14 Oct 2015
Posts: 2448
Location: United States (CA)

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
04 Dec 2017, 11:45
windofchange wrote: What is the remainder when the positive integer n is divided by 12?
(1) When n is divided by 6, the remainder is 1. (2) When n is divided by 12, the remainder is greater than 5. We need to determine the remainder when n is divided by 12. Statement One Alone: When n is divided by 6, the remainder is 1. The information in statement one is not sufficient to answer the question. We see that when n = 7, 7/12 has a remainder of 7; however when n = 13, 13/12 has a remainder of 1. Statement Two Alone: When n is divided by 12, the remainder is greater than 5. The information in statement two is not sufficient to answer the question, since when n is divided by 12, it can be any one of these possible remainders: 6, 7, 8, 9, 10, and 11. Statements One and Two Together: Using the information from statements one, we see that n can be values such as: 7, 13, 19, 25, ….. We also see that when we divide these values by 12, we get a pattern of remainders: 7/12 has a remainder of 7 13/12 has a remainder of 1 19/12 has a reminder of 7 25/12 has a remainder of 1 Since we have found a pattern, we do not have to test any further numbers. Furthermore, since statement two tells us that the remainder when N is divided by 12 is greater than 5, the only possible remainder is 7. Answer: C
_________________
Scott WoodburyStewart
Founder and CEO
GMAT Quant SelfStudy Course
500+ lessons 3000+ practice problems 800+ HD solutions



Intern
Joined: 30 Mar 2015
Posts: 10

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
30 Dec 2017, 10:56
Hi, Please, I have problem understanding why c. In my opinio, the answer is E because not only 7 meets the criteria but also 31 ! can you tell me where am i wrong ?
Thank you !



Math Expert
Joined: 02 Sep 2009
Posts: 44640

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
30 Dec 2017, 11:03
hichem wrote: Hi, Please, I have problem understanding why c. In my opinio, the answer is E because not only 7 meets the criteria but also 31 ! can you tell me where am i wrong ?
Thank you ! The question asks to find the value of r not n. What is the remainder when the positive integer n is divided by 12? That being said, n can take infinitely many values: 7, 19, 31, 43, ... not just the two you mention.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Senior Manager
Joined: 29 Jun 2017
Posts: 259

Re: What is the remainder when the positive integer n is divided by 12? [#permalink]
Show Tags
31 Dec 2017, 23:48
windofchange wrote: What is the remainder when the positive integer n is divided by 12?
(1) When n is divided by 6, the remainder is 1. (2) When n is divided by 12, the remainder is greater than 5. the first number to satisfy both conditions is 17 all the number satisfying both condition will be 17+ k. minimum multiple of 6 and 12 =17+ k. 12 so, we find that the remainder is alway 2. C is correct we need to find the minimum multitude of 6 and 12. which is 12. the question will become more dificult if it is harder to find minimum multiple of 6 and 12




Re: What is the remainder when the positive integer n is divided by 12?
[#permalink]
31 Dec 2017, 23:48






