Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 27 Apr 2015, 14:39

### 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

# Positive integer n leaves a remainder of 4 after division by

Author Message
TAGS:
Intern
Joined: 08 Nov 2009
Posts: 2
Followers: 0

Kudos [?]: 21 [5] , given: 0

Positive integer n leaves a remainder of 4 after division by [#permalink]  05 May 2010, 22:49
5
KUDOS
26
This post was
BOOKMARKED
00:00

Difficulty:

25% (medium)

Question Stats:

75% (02:21) correct 25% (01:42) wrong based on 772 sessions
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
[Reveal] Spoiler: OA

Last edited by Bunuel on 20 Apr 2012, 02:05, edited 1 time in total.
Edited the question and added the OA
Math Expert
Joined: 02 Sep 2009
Posts: 27123
Followers: 4189

Kudos [?]: 40504 [8] , given: 5540

Re: Manhattan Remainder Problem [#permalink]  05 May 2010, 23:22
8
KUDOS
Expert's post
6
This post was
BOOKMARKED
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.

P.S. n>30 is a redundant information.
_________________
Math Expert
Joined: 02 Sep 2009
Posts: 27123
Followers: 4189

Kudos [?]: 40504 [52] , given: 5540

Re: Manhattan Remainder Problem [#permalink]  06 May 2010, 03:18
52
KUDOS
Expert's post
31
This post was
BOOKMARKED
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.
_________________
Senior Manager
Joined: 12 Jan 2010
Posts: 258
Schools: DukeTuck,Kelogg,Darden
Followers: 6

Kudos [?]: 52 [6] , given: 28

Re: Manhattan Remainder Problem [#permalink]  06 May 2010, 11:09
6
KUDOS
5
This post was
BOOKMARKED
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?

Once we get the concept, We can also use the options to answer faster.

Since the number leaves the remainder 4 after division by 6 we know it is an even number. Only even number that leaves a remainder of 3 after being divisible by 5 has to end with 8.

So narrows the options to 18 and 28.

since 30+18 = 48 is divisible by 6 the answer is 30+28 = 54
_________________

Run towards the things that make you uncomfortable daily. The greatest risk is not taking risks
http://gmatclub.com/forum/from-690-to-730-q50-v38-97356.html

Manager
Joined: 04 Feb 2010
Posts: 64
Schools: IESE '13
WE 1: Engineer
Followers: 3

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

Re: Manhattan Remainder Problem [#permalink]  06 May 2010, 18:51
1
KUDOS
Silvers 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?

Once we get the concept, We can also use the options to answer faster.

Since the number leaves the remainder 4 after division by 6 we know it is an even number. Only even number that leaves a remainder of 3 after being divisible by 5 has to end with 8.

So narrows the options to 18 and 28.

since 30+18 = 48 is divisible by 6 the answer is 30+28 = 54

Exactly how I did it - we know the number has to have 8 in the ones digit, so then we can test 30+18 or 30+28
Manager
Joined: 19 Jul 2009
Posts: 53
Location: baltimore, md
Schools: kellogg, booth, stern, ann arbor
Followers: 1

Kudos [?]: 23 [1] , given: 3

Re: Manhattan Remainder Problem [#permalink]  22 Jun 2010, 15:19
1
KUDOS
i would have thought the answer is c: 78. why am i wrong? i had 28 at first, but doesn't n have to be greater than 30?
_________________

Paaaaayyy Meeeee!!!!!

Manager
Joined: 26 Jan 2008
Posts: 235
Followers: 3

Kudos [?]: 25 [1] , given: 36

Re: Manhattan Remainder Problem [#permalink]  23 Jun 2010, 14:41
1
KUDOS
azule45 wrote:
i would have thought the answer is c: 78. why am i wrong? i had 28 at first, but doesn't n have to be greater than 30?

n has to be greater than 30. the remainder, which does not have to be greater than 30, is 28.
Manager
Joined: 26 Jan 2008
Posts: 235
Followers: 3

Kudos [?]: 25 [1] , given: 36

Re: Manhattan Remainder Problem [#permalink]  23 Jun 2010, 14:52
1
KUDOS
both bunuel's and silver's methods make sense. which is the better way to solve this problem and problems like this and why?
Manager
Joined: 12 Aug 2010
Posts: 66
Schools: UNC Kenan-Flagler, IU Kelley, Emory GSB
WE 1: 5 yrs
Followers: 3

Kudos [?]: 13 [1] , given: 50

Re: Manhattan Remainder Problem [#permalink]  28 Nov 2010, 20:14
1
KUDOS
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.

Thanks Bunuel - you are a gem.
_________________

The night is at its darkest just before the dawn... never, ever give up!

Director
Joined: 03 Sep 2006
Posts: 885
Followers: 6

Kudos [?]: 256 [4] , given: 33

Re: Manhattan Remainder Problem [#permalink]  28 Nov 2010, 22:29
4
KUDOS
Possible values of n are:

n = 4, 10, 16, 22, 28, 34, 40, 46, 52, 58, ...

If R = 3 after division of 5, then possible values of n are

n = 3, 8, 13, 18, 23, 28, 33, 38, 43, 48, 53, 58, ...

Therefore according to give conditions, some possible values of n are

n = 28, 58, ...

n > 30

Let's say n = 58

58/30 gives us a remainder of : 28.
Manager
Joined: 30 Aug 2010
Posts: 92
Location: Bangalore, India
Followers: 3

Kudos [?]: 116 [16] , given: 27

Re: Manhattan Remainder Problem [#permalink]  29 Nov 2010, 03:40
16
KUDOS
6
This post was
BOOKMARKED
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.

Regards,
Murali.

Kudos?
Manager
Joined: 28 Jul 2011
Posts: 218
Followers: 0

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

Re: Manhattan Remainder Problem [#permalink]  10 Jun 2012, 11:21
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.

Regards,
Murali.

Kudos?

Hello Murali,

Can you please explain how will you solve following example using "NEGATIVE REMAINDER" theory discussed above?
"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?"
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 5433
Location: Pune, India
Followers: 1325

Kudos [?]: 6721 [6] , given: 176

Re: Manhattan Remainder Problem [#permalink]  11 Jun 2012, 20:15
6
KUDOS
Expert's post
3
This post was
BOOKMARKED
kuttingchai wrote:

Hello Murali,

Can you please explain how will you solve following example using "NEGATIVE REMAINDER" theory discussed above?
"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?"

Question: 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?

Solution:
n = 6a + 4 (or remainder = -2)
n = 8b + 2 (or remainder = -6)

The negative remainder is not the same in the two cases. So don't use negative remainders here.

Here are some links that discuss divisibility and remainders. The third link discusses negative remainders but you will need to go through the first two posts to understand it properly. Also, the links discuss how to solve such questions. Go through them and get back if there is a doubt.

http://www.veritasprep.com/blog/2011/04 ... unraveled/
http://www.veritasprep.com/blog/2011/04 ... y-applied/
http://www.veritasprep.com/blog/2011/05 ... emainders/
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Veritas Prep GMAT course is coming to India. Enroll in our weeklong Immersion Course that starts March 29!

Veritas Prep Reviews

Senior Manager
Joined: 22 Dec 2011
Posts: 299
Followers: 3

Kudos [?]: 132 [0], given: 32

Re: Manhattan Remainder Problem [#permalink]  12 Sep 2012, 21:24
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.

This is awesome I was searching for this logic for a long time.

Just one question - you said, i quote, Remainder $$r$$ would be the first common integer in above two patterns, hence $$r=10$$.

Is there a quick way to come with this value without listing the nos out. sometime the common nos in both the series would come after 6 or 7 term hence sometimes consumes time. Is there a quicker way?

My sincere thanks.

cheers
Math Expert
Joined: 02 Sep 2009
Posts: 27123
Followers: 4189

Kudos [?]: 40504 [0], given: 5540

Re: Manhattan Remainder Problem [#permalink]  13 Sep 2012, 03:59
Expert's post
1
This post was
BOOKMARKED
Jp27 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.

This is awesome I was searching for this logic for a long time.

Just one question - you said, i quote, Remainder $$r$$ would be the first common integer in above two patterns, hence $$r=10$$.

Is there a quick way to come with this value without listing the nos out. sometime the common nos in both the series would come after 6 or 7 term hence sometimes consumes time. Is there a quicker way?

My sincere thanks.

cheers

In some cases we can use some other approaches, though I think simple listing is the easiest way.
_________________
Senior Manager
Joined: 22 Dec 2011
Posts: 299
Followers: 3

Kudos [?]: 132 [0], given: 32

Re: Manhattan Remainder Problem [#permalink]  15 Sep 2012, 20:32
Bunuel wrote:
In some cases we can use some other approaches, though I think simple listing is the easiest way.

Thanks for your response. Yes that easy.

Sorry this might be a silly questions.... I have a basic doubt here

Lets assume p = 9 n = 11 and what is the reminder when pn / 15?

so 99 / 15 give me a reminder of 9
but if i split the denominator for ex 9 * 11 / 3 * 5 = 9/3 * 11 / 5 => I can always mutiply reminders as long as i can correct the excess so here
9/3 reminder 0 11/5 reminder 1 = 0 * 1 = 0 = reminder.

So i should never split the denominator or the numertator when calculating for root or can I? something is wrong here! pls help.
Manager
Status: K... M. G...
Joined: 22 Oct 2012
Posts: 51
GMAT Date: 08-27-2013
GPA: 3.8
Followers: 0

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

Re: Manhattan Remainder Problem [#permalink]  03 Nov 2012, 00:46
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.

Sorry , i didn't understand the last statement written marked in red... instead of 12 if we have other values like 14 or 20 then how remainder would vary.. just lil but curious to understand the gravity
Math Expert
Joined: 02 Sep 2009
Posts: 27123
Followers: 4189

Kudos [?]: 40504 [0], given: 5540

Re: Manhattan Remainder Problem [#permalink]  03 Nov 2012, 00:50
Expert's post
breakit 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.

Sorry , i didn't understand the last statement written marked in red... instead of 12 if we have other values like 14 or 20 then how remainder would vary.. just lil but curious to understand the gravity

$$n=24k+10=12(2k)+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.
_________________
Intern
Status: wants to beat the gmat
Joined: 18 Jul 2012
Posts: 20
Location: United States
Followers: 0

Kudos [?]: 7 [0], given: 1

Re: Manhattan Remainder Problem [#permalink]  03 Nov 2012, 13:14
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, I had a quick question with this explanation:

Do we have to find the LCM? I just multiplied 6 x 8 and got 48 => n = 48k + 10 which also leads to a remainder of 10.
My question is is finding the LCM necessary?
Manager
Joined: 21 Jul 2012
Posts: 69
Followers: 0

Kudos [?]: 8 [0], given: 32

Re: Positive integer n leaves a remainder of 4 after division by [#permalink]  16 Dec 2012, 13:22
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!
Re: Positive integer n leaves a remainder of 4 after division by   [#permalink] 16 Dec 2012, 13:22

Go to page    1   2   3    Next  [ 47 posts ]

Similar topics Replies Last post
Similar
Topics:
11 The positive integers a and b leave remainders of 4 and 7 16 08 Aug 2014, 14:40
13 If n^m leaves a remainder of 1 after division by 7 for all p 10 19 Jun 2011, 09:42
Positive integer n divisible by 4 and 21 3 19 Jul 2009, 09:00
If n is a positive integer and r is the remainder when 4 + 2 30 Apr 2008, 00:50
2 When positive integer n is divisible by 3, the remainder is 11 30 Jan 2008, 01:04
Display posts from previous: Sort by