Find all School-related info fast with the new School-Specific MBA Forum

It is currently 24 Jul 2014, 04:25

Close

GMAT Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

If n is a positive integer and r is remainder, when

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
1 KUDOS received
Senior Manager
Senior Manager
avatar
Joined: 29 Jan 2007
Posts: 451
Location: Earth
Followers: 2

Kudos [?]: 37 [1] , given: 0

GMAT Tests User
If n is a positive integer and r is remainder, when [#permalink] New post 21 Apr 2008, 21:00
1
This post received
KUDOS
2
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

  35% (medium)

Question Stats:

69% (01:59) correct 31% (01:00) wrong based on 52 sessions
If n is a positive integer and r is remainder, when (n-1)(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
[Reveal] Spoiler: OA
3 KUDOS received
VP
VP
avatar
Joined: 10 Jun 2007
Posts: 1467
Followers: 5

Kudos [?]: 94 [3] , given: 0

GMAT Tests User
Re: GMATPrep - Good one. [#permalink] New post 21 Apr 2008, 21:11
3
This post received
KUDOS
kyatin wrote:
If n is a positive integer and r is remainder, when (n-1)(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, (n-1)*(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
Senior Manager
avatar
Joined: 29 Jan 2007
Posts: 451
Location: Earth
Followers: 2

Kudos [?]: 37 [0], given: 0

GMAT Tests User
Re: GMATPrep - Good one. [#permalink] New post 21 Apr 2008, 21:15
Excellent!. Thats how I did it. Thought it was a good one to share.
1 KUDOS received
Manager
Manager
User avatar
Joined: 16 Sep 2007
Posts: 215
Followers: 1

Kudos [?]: 9 [1] , given: 0

GMAT Tests User
Re: GMATPrep - Good one. [#permalink] New post 21 Apr 2008, 21:26
1
This post received
KUDOS
1.
3,5,7,9
n>=5
therefore 5,7,9

test 9
9^2-1=80
80/24=3R8
test 5
5^2-1=24

insufficient

2.
2,4,5,7,8
n>=5
therefore 5,7,8
test 8
8^2-1=63
63/24=2R15

insufficient due to testing 5 in 1

1 and 2)
5 and 7
test 7
7^2-1=48
48/24=2

test 5 had no remainder

C
1 KUDOS received
Senior Manager
Senior Manager
User avatar
Joined: 07 Jan 2008
Posts: 418
Followers: 3

Kudos [?]: 62 [1] , given: 0

GMAT Tests User
Re: GMATPrep - Good one. [#permalink] New post 01 May 2008, 00:47
1
This post received
KUDOS
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' (n-1)(n+1) is divided by 24, the remainder is r, thus (n-1)(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!
1 KUDOS received
CEO
CEO
User avatar
Joined: 29 Mar 2007
Posts: 2593
Followers: 16

Kudos [?]: 180 [1] , given: 0

GMAT Tests User
Re: GMATPrep - Good one. [#permalink] New post 01 May 2008, 04:36
1
This post received
KUDOS
kyatin wrote:
If n is a positive integer and r is remainder, when (n-1)(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
VP
avatar
Joined: 10 Jun 2007
Posts: 1467
Followers: 5

Kudos [?]: 94 [0], given: 0

GMAT Tests User
Re: GMATPrep - Good one. [#permalink] New post 01 May 2008, 05: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' (n-1)(n+1) is divided by 24, the remainder is r, thus (n-1)(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!


(n-1)*(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
Intern
avatar
Joined: 18 Mar 2008
Posts: 3
Followers: 0

Kudos [?]: 0 [0], given: 0

Re: GMATPrep - Good one. [#permalink] New post 02 May 2008, 18:10
my thoughts -

N is not divisible by 2: Means n-1 and n+1 are even.
And - As they are consecutive numbers one of them is divisible by 2 and other by 4.
So: (n-1)* (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 n-1,n,n+1 are consecutive , one of them: (n-1) or (n+1) is divisible by 3. Again, not sufficient for 24.

Together - (n-1)(n+1) is divisible by 2,4,3 i.e: 2*4*3 = 24 . Hence, r=0

does it make sense?
Intern
Intern
avatar
Joined: 21 Mar 2008
Posts: 22
Followers: 0

Kudos [?]: 0 [0], given: 0

Re: GMATPrep - Good one. [#permalink] New post 05 May 2008, 17:47
HefAR wrote:
my thoughts -

N is not divisible by 2: Means n-1 and n+1 are even.
And - As they are consecutive numbers one of them is divisible by 2 and other by 4.
So: (n-1)* (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 n-1,n,n+1 are consecutive , one of them: (n-1) or (n+1) is divisible by 3. Again, not sufficient for 24.

Together - (n-1)(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!
1 KUDOS received
Intern
Intern
avatar
Joined: 02 Sep 2010
Posts: 48
WE 1: Business Development Manger
WE 2: Assistant Manager-Carbon Trading
WE 3: Manager-Carbon Trading
Followers: 2

Kudos [?]: 8 [1] , given: 16

GMAT Tests User
Re: GMATPrep - Good one. [#permalink] New post 24 Nov 2010, 07:06
1
This post received
KUDOS
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
Manager
User avatar
Joined: 13 Jul 2010
Posts: 169
Followers: 1

Kudos [?]: 15 [0], given: 7

Re: GMATPrep - Good one. [#permalink] New post 19 Dec 2010, 15: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.
Expert Post
2 KUDOS received
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 18714
Followers: 3238

Kudos [?]: 22300 [2] , given: 2612

Re: GMATPrep - Good one. [#permalink] New post 19 Dec 2010, 15:37
2
This post received
KUDOS
Expert's post
kyatin wrote:
If n is a positive integer and r is remainder, when (n-1)(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 (n-1)(n+1) is divided by 24, what is the value of r?

Number plugging method:

(n-1)(n+1)=n^2-1

(1) n is not divisible by 2 --> pick two odd numbers: let's say 1 and 3 --> if n=1, then n^2-1=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^2-1=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^2-1=0, so remainder is 0 but if n=2, then n^2-1=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^2-1=0 --> remainder 0;
n=5 --> n^2-1=24 --> remainder 0;
n=7 --> n^2-1=48 --> remainder 0;
n=11 --> n^2-1=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 --> n-1 and n+1 are consecutive even integers --> (n-1)(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 n-1 or n+1 must be divisible by 3 (as n-1, 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 n-1 or n+1).

(1)+(2) From (1) (n-1)(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 (n-1)(n+1) by 24 will be 0. Sufficient.

Answer: C.

Hope it helps.
_________________

NEW TO MATH FORUM? PLEASE READ THIS: ALL YOU NEED FOR QUANT!!!

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory; 7. Remainders; 8. Overlapping Sets; 9. PDF of Math Book; 10. Remainders; 11. GMAT Prep Software Analysis NEW!!!; 12. SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) NEW!!!; 12. Tricky questions from previous years. NEW!!!;

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?
25 extra-hard Quant Tests

Get the best GMAT Prep Resources with GMAT Club Premium Membership

Re: GMATPrep - Good one.   [#permalink] 19 Dec 2010, 15:37
    Similar topics Author Replies Last post
Similar
Topics:
1 Experts publish their posts in the topic If n is a positive integer and r is the remainder when (n - ksharma12 5 26 Apr 2010, 13:39
If n is a positive integer and r is the remainder when (n neelesh 1 17 Feb 2008, 08:14
If n is a positive integer and r is the remainder when (n aurobindo 2 23 Jan 2007, 06:47
If n and r are positive integers and r is the remainder when apollo168 8 30 Aug 2006, 10:08
If n is a positive Integer and r is the remainder when Dookie 15 10 Dec 2004, 06:30
Display posts from previous: Sort by

If n is a positive integer and r is remainder, when

  Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.