Author 
Message 
TAGS:

Hide Tags

Senior Manager
Joined: 29 Jan 2007
Posts: 433
Location: Earth

If n is a positive integer and r is remainder, when
[#permalink]
Show Tags
21 Apr 2008, 22:00
Question Stats:
62% (01:45) correct 38% (01:53) wrong based on 236 sessions
HideShow timer Statistics
If n is a positive integer and r is remainder, when (n1)(n+1) is divided by 24 what is value of r? (1) n is not divisible by 2 (2) n is not divisible by 3
Official Answer and Stats are available only to registered users. Register/ Login.




Math Expert
Joined: 02 Sep 2009
Posts: 47182

Re: GMATPrep  Good one.
[#permalink]
Show Tags
19 Dec 2010, 16:37
kyatin wrote: If n is a positive integer and r is remainder, when (n1)(n+1) is divided by 24 what is value of r?
1) n is not divisible by 2 2) n is not divisible by 3 If n is a positive integer and r is the remainder when (n1)(n+1) is divided by 24, what is the value of r?Number plugging method:\((n1)(n+1)=n^21\) (1) n is not divisible by 2 > pick two odd numbers: let's say 1 and 3 > if \(n=1\), then \(n^21=0\) and as zero is divisible by 24 (zero is divisible by any integer except zero itself) so remainder is 0 but if \(n=3\), then \(n^21=8\) and 8 divided by 24 yields remainder of 8. Two different answers, hence not sufficient. (2) n is not divisible by 3 > pick two numbers which are not divisible by 3: let's say 1 and 2 > if \(n=1\), then \(n^21=0\), so remainder is 0 but if \(n=2\), then \(n^21=3\) and 3 divided by 24 yields remainder of 3. Two different answers, hence not sufficient. (1)+(2) Let's check for several numbers which are not divisible by 2 or 3: \(n=1\) > \(n^21=0\) > remainder 0; \(n=5\) > \(n^21=24\) > remainder 0; \(n=7\) > \(n^21=48\) > remainder 0; \(n=11\) > \(n^21=120\) > remainder 0. Well it seems that all appropriate numbers will give remainder of 0. Sufficient. Algebraic approach:(1) n is not divisible by 2. Insufficient on its own, but this statement says that \(n=odd\) > \(n1\) and \(n+1\) are consecutive even integers > \((n1)(n+1)\) must be divisible by 8 (as both multiples are even and one of them will be divisible by 4. From consecutive even integers one is divisible by 4: (2, 4); (4, 6); (6, 8); (8, 10); (10, 12), ...). (2) n is not divisible by 3. Insufficient on its own, but form this statement either \(n1\) or \(n+1\) must be divisible by 3 (as \(n1\), \(n\), and \(n+1\) are consecutive integers, so one of them must be divisible by 3, we are told that it's not \(n\), hence either \(n1\) or \(n+1\)). (1)+(2) From (1) \((n1)(n+1)\) is divisible by 8, from (2) it's also divisible by 3, therefore it must be divisible by \(8*3=24\), which means that remainder upon division \((n1)(n+1)\) by 24 will be 0. Sufficient. Answer: C. 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




VP
Joined: 10 Jun 2007
Posts: 1397

Re: GMATPrep  Good one.
[#permalink]
Show Tags
21 Apr 2008, 22:11
kyatin wrote: If n is a positive integer and r is remainder, when (n1)(n+1) is divided by 24 what is value of r?
1) n is not divisible by 2 2) n is not divisible by 3 C (1) n is odd if n is odd, then pick some numbers... (n, (n1)*(n+1), r) (1, 0, 0) (3, 8, 8) INSUFFICIENT (2) (1, 0, 0) (2, 3, 3) INSUFFICIENT Together, find some more examples... (1, 0, 0) (3, 8, 8) (5, 24, 0) (7, 48, 0) (9, 56, 8) So the pattern is if n is divisible by 3, then remainder is 8, if not remainder is 0. Together is SUFFICIENT



Senior Manager
Joined: 29 Jan 2007
Posts: 433
Location: Earth

Re: GMATPrep  Good one.
[#permalink]
Show Tags
21 Apr 2008, 22:15
Excellent!. Thats how I did it. Thought it was a good one to share.



Manager
Joined: 16 Sep 2007
Posts: 211

Re: GMATPrep  Good one.
[#permalink]
Show Tags
21 Apr 2008, 22:26
1. 3,5,7,9 n>=5 therefore 5,7,9
test 9 9^21=80 80/24=3R8 test 5 5^21=24
insufficient
2. 2,4,5,7,8 n>=5 therefore 5,7,8 test 8 8^21=63 63/24=2R15
insufficient due to testing 5 in 1
1 and 2) 5 and 7 test 7 7^21=48 48/24=2
test 5 had no remainder
C



Senior Manager
Joined: 07 Jan 2008
Posts: 369

Re: GMATPrep  Good one.
[#permalink]
Show Tags
01 May 2008, 01:47
Quote: (3, 8, 8) So the pattern is if n is divisible by 3, then remainder is 8, if not remainder is 0. Together is SUFFICIENT Do you misconceive the circumstance? Cos' (n1)(n+1) is divided by 24, the remainder is r, thus (n1)(n+1)>24. Further, should we try many numbers to answer whether or not the given information is sufficient? I think we'll conclude only that one case is not sufficient if we find a number counts against the case, but we can not conclude that one case is sufficient if we find a number does not count against the case. That why I cast doubt on C. Need a general solution!



SVP
Joined: 29 Mar 2007
Posts: 2491

Re: GMATPrep  Good one.
[#permalink]
Show Tags
01 May 2008, 05:36
kyatin wrote: If n is a positive integer and r is remainder, when (n1)(n+1) is divided by 24 what is value of r?
1) n is not divisible by 2 2) n is not divisible by 3 Test numbers. 1: Try n=3 and n=23. 2: try n=2 and n=47. Together r will be 0.



VP
Joined: 10 Jun 2007
Posts: 1397

Re: GMATPrep  Good one.
[#permalink]
Show Tags
01 May 2008, 06:55
lexis wrote: Quote: (3, 8, 8) So the pattern is if n is divisible by 3, then remainder is 8, if not remainder is 0. Together is SUFFICIENT Do you misconceive the circumstance? Cos' (n1)(n+1) is divided by 24, the remainder is r, thus (n1)(n+1)>24. Further, should we try many numbers to answer whether or not the given information is sufficient? I think we'll conclude only that one case is not sufficient if we find a number counts against the case, but we can not conclude that one case is sufficient if we find a number does not count against the case. That why I cast doubt on C. Need a general solution! (n1)*(n+1) can be less than 24. For example, fraction 1/4 has a remainder of 1. Regarding how many numbers we should try, if you are able to figure out the pattern, that should be sufficient.



Intern
Joined: 18 Mar 2008
Posts: 3

Re: GMATPrep  Good one.
[#permalink]
Show Tags
02 May 2008, 19:10
my thoughts 
N is not divisible by 2: Means n1 and n+1 are even. And  As they are consecutive numbers one of them is divisible by 2 and other by 4. So: (n1)* (N+1) is divisible by 8  not sufficient to conclude that the product is divisible by 24
N is not divisible by 3: means as n1,n,n+1 are consecutive , one of them: (n1) or (n+1) is divisible by 3. Again, not sufficient for 24.
Together  (n1)(n+1) is divisible by 2,4,3 i.e: 2*4*3 = 24 . Hence, r=0
does it make sense?



Intern
Joined: 21 Mar 2008
Posts: 22

Re: GMATPrep  Good one.
[#permalink]
Show Tags
05 May 2008, 18:47
HefAR wrote: my thoughts 
N is not divisible by 2: Means n1 and n+1 are even. And  As they are consecutive numbers one of them is divisible by 2 and other by 4. So: (n1)* (N+1) is divisible by 8  not sufficient to conclude that the product is divisible by 24
N is not divisible by 3: means as n1,n,n+1 are consecutive , one of them: (n1) or (n+1) is divisible by 3. Again, not sufficient for 24.
Together  (n1)(n+1) is divisible by 2,4,3 i.e: 2*4*3 = 24 . Hence, r=0
does it make sense? I think this very much makes sense, thanks. I got this question on GMATPrep (it's roughly a Q50 question, give or take a few), and was able to solve it by just plugging in numbers, but it's very helpful to know where the logic comes from  much easier and quicker to solve!



Intern
Joined: 02 Sep 2010
Posts: 43
WE 1: Business Development Manger
WE 2: Assistant ManagerCarbon Trading
WE 3: ManagerCarbon Trading

Re: GMATPrep  Good one.
[#permalink]
Show Tags
24 Nov 2010, 08:06
This is how I solved it From statement 1) 2 is not a factor of n ( we can conclude that n is odd ) so by plugging in numbers like n=15 remainder=1 and for n=17 remainder =0 i.e not sufficient From statement 2 it says that 3 is not a factor of n so we can have n as an even number or it can be prime number( not #0 again by plugging in values we can find that the remainders are different.i.e insufficient. So by combining both we can conclude that the value for n will be a prime number which is not 2 and 3 for n=19 remainder =0 ; for n=13 remainder =0 ( just testing cases ) SO answer is C Guys let me know if my solution is good ?



Manager
Joined: 13 Jul 2010
Posts: 149

Re: GMATPrep  Good one.
[#permalink]
Show Tags
19 Dec 2010, 16:21
This was my approach. Did you actually calculate out the remainders when you tried n=15 and 17? I just used n=2 or n=5 to arrive at my examples. C gives you that n has to be prime other than 2 and 3 and you test a few cases to find that all non 2 and 3 primes will provide a 0 remainder for N.



VP
Status: It's near  I can see.
Joined: 13 Apr 2013
Posts: 1155
Location: India
Concentration: International Business, Operations
GPA: 3.01
WE: Engineering (Consulting)

Re: If n is a positive integer and r is remainder, when
[#permalink]
Show Tags
17 May 2015, 21:51
rite2deepti wrote: This is how I solved it From statement 1) 2 is not a factor of n ( we can conclude that n is odd ) so by plugging in numbers like n=15 remainder=1 and for n=17 remainder =0 i.e not sufficient From statement 2 it says that 3 is not a factor of n so we can have n as an even number or it can be prime number( not #0 again by plugging in values we can find that the remainders are different.i.e insufficient. So by combining both we can conclude that the value for n will be a prime number which is not 2 and 3 for n=19 remainder =0 ; for n=13 remainder =0 ( just testing cases ) SO answer is C Guys let me know if my solution is good ? Great....That,s how I solved this question....
_________________
"Do not watch clock; Do what it does. KEEP GOING."



Current Student
Joined: 26 Apr 2015
Posts: 127

Re: If n is a positive integer and r is remainder, when
[#permalink]
Show Tags
18 May 2015, 04:56
I don't think that this is a 700 level question. Is it?



Math Expert
Joined: 02 Sep 2009
Posts: 47182

Re: If n is a positive integer and r is remainder, when
[#permalink]
Show Tags
18 May 2015, 04:58



NonHuman User
Joined: 09 Sep 2013
Posts: 7326

Re: If n is a positive integer and r is remainder, when
[#permalink]
Show Tags
08 Nov 2017, 01:51
Hello from the GMAT Club BumpBot! Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up  doing my job. I think you may find it valuable (esp those replies with Kudos). Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
GMAT Books  GMAT Club Tests  Best Prices on GMAT Courses  GMAT Mobile App  Math Resources  Verbal Resources




Re: If n is a positive integer and r is remainder, when &nbs
[#permalink]
08 Nov 2017, 01:51






