Number Prop

This topic has expert replies
Master | Next Rank: 500 Posts
Posts: 233
Joined: Wed Aug 22, 2007 3:51 pm
Location: New York
Thanked: 7 times
Followed by:2 members

Number Prop

by yellowho » Fri Mar 18, 2011 11:38 pm
When positive integer n is divided by 5, the remainder is 1, when n is divided by 7, the remainder is 3. What is the smallest positive integer k such that k+n is a multiple of 35?

Legendary Member
Posts: 857
Joined: Wed Aug 25, 2010 1:36 am
Thanked: 56 times
Followed by:15 members

by AIM GMAT » Fri Mar 18, 2011 11:47 pm
yellowho wrote:When positive integer n is divided by 5, the remainder is 1, when n is divided by 7, the remainder is 3. What is the smallest positive integer k such that k+n is a multiple of 35?
The answer would be 4 .

n = 31 k = 4

n + k = 35

n for 5 giving remainder 1 = [6,11,16,21,26,31,36,41,46,51]
n for 7 giving remainder 3 = [10,17,24,31,38,45,52,59,66,73]

Smallest number common between both sets is 31 .


31/5 gives remainder 1 and 31/7 gives remainder 3 .
Last edited by AIM GMAT on Sat Mar 19, 2011 12:01 am, edited 1 time in total.
Thanks & Regards,
AIM GMAT

Legendary Member
Posts: 586
Joined: Tue Jan 19, 2010 4:38 am
Thanked: 31 times
Followed by:5 members
GMAT Score:730

by rohu27 » Fri Mar 18, 2011 11:50 pm
not sure but is it 4?

Master | Next Rank: 500 Posts
Posts: 233
Joined: Wed Aug 22, 2007 3:51 pm
Location: New York
Thanked: 7 times
Followed by:2 members

by yellowho » Sat Mar 19, 2011 12:15 am
yeah. my way: (testing number)

0 is the first multiple of 35; can't come up with a k and n to satisfy
next 35, works.

I guess we got lucky here is there a "better" way to do this? Perhaps the experts on modulus can chime in.

Legendary Member
Posts: 586
Joined: Tue Jan 19, 2010 4:38 am
Thanked: 31 times
Followed by:5 members
GMAT Score:730

by rohu27 » Sat Mar 19, 2011 12:43 am
k+n is a multiple of 35 - so it an be 35,70 etc
if it is 35, then n shud be 31 to satify the remainders of both 5 and 7. 31+4=35, so k=4
same wth 70. n shud be 66, here too k=4.

this is how i did it. ya but the 0 one doesnt work out though.
yellowho wrote:yeah. my way: (testing number)

0 is the first multiple of 35; can't come up with a k and n to satisfy
next 35, works.

I guess we got lucky here is there a "better" way to do this? Perhaps the experts on modulus can chime in.

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 3835
Joined: Fri Apr 02, 2010 10:00 pm
Location: Milpitas, CA
Thanked: 1854 times
Followed by:523 members
GMAT Score:770

by Anurag@Gurome » Sat Mar 19, 2011 1:31 am
yellowho wrote:When positive integer n is divided by 5, the remainder is 1, when n is divided by 7, the remainder is 3. What is the smallest positive integer k such that k+n is a multiple of 35?
Just note that (n + 4) is multiple of both 5 and 7.
Smallest possible value of (n + 4) is 35 (zero is discarded as that would make n negative)

Therefore, smallest possible value of k is nothing but 4.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/