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:

n=24k+10=12(12k)+10 --> n can be: 10, 34, 58, ... n divided by 12 will give us the reminder of 10.

As, you can see, n divided by 14 can give different remainders. If n=10, then n divided by 14 yields the remainder of 10 but if n=34, then n divided by 14 yields the remainder of 6.

Bunuel - Can you please explain this? how does 24k+10 = 12(12k)+10

and can you help me to visualize how you would divide 24k+10 by 12? thanks!

It's n=24k+10=12*2k+10, not n=24k+10=12*12k+10.
_________________

Re: Positive integer n leaves a remainder of 4 after division by [#permalink]

Show Tags

18 Dec 2012, 01:40

Ans:

since n is greater than 30 we check for the number which gives a remainder of 4 after dividing by 6 and 3 after dividing by 5 , the number comes out to 58. So it will give a remainder of 28 after dividing by 30. Answer (E).
_________________

Maybe I did something wrong, or I just got lucky, so please inform me. I also had 28 as the solution, by just plugging in the values.

a. 3 / 6 = 0 r 6 INCORRECT b. 12 / 6 = 2 r 0 INCORRECT c. 18 / 6 = 3 r 0 INCORRECT d. 22 / 6 = 3 r 4 & 22 / 5 = 4 r 2 INCORRECT e. 28 / 6 = 4 r 4 & 28 / 5 = 4 r 3 CORRECT

Super-simple math, so there must be something wrong here, haha.

What you did is correct. The reason you did it will tell you whether you got lucky or used good reasoning.

The question tells you that "n leaves a remainder of 4 after division by 6 and a remainder of 3 after division by 5"

The options are not the values of n; they are the values of remainder that is leftover after you divide n by 30. You divided the options by 6 and 5 and got the remainder as 4 and 3 respectively. Was that a mistake you made? If yes, then you got lucky.

Though, if you had used logic and said, "Ok, so when n is divided by 30, groups of 30 are made. What is leftover is given in the options. 30 is completely divisible by 6 and by 5 hence the groups of 30 can be evenly divided into groups of 6 as well as groups of 5. So whatever is leftover after division by 30, we need to split that into further groups of 6 and 5. When we split it into groups of 6, we must have remainder as 4 since n leaves remainder 4. When we split it into groups of 5, we must have remainder as 3 since n leaves remainder 3. And, if that is the reason you divided the options by 6 and 5, checked their remainders and got your answer, then well done! You got the logic!"
_________________

Suppose we are told that: Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 2 after division by 8. What is the remainder that n leaves after division by 12?

The statement "positive integer n leaves a remainder of 4 after division by 6" can be expressed as: \(n=6p+4\). Thus according to this particular statement \(n\) could take the following values: 4, 10, 16, 22, 28, 34, 40, 46, 52, 58, 64, ...

The statement "positive integer n leaves a remainder of 2 after division by 8" can be expressed as: \(n=8q+2\). Thus according to this particular statement \(n\) could take the following values: 2, 10, 18, 26, 34, 42, 50, 58, 66, ...

The above two statements are both true, which means that the only valid values of \(n\) are the values which are common in both patterns. For example \(n\) can not be 16 (from first pattern) as the second formula does not give us 16 for any value of integer \(q\).

So we should derive general formula (based on both statements) that will give us only valid values of \(n\).

How can these two statement be expressed in one formula of a type \(n=kx+r\)? Where \(x\) is divisor and \(r\) is a remainder.

Divisor \(x\) would be the least common multiple of above two divisors 6 and 8, hence \(x=24\).

Remainder \(r\) would be the first common integer in above two patterns, hence \(r=10\).

Therefore general formula based on both statements is \(n=24k+10\). Thus according to this general formula valid values of \(n\) are: 10, 34, 58, ...

Now, \(n\) divided by 12 will give us the reminder of 10 (as 24k is divisible by 12).

Hope it helps.

Bunuel – very good explanation.

First case - i). given statement in a question is - Remainder is 7 when positive integer n is divided by 18. And ii). if we are asked to find out the remainder when n is divided by 6,

Then since 18 is completely divisible by 6 or 6 is a factor of 18, we can find out the solution easily by above given statement. As, n = 18 q + 7; 18 is completely divisible by 6, thus no remainder exists when 18q/6 and when 7 is divided by 6, it would yield 1 as the remainder.

Second case i). given statement in a question is - Remainder is 7 when positive integer n is divided by 18. And ii). if we are asked to find out the remainder when n is divided by 8,

Then since 18 is not divisible by 8 or 8 is not a factor of 18, we cannot find out the solution by above given statement.

Third case i). given statement in a question is - Remainder is 7 when positive integer n is divided by 6. And ii). if we are asked to find out the remainder when n is divided by 12,

Then since 6 is not divisible by 12, however it true the other way round. We cannot find out the solution by above given statement.

Fourth case, which you have explained – “Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 2 after division by 8. What is the remainder that n leaves after division by 12?”

We have two given statements – since one statement will not yield us the answer as explained in my earlier three cases. But, since we have two given statements which derive – n = 6Q1 + 4 & n = 8Q2 + 2. Q1, Q2 are quotients respectively. And if we look at 6Q1 and 8 Q2, the LCM yields 24. Since we are asked the remainder when division is done by 12 and since 12 is completely divisible by 24. Thus, we can come up with a solution. Otherwise we cannot.

I hope I was able to explain what I wanted to and the above conclusion described in the 4 cases is correct.
_________________

Suppose we are told that: Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 2 after division by 8. What is the remainder that n leaves after division by 12?

The statement "positive integer n leaves a remainder of 4 after division by 6" can be expressed as: \(n=6p+4\). Thus according to this particular statement \(n\) could take the following values: 4, 10, 16, 22, 28, 34, 40, 46, 52, 58, 64, ...

The statement "positive integer n leaves a remainder of 2 after division by 8" can be expressed as: \(n=8q+2\). Thus according to this particular statement \(n\) could take the following values: 2, 10, 18, 26, 34, 42, 50, 58, 66, ...

The above two statements are both true, which means that the only valid values of \(n\) are the values which are common in both patterns. For example \(n\) can not be 16 (from first pattern) as the second formula does not give us 16 for any value of integer \(q\).

So we should derive general formula (based on both statements) that will give us only valid values of \(n\).

How can these two statement be expressed in one formula of a type \(n=kx+r\)? Where \(x\) is divisor and \(r\) is a remainder.

Divisor \(x\) would be the least common multiple of above two divisors 6 and 8, hence \(x=24\).

Remainder \(r\) would be the first common integer in above two patterns, hence \(r=10\).

Therefore general formula based on both statements is \(n=24k+10\). Thus according to this general formula valid values of \(n\) are: 10, 34, 58, ...

Now, \(n\) divided by 12 will give us the reminder of 10 (as 24k is divisible by 12). Hope it helps.

Hi Bunuel,

All of this makes sense but I would like to challenge the last statement highlighted above.

In this case, we can obviously write n=12(2k)+10 as you highlighted in the later posts. If for some reason, let's say it asked for a number that wasn't divisible by 24, wouldn't that make the equation n=24k+10 invalid? Meaning, it asked what is the remainder that n leaves after division by 11?

Additionally, what if it asked "what is the remainder that n leaves after division by 48. Could we still apply the same logic and say 10?

Suppose we are told that: Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 2 after division by 8. What is the remainder that n leaves after division by 12?

The statement "positive integer n leaves a remainder of 4 after division by 6" can be expressed as: \(n=6p+4\). Thus according to this particular statement \(n\) could take the following values: 4, 10, 16, 22, 28, 34, 40, 46, 52, 58, 64, ...

The statement "positive integer n leaves a remainder of 2 after division by 8" can be expressed as: \(n=8q+2\). Thus according to this particular statement \(n\) could take the following values: 2, 10, 18, 26, 34, 42, 50, 58, 66, ...

The above two statements are both true, which means that the only valid values of \(n\) are the values which are common in both patterns. For example \(n\) can not be 16 (from first pattern) as the second formula does not give us 16 for any value of integer \(q\).

So we should derive general formula (based on both statements) that will give us only valid values of \(n\).

How can these two statement be expressed in one formula of a type \(n=kx+r\)? Where \(x\) is divisor and \(r\) is a remainder.

Divisor \(x\) would be the least common multiple of above two divisors 6 and 8, hence \(x=24\).

Remainder \(r\) would be the first common integer in above two patterns, hence \(r=10\).

Therefore general formula based on both statements is \(n=24k+10\). Thus according to this general formula valid values of \(n\) are: 10, 34, 58, ...

Now, \(n\) divided by 12 will give us the reminder of 10 (as 24k is divisible by 12). Hope it helps.

Hi Bunuel,

All of this makes sense but I would like to challenge the last statement highlighted above.

In this case, we can obviously write n=12(2k)+10 as you highlighted in the later posts. If for some reason, let's say it asked for a number that wasn't divisible by 24, wouldn't that make the equation n=24k+10 invalid? Meaning, it asked what is the remainder that n leaves after division by 11?

Additionally, what if it asked "what is the remainder that n leaves after division by 48. Could we still apply the same logic and say 10?

Thanks!

If the question were what is the remainder when n is divided by 11, then the answer would be "cannot be determined". The same if the question asked about the remainder when n is divided by 48. See, according to this general formula valid values of \(n\) are: 10, 34, 58, ... These values give different remainders upon division by 11, or 48.
_________________

Suppose we are told that: Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 2 after division by 8. What is the remainder that n leaves after division by 12?

The statement "positive integer n leaves a remainder of 4 after division by 6" can be expressed as: \(n=6p+4\). Thus according to this particular statement \(n\) could take the following values: 4, 10, 16, 22, 28, 34, 40, 46, 52, 58, 64, ...

The statement "positive integer n leaves a remainder of 2 after division by 8" can be expressed as: \(n=8q+2\). Thus according to this particular statement \(n\) could take the following values: 2, 10, 18, 26, 34, 42, 50, 58, 66, ...

The above two statements are both true, which means that the only valid values of \(n\) are the values which are common in both patterns. For example \(n\) can not be 16 (from first pattern) as the second formula does not give us 16 for any value of integer \(q\).

So we should derive general formula (based on both statements) that will give us only valid values of \(n\).

How can these two statement be expressed in one formula of a type \(n=kx+r\)? Where \(x\) is divisor and \(r\) is a remainder.

Divisor \(x\) would be the least common multiple of above two divisors 6 and 8, hence \(x=24\).

Remainder \(r\) would be the first common integer in above two patterns, hence \(r=10\).

Therefore general formula based on both statements is \(n=24k+10\). Thus according to this general formula valid values of \(n\) are: 10, 34, 58, ...

Now, \(n\) divided by 12 will give us the reminder of 10 (as 24k is divisible by 12). Hope it helps.

Hi Bunuel,

All of this makes sense but I would like to challenge the last statement highlighted above.

In this case, we can obviously write n=12(2k)+10 as you highlighted in the later posts. If for some reason, let's say it asked for a number that wasn't divisible by 24, wouldn't that make the equation n=24k+10 invalid? Meaning, it asked what is the remainder that n leaves after division by 11?

Additionally, what if it asked "what is the remainder that n leaves after division by 48. Could we still apply the same logic and say 10?

Thanks!

If the question were what is the remainder when n is divided by 11, then the answer would be "cannot be determined". The same if the question asked about the remainder when n is divided by 48. See, according to this general formula valid values of \(n\) are: 10, 34, 58, ... These values give different remainders upon division by 11, or 48.

Hi, Probably a silly question.... But can some one explain why Remainder r would be the first common integer in the two patterns n=6p+4 n=5q+3

Many Thanks

N is of the form 6p+4 which means it is one of 4, 10, 16, 22, 28, ... N is also of the form 5q+3 which means it must also be one of 3, 8, 13, 18, 23, 28, ...

Since N must be a value in both the lists, N can take the values common to both. The first such value is 28. So N can be 28.

Now what other values can N take? 28 is a number that will leave a remainder of 4 when divided by 6 and a remainder of 3 when divided by 5. The next such number will be (LCM of 6 and 5) + 28. Why? because whatever you add to 28, that should be divisible by 6 as well as 5. Then whatever you add will have no relevance to the remainder and the remainders will remain the same. That is why some other values of N will be 30+28, 60+28 ...etc.

After you divide any of these numbers by 30, the remainder will be 28.

Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 3 after division by 5. If n is greater than 30, what is the remainder that n leaves after division by 30?
_________________

Re: Positive integer n leaves a remainder of 4 after division by [#permalink]

Show Tags

15 Aug 2014, 22:17

jmuduke08 wrote:

n=24k+10=12(12k)+10 --> n can be: 10, 34, 58, ... n divided by 12 will give us the reminder of 10.

As, you can see, n divided by 14 can give different remainders. If n=10, then n divided by 14 yields the remainder of 10 but if n=34, then n divided by 14 yields the remainder of 6.

Bunuel - Can you please explain this? how does 24k+10 = 12(12k)+10

and can you help me to visualize how you would divide 24k+10 by 12? thanks!

Is this a sub-600 level question?
_________________

If you found this post useful for your prep, click 'Kudos'

n=24k+10=12(12k)+10 --> n can be: 10, 34, 58, ... n divided by 12 will give us the reminder of 10.

As, you can see, n divided by 14 can give different remainders. If n=10, then n divided by 14 yields the remainder of 10 but if n=34, then n divided by 14 yields the remainder of 6.

Bunuel - Can you please explain this? how does 24k+10 = 12(12k)+10

and can you help me to visualize how you would divide 24k+10 by 12? thanks!

Is this a sub-600 level question?

No. It is 650-700 level question. It seems quite do-able only because we have done the concept of remainders in great detail. For a newbie, this problem can be quite challenging.
_________________

Re: Positive integer n leaves a remainder of 4 after division by [#permalink]

Show Tags

01 Sep 2014, 00:28

Bunuel wrote:

bchekuri wrote:

Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 3 after division by 5. If n is greater than 30, what is the remainder that n leaves after division by 30? (A) 3 (B) 12 (C) 18 (D) 22 (E) 28

How to approach this Problem?

Positive integer n leaves a remainder of 4 after division by 6 --> \(n=6p+4\) --> 4, 10, 16, 22, 28, ... Positive integer n leaves a remainder of 3 after division by 5 --> \(n=5q+3\) --> 3, 8, 13, 18, 23, 28, ...

\(n=30k+28\) - we have 30 as lcm of 5 and 6 is 30 and we have 28 as the first common integer in the above patterns is 28.

Hence remainder when positive integer n is divided by 30 is 28.

Answer: E.

P.S. n>30 is a redundant information.

What will be the answer of they ask us what the remainder is if n is divided by something other than 30, lets say 11 or 12. any random number which is not a factor of 30.

Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 3 after division by 5. If n is greater than 30, what is the remainder that n leaves after division by 30? (A) 3 (B) 12 (C) 18 (D) 22 (E) 28

How to approach this Problem?

Positive integer n leaves a remainder of 4 after division by 6 --> \(n=6p+4\) --> 4, 10, 16, 22, 28, ... Positive integer n leaves a remainder of 3 after division by 5 --> \(n=5q+3\) --> 3, 8, 13, 18, 23, 28, ...

\(n=30k+28\) - we have 30 as lcm of 5 and 6 is 30 and we have 28 as the first common integer in the above patterns is 28.

Hence remainder when positive integer n is divided by 30 is 28.

Answer: E.

P.S. n>30 is a redundant information.

What will be the answer of they ask us what the remainder is if n is divided by something other than 30, lets say 11 or 12. any random number which is not a factor of 30.

In this case we wouldn't be able to determine the remainder. For example, if we were asked to find the remainder of n divided by 11, then we would get different answers: if n = 28, then remainder would be 6 but if n = 58, then the remainder would be 3.
_________________

Re: Positive integer n leaves a remainder of 4 after division by [#permalink]

Show Tags

04 Sep 2014, 10:26

Bunuel wrote:

russ9 wrote:

Bunuel wrote:

To elaborate more.

Suppose we are told that: Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 2 after division by 8. What is the remainder that n leaves after division by 12?

The statement "positive integer n leaves a remainder of 4 after division by 6" can be expressed as: \(n=6p+4\). Thus according to this particular statement \(n\) could take the following values: 4, 10, 16, 22, 28, 34, 40, 46, 52, 58, 64, ...

The statement "positive integer n leaves a remainder of 2 after division by 8" can be expressed as: \(n=8q+2\). Thus according to this particular statement \(n\) could take the following values: 2, 10, 18, 26, 34, 42, 50, 58, 66, ...

The above two statements are both true, which means that the only valid values of \(n\) are the values which are common in both patterns. For example \(n\) can not be 16 (from first pattern) as the second formula does not give us 16 for any value of integer \(q\).

So we should derive general formula (based on both statements) that will give us only valid values of \(n\).

How can these two statement be expressed in one formula of a type \(n=kx+r\)? Where \(x\) is divisor and \(r\) is a remainder.

Divisor \(x\) would be the least common multiple of above two divisors 6 and 8, hence \(x=24\).

Remainder \(r\) would be the first common integer in above two patterns, hence \(r=10\).

Therefore general formula based on both statements is \(n=24k+10\). Thus according to this general formula valid values of \(n\) are: 10, 34, 58, ...

Now, \(n\) divided by 12 will give us the reminder of 10 (as 24k is divisible by 12). Hope it helps.

Hi Bunuel,

All of this makes sense but I would like to challenge the last statement highlighted above.

In this case, we can obviously write n=12(2k)+10 as you highlighted in the later posts. If for some reason, let's say it asked for a number that wasn't divisible by 24, wouldn't that make the equation n=24k+10 invalid? Meaning, it asked what is the remainder that n leaves after division by 11?

Additionally, what if it asked "what is the remainder that n leaves after division by 48. Could we still apply the same logic and say 10?

Thanks!

If the question were what is the remainder when n is divided by 11, then the answer would be "cannot be determined". The same if the question asked about the remainder when n is divided by 48. See, according to this general formula valid values of \(n\) are: 10, 34, 58, ... These values give different remainders upon division by 11, or 48.

Thanks for the explanations and confirming the correctness of my scenarios.
_________________

Re: Positive integer n leaves a remainder of 4 after division by [#permalink]

Show Tags

30 Nov 2014, 13:45

muralimba wrote:

Friends,

IT IS VERY COMMON IN GMAT to solve this kind of qtns using "NEGATIVE REMAINDER" theory.

The theory says:

if a # x is devided by y and leave the positive # r as the remainder then it can also leave negative # (r-y) as the remainder.

e.g:

9 when devided by 5 leves the remainder 4 : 9=5*1+4 it can also leave the remainder 4-5 = -1 : 9=5*2 -1

back to the original qtn: n leaves a remainder of 4 after division by 6 and a remainder of 3 after division by 5 ==> n leaves a remainder of -2 (i.e. 4-6) after division by 6 and a remainder of -2 (i.e. 3-5) after division by 5 ==> n when devided by 5 and 6 leaves the same remainder -2. what is n? LCM (5,6)-2 = 30-2 = 28 CHECK: 28 when devided by 6 leaves the remainder 4 and when devided by 5 leaves the remainder 3

However, the qtn says n > 30

so what is the nex #, > 28, that can give the said remainders when devided by 6 and 5 nothing but 28 + (some multiple of 6 and 5) as this "some multiple of 6 and 5" will not give any remainder when devided by 5 or 6 but 28 will give the required remainders.

hence n could be anything that is in the form 28 + (some multiple of 6 and 5) observe that "some multiple of 6 and 5" is always a multiple of 30 as LCM (5,6) = 30.

hence when n (i.e. 28 + some multiple of 6 and 5) is devided by 30 gives the remainder 28.

Re: Positive integer n leaves a remainder of 4 after division by [#permalink]

Show Tags

05 Feb 2015, 08:02

VeritasPrepKarishma wrote:

Saabs wrote:

Maybe I did something wrong, or I just got lucky, so please inform me. I also had 28 as the solution, by just plugging in the values.

a. 3 / 6 = 0 r 6 INCORRECT b. 12 / 6 = 2 r 0 INCORRECT c. 18 / 6 = 3 r 0 INCORRECT d. 22 / 6 = 3 r 4 & 22 / 5 = 4 r 2 INCORRECT e. 28 / 6 = 4 r 4 & 28 / 5 = 4 r 3 CORRECT

Super-simple math, so there must be something wrong here, haha.

What you did is correct. The reason you did it will tell you whether you got lucky or used good reasoning.

The question tells you that "n leaves a remainder of 4 after division by 6 and a remainder of 3 after division by 5"

The options are not the values of n; they are the values of remainder that is leftover after you divide n by 30. You divided the options by 6 and 5 and got the remainder as 4 and 3 respectively. Was that a mistake you made? If yes, then you got lucky.

Though, if you had used logic and said, "Ok, so when n is divided by 30, groups of 30 are made. What is leftover is given in the options. 30 is completely divisible by 6 and by 5 hence the groups of 30 can be evenly divided into groups of 6 as well as groups of 5. So whatever is leftover after division by 30, we need to split that into further groups of 6 and 5. When we split it into groups of 6, we must have remainder as 4 since n leaves remainder 4. When we split it into groups of 5, we must have remainder as 3 since n leaves remainder 3. And, if that is the reason you divided the options by 6 and 5, checked their remainders and got your answer, then well done! You got the logic!"

Hi Karishma, could you kindly explain the bold part? I have trouble understanding why it was the case..
_________________

Please kudo if you find the post helpful

gmatclubot

Re: Positive integer n leaves a remainder of 4 after division by
[#permalink]
05 Feb 2015, 08:02

Hey, guys, So, I’ve decided to run a contest in hopes of getting the word about the site out to as many applicants as possible this application season...

Whether you’re an entrepreneur, aspiring business leader, or you just think that you may want to learn more about business, the thought of getting your Masters in Business Administration...

Whether you’re an entrepreneur, aspiring business leader, or you just think that you may want to learn more about business, the thought of getting your Masters in Business Administration...