Last visit was: 25 Apr 2024, 12:45 It is currently 25 Apr 2024, 12:45

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
User avatar
Director
Director
Joined: 14 Dec 2004
Posts: 885
Own Kudos [?]: 992 [0]
Given Kudos: 0
Send PM
User avatar
Director
Director
Joined: 28 Mar 2006
Posts: 674
Own Kudos [?]: 65 [0]
Given Kudos: 0
Send PM
User avatar
Director
Director
Joined: 24 Sep 2005
Posts: 833
Own Kudos [?]: 1481 [0]
Given Kudos: 0
Send PM
User avatar
Director
Director
Joined: 28 Mar 2006
Posts: 674
Own Kudos [?]: 65 [0]
Given Kudos: 0
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
laxieqv wrote:
vivek123 wrote:
What is integer n?

1. When divided by 7, remainder is 3
2. When divided by 4, remainder is 2


Applying Chinese modulus theorem, we get n= 28s+10 ( s is non-negative integer)
There're plenty of values of m ---> there're infinitively many values of n satisfying the two statements --> E it is!

How to apply Chinese modulus theorem:

from 1: n= 3( mod 7) (1)
from 2: n= 2 ( mod 4) (2)

from 2: n= 4v+2 , substitute this to (1), we get: 4v+2= 3(mod 7)
---> 4v= 1( mod 7) ---> v= 2 (mod 7) ( because 2*4= 8 which is divided by 7 has a remainder of 1) --> v= 7s +2 --> n= 4v+2= 4(7s+2)+2 --> n = 28s + 10


Yes it is E.... :?

I find another set of values

when y =9 and x=5 in my solution but your looks more elegant, laxieqv

Thanks!
User avatar
Manager
Manager
Joined: 25 Mar 2006
Posts: 89
Own Kudos [?]: 2 [0]
Given Kudos: 0
Location: Stonybrook Univ
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
Laxieqv ... thats super clever .. i havent seen that before but can you explain where this theorem came from ? and where else it could be used ?
User avatar
Director
Director
Joined: 24 Sep 2005
Posts: 833
Own Kudos [?]: 1481 [0]
Given Kudos: 0
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
NTLancer wrote:
Laxieqv ... thats super clever .. i havent seen that before but can you explain where this theorem came from ? and where else it could be used ?


you can check it out here :) https://www.gmatclub.com/phpbb/viewtopic.php?t=27093
User avatar
Director
Director
Joined: 20 Sep 2005
Posts: 799
Own Kudos [?]: 52 [0]
Given Kudos: 0
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
E.

n = 36,66....it seems strange but I found these values under 2 :).

I am not sure on the GMAT I will figure out that "C" is the trap....unless it says that the question is from vivek :).

vivek123 wrote:
What is integer n?

1. When divided by 7, remainder is 3
2. When divided by 4, remainder is 2
User avatar
Manager
Manager
Joined: 22 Nov 2005
Posts: 210
Own Kudos [?]: 70 [0]
Given Kudos: 0
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
trivikram wrote:
laxieqv wrote:
vivek123 wrote:
What is integer n?

1. When divided by 7, remainder is 3
2. When divided by 4, remainder is 2


Applying Chinese modulus theorem, we get n= 28s+10 ( s is non-negative integer)
There're plenty of values of m ---> there're infinitively many values of n satisfying the two statements --> E it is!

How to apply Chinese modulus theorem:

from 1: n= 3( mod 7) (1)
from 2: n= 2 ( mod 4) (2)

from 2: n= 4v+2 , substitute this to (1), we get: 4v+2= 3(mod 7)
---> 4v= 1( mod 7) ---> v= 2 (mod 7) ( because 2*4= 8 which is divided by 7 has a remainder of 1) --> v= 7s +2 --> n= 4v+2= 4(7s+2)+2 --> n = 28s + 10


Yes it is E.... :?

I find another set of values

when y =9 and x=5 in my solution but your looks more elegant, laxieqv

Thanks!


LAXI can u explain how you got this
---> 4v= 1( mod 7) ---> v= 2 (mod 7)
User avatar
Director
Director
Joined: 14 Dec 2004
Posts: 885
Own Kudos [?]: 992 [0]
Given Kudos: 0
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
The OA is "E" :)

Laxie, thanks for the logic buddy! :good
avatar
Director
Director
Joined: 03 Jan 2005
Posts: 971
Own Kudos [?]: 769 [0]
Given Kudos: 0
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
That is very elegant Laxie!

For people who are a little weary of the whole sequence of the Chinese modulus theorem, I hope this will help: You don't have to memorize it. :-D

Basically you write the two conditions:
n=7a+3
n=4b+2

Therefore 4b=7a-1=8a-a-1
b=2a-(a-1)/4
We know that b is an integer so (a-1)/4 must be an integer.
We can write as a-1=4s, or a=4s+1.

Now we know
a=4s+1,
b=2(4s+1)-s=7s+2

You can solve for n here from either a or b, although you don't have to. As long as you know that when s takes different values, you'll have different values for a and b and thus different values of n. In other words you'll know that the solution is not unique and the answer would be E.
User avatar
Director
Director
Joined: 24 Sep 2005
Posts: 833
Own Kudos [?]: 1481 [0]
Given Kudos: 0
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
HongHu wrote:
Basically you write the two conditions:
n=7a+3
n=4b+2

Therefore 4b=7a-1=8a-a-1
b=2a-(a-1)/4
We know that b is an integer so (a-1)/4 must be an integer.
We can write as a-1=4s, or a=4s+1.

Now we know
a=4s+1,
b=2(4s+1)-s=7s+2

You can solve for n here from either a or b, although you don't have to. As long as you know that when s takes different values, you'll have different values for a and b and thus different values of n. In other words you'll know that the solution is not unique and the answer would be E.


I'm just so impressed by you, sis :)
User avatar
SVP
SVP
Joined: 07 Jul 2004
Posts: 2004
Own Kudos [?]: 1899 [0]
Given Kudos: 0
Location: Singapore
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
The method is neat! And I must say it's the first time I've heard of it. But for people who are stuck, working out with sample numbers present a very quick approach as well.

1) n = 7q1 + 3

n could be 10
n could be 15
etc

Insufficient.

2) n = 4q2 + 1
n could be 5
n could be 9
etc

Insufficient.

Using 1) and 2)
n = 7q1 + 3
n = 4q2 + 1

7q1+3 = 4q2+1
2 = 4q2-7q1

Possible sets: (q1,q2) = (4,2) (11,6) --> means many possible values of n

Ans E
User avatar
Director
Director
Joined: 14 Dec 2004
Posts: 885
Own Kudos [?]: 992 [0]
Given Kudos: 0
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
I'm impressed by you all :-D
Thanks Hong, Laxie & Wilfred! :good
User avatar
Manager
Manager
Joined: 20 Feb 2006
Posts: 76
Own Kudos [?]: 460 [0]
Given Kudos: 0
Send PM
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
Extension to HongHu's method:

N = 7a + 3
N = 4b + 2

=> 7a+1 is divisible by 4.
Smallest possible positive value of a satisfying above equation is a = 1.
when a = 1, N = 10

LCM of 7,4 = 28

Hence, the set of all such numbers can be written as 28k + 10.

We can extend this procedure to solve more than 2 equations also.



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
GMAT Club Bot
Re: What is integer n? 1. When divided by 7, remainder is 3 2. [#permalink]
Moderators:
Math Expert
92914 posts
Senior Moderator - Masters Forum
3137 posts
GMAT Tutor
1905 posts

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