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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

I will go with â€˜Eâ€™ on this one.
From statement 1: n is odd.
From statement 2: The sum of the digits of n is not divisible by 3
Both put together: n can be 5, 7, 11, 13, so depending on n the remainder r varies.

[1] n is odd and that both (n+1) and (n-1) are divisible by 2
[2] Either (n-1) or (n+1) is divisible by 3

consequently (n-1)(n+1) is divisible by 12. Since n has to be greater than
24 for (n-1)(n+1) to leave a remainder when divided by 24 it is therfore divisible by 12 and at least its "first" multiple, that is, 24.

[1] n is odd and that both (n+1) and (n-1) are divisible by 2 [2] Either (n-1) or (n+1) is divisible by 3

consequently (n-1)(n+1) is divisible by 12. Since n has to be greater than 24 for (n-1)(n+1) to leave a remainder when divided by 24 it is therfore divisible by 12 and at least its "first" multiple, that is, 24.

so both statements together are sufficient.

The remainder r = 0.

I think it's C too, but I have a different explanation.

Look at what they're saying. n isn't divisible by 2 or 3. That means n is an odd number that's not divisible by 3.

That means it could be:
5
7
11
13
17
19
23
25

and on and on. In all cases, the numbers above and below each of these will either be divisible by 4 or by 6. It just works out that way. So when we multiply them together, the answer will be divisible by 24.

ian777 - great stuff!
what I meant in my post is that if you pick n<24 (n<23 in fact) (n-1)(n+1)
will be divisible by both 4 and 3. If you pick n>23 then (n-1)(n+1) will be divisible by at least one multiple of 12 hence 24.

1st statement : n is odd. (n-1)(n+1) is a multiple of 8

2nd statement : 3 is not a factor of n so (n-1)(n+1) is a multiple of 3

2 combined : multiple of 24. Remainder = 0.

Dookie, Can you explain how from statement 1 you got that (n-1)(n+1) is a multiple of 8

Since n is odd, n-1 and n+1 are both even, and, in fact, they are consecutive even number. Consecutive even numbers alternate between being multiples of 4 and not being. So in any two, one will be divisible by 2 only, and the other will be divisible by 4. So multiplying them together gives a number with 3 two's in it, or a multiple of 8.

1) If 2 is not a factor of n then n could be 1,3,5,7... (set of odd numbers)
(n-1)(n+1) ranges from 0, 8, 24 ...
We can't get the same remainder if (n-1)(n+1) is divided by 24

2) If 3 is not a factor of n then n could be 1,2,4, 5...
(n-1)(n+1) ranges from 0, 3, 15 ...
We can't get the same remainder if (n-1)(n+1) is divided by 24

When both statements are combined
n could be 1 5 7 11 ..

All these numbers or odd. Any odd number is preceeded and followed by an even number. With n starting from 5, it turns out that (n-1)(n-2) will have the factor 3*2*2*2 = 24 (proof for this might be complicated; by trial). So remainder when divided by 24 will be 0.
For n =1, (n-1)(n+1) = 0, so remainder is still 0.

C works Ok.

This question seems a bit hard to appear on a GMAT and to be solved in 2 minutes, because we have to extrapolate the result by substitution w/o a clear proof.
You never know!