If n is a positive integer and r is the remainder when (n-1) : GMAT Data Sufficiency (DS)
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 20 Jan 2017, 13:41

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

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

If n is a positive integer and r is the remainder when (n-1)

Author Message
TAGS:

Hide Tags

Manager
Joined: 20 Aug 2009
Posts: 107
Followers: 2

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

If n is a positive integer and r is the remainder when (n-1) [#permalink]

Show Tags

31 Aug 2009, 04:03
00:00

Difficulty:

75% (hard)

Question Stats:

55% (02:23) correct 45% (01:52) wrong based on 81 sessions

HideShow timer Statistics

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?

(1) n is not divisible by 2
(2) n is not divisible by 3

OPEN DISCUSSION OF THIS QUESTION IS HERE: if-n-is-a-positive-integer-and-r-is-the-remainder-when-n-126393.html
[Reveal] Spoiler: OA

Last edited by Bunuel on 04 Oct 2013, 07:38, edited 1 time in total.
Renamed the topic and edited the question.
Senior Manager
Joined: 27 May 2009
Posts: 281
Followers: 2

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

Re: GMATPrep: division by 24 again [#permalink]

Show Tags

31 Aug 2009, 04:48
Yes its C
if they are not divisible by 2 and 3 ...then no can be 5 , 7 , 11, ....so on......

caculate n-1 and n+1 , it will give ( product will ) mulitiple of 24 , thus R will be 0....
Manager
Joined: 25 Aug 2009
Posts: 176
Followers: 1

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

Re: GMATPrep: division by 24 again [#permalink]

Show Tags

31 Aug 2009, 16:36
Again,plugging numbers is the best approach..

1.) n is not divisible by 2 => n is odd

Case1: n = 1
(n-1)(n+1) = 0/24 ; r = 0

Case2: n = 3
(n-1)(n+1) /24 = 8/24; r = 8

Case3: n = 5
(n-1)(n+1) /24 = 24/24; r = 0
Hence, insufficient.

2.) n is not divisible by 3

case1: n = 1
(n-1)(n+1) = 0/24 ; r = 0

Case2: n = 2
(n-1)(n+1) /24 = 3/24; r = 3

Case3: n = 5
(n-1)(n+1) /24 = 24/24; r = 0
Hence, insufficient.

Combining both, n is neither divisible by 2 nor 3 => n =1, 5, 7,11

for all these numbers , r = 0 .. hence, sufficient..

Math Expert
Joined: 02 Sep 2009
Posts: 36583
Followers: 7087

Kudos [?]: 93280 [2] , given: 10555

Re: GMATPrep: division by 24 again [#permalink]

Show Tags

03 Sep 2009, 22:50
2
KUDOS
Expert's post
Here is another way:
Given (n-1)(n+1)=24x+r; r<24 (n-1)(n+1)=n^2-1 (n^2-1 is divisible by 8 if n is odd, worse to remember )

(1) n is not divisible by 2 => n odd => (n-1)(n+1) divisible by 8. But 24x is already multiple of 8, so r also should be multiple of 8 or 0. (Well it can be only 0 and 8 r<24 it can't be 16 but it doesn't matter here). Not suff

(2) n is not divisible by 3 => ether n-1 or n+1 is divisible by 3, so multiplication of these numbers (24x+r) should also be divisible by 3, but if r=8 24x+8 is not divisible by 3 => r=0.
_________________
Manager
Status: what we want to do, do it as soon as possible
Joined: 24 May 2010
Posts: 114
Location: Vietnam
WE 1: 5.0
Followers: 2

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

Re: GMATPrep: division by 24 again [#permalink]

Show Tags

27 Mar 2011, 03:42
Bunuel wrote:
Here is another way:
Given (n-1)(n+1)=24x+r; r<24 (n-1)(n+1)=n^2-1 (n^2-1 is divisible by 8 if n is odd, worse to remember )

(1) n is not divisible by 2 => n odd => (n-1)(n+1) divisible by 8. But 24x is already multiple of 8, so r also should be multiple of 8 or 0. (Well it can be only 0 and 8 r<24 it can't be 16 but it doesn't matter here). Not suff

(2) n is not divisible by 3 => ether n-1 or n+1 is divisible by 3, so multiplication of these numbers (24x+r) should also be divisible by 3, but if r=8 24x+8 is not divisible by 3 => r=0.

nice explanation. I had to pluging number which took me 5 minutes to solve out. This is a great reasoning
_________________

Consider giving me kudos if you find my explanations helpful so i can learn how to express ideas to people more understandable.

Intern
Joined: 17 Dec 2012
Posts: 31
Followers: 1

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

Re: GMATPrep: division by 24 again [#permalink]

Show Tags

04 Oct 2013, 07:07
Hi Bunuel,

Math Expert
Joined: 02 Sep 2009
Posts: 36583
Followers: 7087

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

Re: GMATPrep: division by 24 again [#permalink]

Show Tags

04 Oct 2013, 07:36
irda wrote:
Hi Bunuel,

$$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), ...).

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?

Plug-in 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.

OPEN DISCUSSION OF THIS QUESTION IS HERE: if-n-is-a-positive-integer-and-r-is-the-remainder-when-n-126393.html
_________________
Re: GMATPrep: division by 24 again   [#permalink] 04 Oct 2013, 07:36
Similar topics Replies Last post
Similar
Topics:
2 For a positive integer n, what is the remainder when n(n+1) is divided 4 02 Oct 2016, 23:50
129 If n is a positive integer and r is the remainder when (n-1) 8 21 Jan 2012, 16:57
16 If n is a positive integer and r is the remainder when (n-1) 14 04 Aug 2010, 02:47
3 If n is a positive integer and r is the remainder when (n-1) 9 03 Jul 2010, 21:19
8 If n is a positive integer and r is the remainder when (n-1)(n+1) is 8 21 Mar 2009, 09:52
Display posts from previous: Sort by