BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

GMAT_Prep-1

Expert replies
by sameerballani » Wed Jun 01, 2011 1:30 am
Q) 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

OA:C
Join the discussion
Source: — Data Sufficiency |

by cans » Wed Jun 01, 2011 1:44 am
(n+1)(n-1) = 24x+r (x is an integer)
a)if n=3;r=8
if n=5;r=0 insufficient.
b)n=2;r=3
n=5;r=0 insufficient
c)n is neither divisible by 2 nor 3.
(n+1)(n-1) = as n is not divisible by 2, n+1 and n-1 will be divisible by 2.
Also n-1,n+1 are consecutive, thus atleast one of them is divisible by 4
thus (n+1)(n-1) is atleast divisible by 8
also n is not divisible by 3
(n-1),(n),(n+1) are 3 consecutive integers and one of them should be divisible by 3.
thus either of (n-1),(n+1) is divisible by 3
(n+1)(n-1)divisible by 24 and thus remainder=0
IMO C
Join the discussion

by MURALIDHARGAJULA » Wed Jun 01, 2011 10:09 am
Nice..you are good at math
Join the discussion

by cans » Wed Jun 01, 2011 4:11 pm
Thanks :)
Join the discussion

by MURALIDHARGAJULA » Wed Jun 01, 2011 8:22 pm
Hi,

how much time have you devoted to reach this level?
Join the discussion

by cans » Wed Jun 01, 2011 8:31 pm
MURALIDHARGAJULA wrote:Hi,

how much time have you devoted to reach this level?
Which level???
Join the discussion

by MURALIDHARGAJULA » Wed Jun 01, 2011 9:41 pm
hehe...I mean to the level of accuracy which are have now
Join the discussion

by Anurag@Gurome » Wed Jun 01, 2011 10:17 pm
sameerballani wrote:Q) 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

OA:C

Solution:
It can be easily verified that each statement alone is not sufficient to answer the question.
Now, combine both the statements together and check.
Since n is not divisible by either 2 or 3, it is of the form 6k+1 or 6k+5, k being any integer.
So, if n = 6k+1, (n+1)(n-1) = (6k+2)(6k) = 12k(3k+1). If k is even, 12k is divisible by 24 and hence 12k(3k+1) is divisible by 24.
If k is odd, 3k+1 is even and hence 12(3k+1)(k) is divisible by 24.
If n = 6k+5, (n+1)(n-1) = (6k+6)(6k+4) = 12(k+1)(3k+2).
If k is even, 3k+2 is even and hence 12(3k+2)(k+1)is divisible by 24.
If k is odd, (k+1) is even and hence 12(k+1)(3k+2) is divisible by 24.
Hence, we can say that if n is not divisible by both 2 and 3, (n+1)(n-1) is always divisible by 24 and the remainder is 0.

The correct answer is (C).
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/
Join the discussion