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:

The integers k and n are such that 4 < k < n and k is not a factor of n. If r is the remainder when n is divided by k, is r > 2?

1. The greatest common factor of k and n is 4. 2. The least common multiple of k and n is 84.

D i think

1) GCF of k and n is 4. k and n each have 2 2's. in order for k not to be a factor of n, the rest of the primes between k and n have to be different. for every diference of 2 between the remaining primes, it will be multiplied by 4 sine there are 2 2's present in k and n, so the remainder is always greater than 2

2) LCM of k and n is 84, just as in statement 1, the primes not shered bhy k and n account for a difference that will make r>2

The integers k and n are such that 4 < k < n and k is not a factor of n. If r is the remainder when n is divided by k, is r > 2?

1. The greatest common factor of k and n is 4. 2. The least common multiple of k and n is 84.

D i think

1) GCF of k and n is 4. k and n each have 2 2's. in order for k not to be a factor of n, the rest of the primes between k and n have to be different. for every diference of 2 between the remaining primes, it will be multiplied by 4 sine there are 2 2's present in k and n, so the remainder is always greater than 2

2) LCM of k and n is 84, just as in statement 1, the primes not shered bhy k and n account for a difference that will make r>2

Can you please explain me your reasoning. Especially of the 2nd part. what if the LCM given is 132 and not 84. How will you explain it?
_________________

Consider kudos for the good post ... My debrief : http://gmatclub.com/forum/journey-670-to-720-q50-v36-long-85083.html

(1) The greatest common factor of k and n is 4.Some of the possible combinations for (k, n) such that GCF is 4 and K<n are - (8,12) (12,16) (12,20) (16,20) (20,24) (20,28) etc etc....

Take any combination you will get remainder r as either 4 or 8, both of which are greater than 2. Hence SUFF.

(2) The least common multiple of k and n is 84. Some of the possible combinations for (k,n) such that LCM is 84 and k<n are - (1,84) (7,12) (12,21) (12,14).

If k=7, n=12 , then the remainder is 4 If k=12, n=14, then the reaminder is 2

So we cannot say for sure that the remainder is = 2 always. INSUFF.

Hence answer should be A........unless I missed something...Please correct if you see anything wrong.

(1) The greatest common factor of k and n is 4.Some of the possible combinations for (k, n) such that GCF is 4 and K<n are - (8,12) (12,16) (12,20) (16,20) (20,24) (20,28) etc etc....

Take any combination you will get remainder r as either 4 or 8, both of which are greater than 2. Hence SUFF.

(2) The least common multiple of k and n is 84. Some of the possible combinations for (k,n) such that LCM is 84 and k<n are - (1,84) (7,12) (12,21) (12,14).

If k=7, n=12 , then the remainder is 4 If k=12, n=14, then the reaminder is 2

So we cannot say for sure that the remainder is = 2 always. INSUFF.

Hence answer should be A........unless I missed something...Please correct if you see anything wrong.

yes, I believe you are right...i overlooked the (12,14) combo

stmt1 is alone sufficient.: shortcut: the remainder when a number is divided by another number is always a multiple of their HCF.... for eg; 27 when divided by 18 will leave a remainder 9 which is a multiple of 9 itself you can try different combination and will find this result true..

The same logic doesn't hold true when we know the LCM for two different numbers... because we can't separate out the primes...