Last visit was: 23 Apr 2024, 19:13 It is currently 23 Apr 2024, 19:13

Close
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
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.
Close
Request Expert Reply
Confirm Cancel
SORT BY:
Date
Tags:
Show Tags
Hide Tags
User avatar
Intern
Intern
Joined: 13 Nov 2014
Posts: 8
Own Kudos [?]: 2 [0]
Given Kudos: 133
Send PM
avatar
Intern
Intern
Joined: 04 Mar 2015
Posts: 1
Own Kudos [?]: [0]
Given Kudos: 0
Send PM
Tutor
Joined: 16 Oct 2010
Posts: 14816
Own Kudos [?]: 64883 [2]
Given Kudos: 426
Location: Pune, India
Send PM
avatar
Intern
Intern
Joined: 22 Mar 2015
Posts: 1
Own Kudos [?]: [0]
Given Kudos: 0
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
Hi Karishma,

Thanks for the post. I just want to ask, whether we can form a general formula of a number which satisfies 2 equations: divided by "a", remainder b (x=a.n + b) and divided by "c", remainder d (x=c.m + d). Then decide the remainder of x when divided by a*b.

For example, without plugging in number, how to solve the problem: find remainder when x divided by 32 if x = 8n + 3 = 6m + 4?

I find 1 solution but it can only apply for a-b=1 (for eg: x=a.n +b = (a+1)m +d)
Then we have:
(a+1)x = a(a+1)n +(a+1)b
ax = a(a+1)m + ad

Minus 2 equation => x = a(a+1) (n-m) + (a+1)b - ad => remainder when x divided by a(a+1) is (a+1)b-ad.
Tutor
Joined: 16 Oct 2010
Posts: 14816
Own Kudos [?]: 64883 [0]
Given Kudos: 426
Location: Pune, India
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
Expert Reply
minhphamvn wrote:
Hi Karishma,

Thanks for the post. I just want to ask, whether we can form a general formula of a number which satisfies 2 equations: divided by "a", remainder b (x=a.n + b) and divided by "c", remainder d (x=c.m + d). Then decide the remainder of x when divided by a*b.

For example, without plugging in number, how to solve the problem: find remainder when x divided by 32 if x = 8n + 3 = 6m + 4?

I find 1 solution but it can only apply for a-b=1 (for eg: x=a.n +b = (a+1)m +d)
Then we have:
(a+1)x = a(a+1)n +(a+1)b
ax = a(a+1)m + ad

Minus 2 equation => x = a(a+1) (n-m) + (a+1)b - ad => remainder when x divided by a(a+1) is (a+1)b-ad.


Did you check out the last link provided above? Here it is again: https://www.gmatclub.com/forum/veritas-prep-resource-links-no-longer-available-399979.html#/2011/05 ... s-part-ii/

With a case such as this: x = 8n + 3 = 6m + 4, for the first number of this form, you need to use hit and trial.
Note that this example is incorrect since 8n+3 is an odd number and 6m+4 is an even number. But check the post to see how to apply the method to correct questions.
Tutor
Joined: 16 Oct 2010
Posts: 14816
Own Kudos [?]: 64883 [1]
Given Kudos: 426
Location: Pune, India
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
1
Kudos
Expert Reply
vikasbansal227 wrote:
Dear All,


Its difficult that on what basis we took "First common integer in two patterns" as a remainder for the formula?


Can someone please explain,

Thanks



You want a number, n, that satisfies two conditions:
"leaves a remainder of 4 after division by 6" and
"a remainder of 2 after division by 8"

So you find the first such number by writing down the numbers. You get that it is 10.
10 satisfies both conditions.

What will be the next number?
Any number that is a multiple of 6 more than 10 will continue to satisfy the first condition. e.g. 16, 22, 28, 34 etc
Any number that is a multiple of 8 more than 10 will continue to satisfy the second condition. e.g. 18, 26, 34 etc

So any number that is a multiple of both 6 and 8 more than 10 will satisfy both conditions.
LCM of 6 and 8 is 24. 24 is divisible by both 6 and 8.

So any number that is a multiple of 24 more than 10 will satisfy both conditions.
e.g. 34, 58 .. etc
These numbers can be written as 10 + 24a.

Also, I think you did not check out the 4 links I gave here: positive-integer-n-leaves-a-remainder-of-4-after-division-by-93752-40.html#p1496547
They are very useful in understanding divisibility fundamentals.
avatar
Intern
Intern
Joined: 21 Dec 2012
Posts: 4
Own Kudos [?]: [0]
Given Kudos: 5
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
How do we solve a question which has different remainder ? because in this case remainder is -2 , ie common to both the cases? What happens to the case when both the case have different remainder ?

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.

ANSWER "E"

Regards,
Murali.

Kudos?
Tutor
Joined: 16 Oct 2010
Posts: 14816
Own Kudos [?]: 64883 [0]
Given Kudos: 426
Location: Pune, India
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
Expert Reply
happy19 wrote:
How do we solve a question which has different remainder ? because in this case remainder is -2 , ie common to both the cases? What happens to the case when both the case have different remainder ?




Check out this post. It discusses how to handle questions in which the remainders are different.
https://www.gmatclub.com/forum/veritas-prep-resource-links-no-longer-available-399979.html#/2011/05 ... s-part-ii/
Intern
Intern
Joined: 01 Sep 2016
Posts: 6
Own Kudos [?]: 3 [1]
Given Kudos: 40
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
1
Bookmarks
n = 6d + 4
n = 5d + 3

if we multiply the first equation by 5 and the second by 6 we get

5n = 30d + 20 (1)
6n = 30d + 18 (2)

if we make (1) - (2)

-n = 2; n = -2

so -2/30 has a remainder of 28
Senior Manager
Senior Manager
Joined: 13 Oct 2016
Posts: 300
Own Kudos [?]: 768 [1]
Given Kudos: 40
GPA: 3.98
Send PM
Positive integer n leaves a remainder of 4 after division by [#permalink]
1
Bookmarks
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


\(N=4\) (mod 6)
\(N= 3\) (mod 5)

The difference between divisor and remainder is the same for both linear congruences

\(6 -4 = 5 - 3 = 2 = D\)

Hence our N can b represented as:

N = LCM (6, 5)*X - D, where X is >=0 and D is our common differnce.

\(N = 30X - 2\) X=0 ---> N=28

and for N>30

\(\frac{30*X - 2}{30} = \frac{0 - 2}{30}\) = \(-2\) (mod 30) = \(28\) (mod 30)

Answer E.
Intern
Intern
Joined: 26 Apr 2020
Posts: 26
Own Kudos [?]: 7 [0]
Given Kudos: 42
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
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



This is late but i hope it helps others going through the post:

from the conditions given, we get 2 eq's:
1. n = 6*a + 4 ('a' is a quotient)
2. n = 8*b + 2 ('b' is a quotient)

comparing both RHS we get : 3*a + 1 = 4*b
minimum value when above eq is True is when a = 1 and b = 1.
putting these values in the previous eq's, we get : n = 10 which is the answer

Further, To form the general equation: take the LCM of (6,8) = 24
n = 24*k + 10 ('k' is the quotient)

Hope this is short!
cheers!
Target Test Prep Representative
Joined: 14 Oct 2015
Status:Founder & CEO
Affiliations: Target Test Prep
Posts: 18753
Own Kudos [?]: 22041 [0]
Given Kudos: 283
Location: United States (CA)
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
Expert Reply
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

Solution:

Notice that 4 is 2 less than 6 and 3 is also 2 less than 5; thus, a number that has both requirements (i.e., a remainder of 4 after division by 6 and a remainder of 3 after division by 5) is 2 less than the LCM of 6 and 5. Since the LCM of 6 and 5 is 30, that number will be 28. Although we are given that n is greater than 30, we can modify the number by adding 30 to it. That is, n = 28 + 30 = 58, and the remainder when 58 is divided by 30 is 28 (note that 58/6 = 9 R 4 and 58/5 = 11 R 3, satisfying the requirements).

Answer: E
Intern
Intern
Joined: 18 Nov 2017
Posts: 25
Own Kudos [?]: 2 [0]
Given Kudos: 20
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
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


Alternative Solution:

As we know any number can be written in the form
Number = Divisor x Quotient plus Remainder

Quote:
n leaves a remainder of 4 after division by 6


n=6x+4 (1) ; x>=0, belongs Integer

Quote:
n leaves a remainder of 3 after division by 5


n=5y+3 (2) ; y>=0, belongs Integer

Multiply (1) by 5 and (2) by 6. we get

5n=30x+20 (3)
6n=30y+18 (4)

Substract (4)-(3)
n=30(y-x)-2

As x,y are variables, we can replace y-x with another variable k where y>=0, belongs Integer. However, to get the equation in the form of number = Divisor x Quotient plus Remainder, we can substitute y-x with k+1; we get
n=30(k+1)-2, or
n=30k+28

Comparing this equation to number = Divisor x Quotient plus Remainder
Remainder = 28 (Ans)
Manager
Manager
Joined: 26 Oct 2021
Posts: 117
Own Kudos [?]: 27 [0]
Given Kudos: 95
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
Hi,

here is a little proof. Let int.=x,y > 0

n=6x+4
n=5y+3, setting equal we get
6x+4=5y+3
6x-5y=-1

The above means that look for x,y such that 5y is 1 greater than 6x. Now we know that 5y always ends at 0,5 and for 6x to be one smaller than 5y, it needs to end therefore by 9,4. But 6x never ends at 9, meaning we just check all ways where 6x ends at 4:
x=9 -> 54. Now, adding 6 to make it 60, we can again add 24 or 54 making it 84,114, respectively. This means that x=14 to make 6x=84, and x=19 to make 6x=114. We can see a nice pattern here. All x that fulfill 6x to end with 4 are given by:

x=9+5z, z>=0

We know that we can always find y with 5y being one smaller than something ending with unit digit 4, so no need to proof anything for 5y. Plugging in our x into n=6x+4:
n=6(9+5z)+4
=54+30z+4
=58+30z

Now, dividing this by 30, we get:
(58+30z)/30=(58/30)+(30z/30)

The first term equals 1 R28, the second term always equals z, so that in total we get:
1+z R28

So the remainder is always 28

The easier and quicker method is just finding the number 58, but I think it's better to understand WHY things are the way they are than just looking for a great guess ...
Intern
Intern
Joined: 01 Mar 2022
Posts: 28
Own Kudos [?]: 11 [0]
Given Kudos: 10
Location: Canada
Concentration: Strategy, Leadership
GPA: 3.7
WE:Engineering (Consulting)
Send PM
Positive integer n leaves a remainder of 4 after division by [#permalink]
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.




Hi Bunnel,

I didn't understand how 'n' became 'r' in the final formula, so that's why I went a little further with forming number beyond 28 considering n>30 given condition. Could you please throw come light on former point I mentioned?

My solution is :

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

So let n be 58 because n>30 (Given)

n=30x+r
58 = 30(1) + r
58-30=r
28=r

Please correct if I am wrong.
Tutor
Joined: 11 May 2022
Posts: 1092
Own Kudos [?]: 695 [1]
Given Kudos: 81
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
1
Kudos
Expert Reply
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


Since n leaves a remainder of 4 (which is even) after division by 6 (which is even), we know n is even. A is wrong.
Since n leaves a remainder of 3 after division by 5, we know the ones digit of n is either 3 or 8. B and D are wrong.
Let's just try something for C. We need a remainder of 18 after dividing by 30. How about 48. If we divide by 6, we don't get a remainder of 4. That didn't work.
Let's try something for E. We need a remainder of 18 after dividing by 30. How about 58. If we divide by 6, we get a remainder of 4. If we divide by 5, we get a remainder of 3. Giddy up.

Answer choice E.
Manager
Manager
Joined: 17 Nov 2022
Posts: 115
Own Kudos [?]: 7 [0]
Given Kudos: 8
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
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.


n=24k+10, so if n is divided by 24, the remainder is 10. How do I know, that if n is divided by 12, the remainder is also 10?
Manager
Manager
Joined: 17 Nov 2022
Posts: 115
Own Kudos [?]: 7 [0]
Given Kudos: 8
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
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.


if n divided by 24 gives a remainder of 10, then why must n divided by 12 also give a remainder of 10?
Math Expert
Joined: 02 Sep 2009
Posts: 92883
Own Kudos [?]: 618606 [0]
Given Kudos: 81563
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
Expert Reply
Schachfreizeit 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.


if n divided by 24 gives a remainder of 10, then why must n divided by 12 also give a remainder of 10?


n divided by 24 gives a remainder of 10:

n = 24k + 10.

24k is divisible by 12, so the remainder upon division n by 12 will be from 10 divided by 12. 10 divided by 12 gives the reminder of 10.

I think you should go through some theory to brush up fundamentals.

6. Remainders



For other subjects:
ALL YOU NEED FOR QUANT ! ! !
Ultimate GMAT Quantitative Megathread

Hope it helps.
Intern
Intern
Joined: 24 Dec 2022
Posts: 4
Own Kudos [?]: 1 [0]
Given Kudos: 4
Send PM
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
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


This is how I proceeded without looking at LCM or common integer theory:
\(\\
n = 6\lambda + 4 ----- (1)\\
n = 5\phi + 3 -----(2)\\
\)
and we are looking for something like:
\(\\
n = 30\sigma + remainder\\
\)
looking at 5, and 6, I though if I could subtract given equations I can get the n again on left hand side. So:
\(\\
(2)*6 - (1)*5\\
6n - 5n = 6*(5\phi + 3) - 5*(6\lambda + 4)\\
n = 30(\phi - \lambda) - 2\\
\)
OR (adding and subtracting 30 on RHS)
\(\\
n = 30\sigma + 28\\
\)

Hence the answer is (E) 28.
GMAT Club Bot
Re: Positive integer n leaves a remainder of 4 after division by [#permalink]
   1   2 
Moderators:
Math Expert
92883 posts
Senior Moderator - Masters Forum
3137 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne