Author 
Message 
TAGS:

Hide Tags

Retired Moderator
Joined: 05 Jul 2006
Posts: 1327

When n is divided by 5 the remainder is 2. When n is divided
[#permalink]
Show Tags
18 Aug 2009, 04:39
Question Stats:
49% (02:30) correct 51% (02:39) wrong based on 318 sessions
HideShow timer Statistics
When n is divided by 5 the remainder is 2. When n is divided by 7 the remainder is 1. If n is less than 800 , how many values of n are possible? A. 22 B. 23 C. 24 D. 25 E. 26
Official Answer and Stats are available only to registered users. Register/ Login.




Math Expert
Joined: 02 Sep 2009
Posts: 64317

Re: When n is divided by 5 the remainder is 2. When n is divided
[#permalink]
Show Tags
27 Feb 2012, 13:24
yezz wrote: When n is divided by 5 the remainder is 2. When n is divided by 7 the remainder is 1. If n is less than 800 , how many values of n are possible?
A. 22 B. 23 C. 24 D. 25 E. 26 First of all it should be mentioned in the stem that \(n\) is a positive integer: every GMAT divisibility question will tell you in advance that any unknowns represent positive integers.Given: \(n=5p+2\), so \(n\) can be: 2, 7, 12, 17, 22, 27, ... \(n=7q+1\), so \(n\) can be: 1, 8, 15, 22, 29, ... General formula for \(n\) based on above two statements will be: \(n=35k+22\) (the divisor should be the least common multiple of above two divisors 5 and 7, so 35 and the remainder should be the first common integer in above two patterns, hence 22). Next, given that \(35k+22<800\) > \(k<22.something\) > so \(k\), can take 23 values from 0 to 22, inclusive, which means that \(n\) also can take 23 values (the least value of \(n\) will be 22 for \(k=0\)). Answer: B. For more about this concept see: manhattanremainderproblem93752.html#p721341whenpositiveintegernisdividedby5theremainderis90442.html#p722552whenthepositiveintegeraisdividedby5and125591.html#p1028654Hope it helps.
_________________




Current Student
Status: What's your raashee?
Joined: 12 Jun 2009
Posts: 1704
Location: United States (NC)
Concentration: Strategy, Finance
Schools: UNC (KenanFlagler)  Class of 2013
WE: Programming (Computer Software)

Re: remainders
[#permalink]
Show Tags
18 Aug 2009, 06:14
mirzohidjon wrote: is it B? I see that the first N is 22 that satisfies the criteria. Then 35 values later 57 satisfies and so on... multiplying 35 X 22 we get 770 and adding the 22 from the beginning we have 23 Ns
I see how u get 22, 57 (most likely just by guessing) but I am not able to follow your logic how u find the formula, where u multiply 35 by 22, and get 770 adding 22 u get 23Ns? Can u explain please in detail? Thank u well we start with 22. Now we need to find the next number that ends in 2 or 7 to satisfy 5's criteria. Since 22 already has remainder of 1 for 7 all we need to do is add 7 to it to find the next number ends in 2 or 7. After finding that number (57) we see the gap is 35. it will keep being 35 since the remainder will keep switching like before until the next N is found. since we know the "gap" is 35 then we multiply by 22( the lowest possible answer) to get 770. Since we know the value starts at 22 and 792 is only a few behind 800 so we stop there. You could also see it as : 22 + 35*x = 800 and find the value that way but I was lazy and used the answer choices (plus it is pretty easy to do 35*22 on the fly). It is probably no coincidence that the gap is 5 X 7 (both values in question are in it) but the number property escapes me so i dont want to feed you the wrong info. But even without it you can get to the 2nd value pretty quick and notice the pattern (can add another 35 to it to double check i guess...).




Current Student
Status: What's your raashee?
Joined: 12 Jun 2009
Posts: 1704
Location: United States (NC)
Concentration: Strategy, Finance
Schools: UNC (KenanFlagler)  Class of 2013
WE: Programming (Computer Software)

Re: remainders
[#permalink]
Show Tags
18 Aug 2009, 05:09
yezz wrote: When n is divided by 5 the remainder is 2. When n is divided by 7 the remainder is 1. If n is less than 800 , how many values of n are possible?
a)22 b)23 c)24 d)25 e)26 is it B? I see that the first N is 22 that satisfies the criteria. Then 35 values later 57 satisfies and so on... multiplying 35 X 22 we get 770 and adding the 22 from the beginning we have 23 Ns You should also notice that N only satisfies 5 if it ends with 2 or 7. Since we know n starts with 22 we can just keep adding 7s to it (to keep 7's remainder) until we hit a number that ends in 2 or 7 to satisfy 5 (7s already satisfied since we kept adding 7s to it). after getting the next one you can then divide it out and find how many "35 number gaps" there are.



Senior Manager
Joined: 18 Aug 2009
Posts: 257
Schools: UT at Austin, Indiana State University, UC at Berkeley
WE 1: 5.5
WE 2: 5.5
WE 3: 6.0

Re: remainders
[#permalink]
Show Tags
18 Aug 2009, 05:30
is it B? I see that the first N is 22 that satisfies the criteria. Then 35 values later 57 satisfies and so on... multiplying 35 X 22 we get 770 and adding the 22 from the beginning we have 23 Ns
I see how u get 22, 57 (most likely just by guessing) but I am not able to follow your logic how u find the formula, where u multiply 35 by 22, and get 770 adding 22 u get 23Ns? Can u explain please in detail? Thank u



Manager
Joined: 10 Aug 2009
Posts: 93

Re: remainders
[#permalink]
Show Tags
21 Aug 2009, 05:33
I think you are right. It is not a coincidence that you add 35, which is LCM(5,7). I think the following might explain why LCM should be the gap between the numbers. We have two equations: n=5X+2 n=7y+1 To find the next number, so that n=5*integer+2, the multiple of 5 should be added to the previous number: n+5k=5x+5k+2=5*(x+k)+2. So, the new number still has a remainder of 2 when divided by 5. By the same logic, a multiple of 7 should be added to leave a remainder of 1 when divided by 7. It seems to me that if you add a multiple of a divisor to a dividend, a remainder is unchanged when a new number (dividend plus a multiple of divisor) is divided by the same divisor. To leave a remainder of 2 when divided by 5 and a remainder of 1 when divided by 7, a multiple of both 5 and 7 should be added. Since we are asked to find the maximum, we should add the smallest multiple  LCM: n1=22 n2=n1+35 n3=n2+35 etc...



SVP
Joined: 29 Mar 2007
Posts: 1664

Re: remainders
[#permalink]
Show Tags
21 Aug 2009, 09:09
shaselai wrote: yezz wrote: When n is divided by 5 the remainder is 2. When n is divided by 7 the remainder is 1. If n is less than 800 , how many values of n are possible?
a)22 b)23 c)24 d)25 e)26 is it B? I see that the first N is 22 that satisfies the criteria. Then 35 values later 57 satisfies and so on... multiplying 35 X 22 we get 770 and adding the 22 from the beginning we have 23 Ns You should also notice that N only satisfies 5 if it ends with 2 or 7. Since we know n starts with 22 we can just keep adding 7s to it (to keep 7's remainder) until we hit a number that ends in 2 or 7 to satisfy 5 (7s already satisfied since we kept adding 7s to it). after getting the next one you can then divide it out and find how many "35 number gaps" there are. I came up with 35 as well after writing it out. No way I could ever do this in 2min. Interestingly after coming up with 35... and plowing through to the answer I get 23. An easier way... that may work (not sure whether its full proof). 800/35= 22.857=~23...



Manager
Joined: 14 Aug 2009
Posts: 88

Re: remainders
[#permalink]
Show Tags
21 Aug 2009, 09:16
for question we can get: 1) n=5x+2 2) n=7y+1
therefore x=(7y1)/5, so the last digit of 7y is either 1 or 6
when last digit is 1: y=3, 13, 23... y=10t+3 then for 2), n=7(10t+3)+1<800 t<11.1, so, n could be 12 values.
when last digit is 6: y=8, 18, 28 y=10k+8 then for 2), n=7(10k+8)+1<800 k<10.6 so n could have 11 values.
in sum, n could have 23 values.



Manager
Joined: 27 May 2009
Posts: 153

Re: remainders
[#permalink]
Show Tags
21 Aug 2009, 10:00
GMATBLACKBELT wrote: shaselai wrote: yezz wrote: When n is divided by 5 the remainder is 2. When n is divided by 7 the remainder is 1. If n is less than 800 , how many values of n are possible?
a)22 b)23 c)24 d)25 e)26 is it B? I see that the first N is 22 that satisfies the criteria. Then 35 values later 57 satisfies and so on... multiplying 35 X 22 we get 770 and adding the 22 from the beginning we have 23 Ns You should also notice that N only satisfies 5 if it ends with 2 or 7. Since we know n starts with 22 we can just keep adding 7s to it (to keep 7's remainder) until we hit a number that ends in 2 or 7 to satisfy 5 (7s already satisfied since we kept adding 7s to it). after getting the next one you can then divide it out and find how many "35 number gaps" there are. I came up with 35 as well after writing it out. No way I could ever do this in 2min. Interestingly after coming up with 35... and plowing through to the answer I get 23. An easier way... that may work (not sure whether its full proof). 800/35= 22.857=~23...I dont think you can take it approx 23 ..it has to be 22...... The answer is 23 because it adds the first value ie 22 which the calculation doesnt include.



Manager
Joined: 10 Aug 2009
Posts: 93

Re: remainders
[#permalink]
Show Tags
21 Aug 2009, 10:51
GMATBLACKBELT wrote: shaselai wrote: yezz wrote: When n is divided by 5 the remainder is 2. When n is divided by 7 the remainder is 1. If n is less than 800 , how many values of n are possible?
a)22 b)23 c)24 d)25 e)26 is it B? I see that the first N is 22 that satisfies the criteria. Then 35 values later 57 satisfies and so on... multiplying 35 X 22 we get 770 and adding the 22 from the beginning we have 23 Ns You should also notice that N only satisfies 5 if it ends with 2 or 7. Since we know n starts with 22 we can just keep adding 7s to it (to keep 7's remainder) until we hit a number that ends in 2 or 7 to satisfy 5 (7s already satisfied since we kept adding 7s to it). after getting the next one you can then divide it out and find how many "35 number gaps" there are. I came up with 35 as well after writing it out. No way I could ever do this in 2min. Interestingly after coming up with 35... and plowing through to the answer I get 23. An easier way... that may work (not sure whether its full proof). 800/35= 22.857=~23... You can come up with 35 very fast. The difference between the numbers should be LCM (least common multiple) of 5 and 7. Otherwise n will not satisfy both equations : n=5*x+2 and n=7*y+1. As soon as I got 35, I figured out that the first number is 22 (simply by picking numbers). Then (80022)/35 will be 22.22. So there should be 22 numbers not including the first number and 23 in total.



Manager
Joined: 10 Jul 2009
Posts: 83
Location: Ukraine, Kyiv

Re: remainders
[#permalink]
Show Tags
Updated on: 02 Sep 2009, 11:51
I think the answer is A. 22. Here is my solution:
N= 2(mod 5) N=1(mod 7)
5X+2=N 7Y+1=N
5X+2=7Y+1 5X=7Y1 X=(7Y1)/5
min value of Y = 3 min value of N = 22
LCM(7,5) = 35
N=35T+22 35T+4 < (IS LESS) 800 35T<778 T<22.22
Thus, T (number of Ns) is equal to 22, because the nearest integer, which is less than 778/35 is 22. However, if we insert the T (22) in a formula N=35T+22, we can see that there are 23 integers on the number line, which is least than 800.
Excuse me for my previous mistake. Definitely B, 23
Originally posted by barakhaiev on 02 Sep 2009, 09:14.
Last edited by barakhaiev on 02 Sep 2009, 11:51, edited 1 time in total.



Manager
Joined: 18 Jul 2009
Posts: 123
Location: India
Schools: South Asian Bschools

Re: remainders
[#permalink]
Show Tags
04 Sep 2009, 00:38
i think using 800/35 is a quick approach but to be effective we need to be very cautious...ans is 23



SVP
Joined: 29 Aug 2007
Posts: 1733

Re: remainders
[#permalink]
Show Tags
05 Sep 2009, 21:59
defoue wrote: Can you guys explain how can we know that frst nbr is 22?
Thx You have to work out. There is no way that you can pick 22 as a magic number... First: n = 5n + 2 n could be 2, 7, 12, 17, 22, 27, 32, 37, 42, 37, 52, 57, 62 and so on................ Second: n = 7n + 1 n could be 1, 8, 15, 22, 29, 36, 43, 50, 57, 64 and so on................ Pick the first number that is in both equation..



Manager
Status: mba here i come!
Joined: 07 Aug 2011
Posts: 179

Re: remainders
[#permalink]
Show Tags
27 Feb 2012, 10:02
ans: 23 .. for sure
n = 35k+22 .. this is the equation at hand.
35k+22 < 800 k < 22.2 k = 22
total possible numbers = 22+1 = 23 .. we're adding 1 because the value of k starts from 0. here's a list of possible numbers to clear any doubts.
0  22 1  57 2  92 3  127 4  162 5  197 6  232 7  267 8  302 9  337 10  372 11  407 12  442 13  477 14  512 15  547 16  582 17  617 18  652 19  687 20  722 21  757 22  792



Intern
Joined: 05 Apr 2012
Posts: 38

Re: When n is divided by 5 the remainder is 2. When n is divided
[#permalink]
Show Tags
09 May 2012, 01:06
Bunuel wrote: yezz wrote: When n is divided by 5 the remainder is 2. When n is divided by 7 the remainder is 1. If n is less than 800 , how many values of n are possible?
A. 22 B. 23 C. 24 D. 25 E. 26 First of all it should be mentioned in the stem that \(n\) is a positive integer: every GMAT divisibility question will tell you in advance that any unknowns represent positive integers.Given: \(n=5p+2\), so \(n\) can be: 2, 7, 12, 17, 22, 27, ... \(n=7q+1\), so \(n\) can be: 1, 8, 15, 22, 29, ... General formula for \(n\) based on above two statements will be: \(n=35k+22\) (the divisor should be the least common multiple of above two divisors 5 and 7, so 35 and the remainder should be the first common integer in above two patterns, hence 22). Next, given that \(35k+22<800\) > \(k<22.something\) > so \(k\), can take 23 values from 0 to 22, inclusive, which means that \(n\) also can take 23 values (the least value of \(n\) will be 22 for \(k=0\)). Answer: B. For more about this concept see: manhattanremainderproblem93752.html#p721341whenpositiveintegernisdividedby5theremainderis90442.html#p722552whenthepositiveintegeraisdividedby5and125591.html#p1028654Hope it helps. hello BRUNUEL i understood up to 35K+22 Smaller than 800 BUT how did you get the non inclusive 22 values thanks so much best regards



Math Expert
Joined: 02 Sep 2009
Posts: 64317

Re: When n is divided by 5 the remainder is 2. When n is divided
[#permalink]
Show Tags
09 May 2012, 01:10
keiraria wrote: Bunuel wrote: yezz wrote: When n is divided by 5 the remainder is 2. When n is divided by 7 the remainder is 1. If n is less than 800 , how many values of n are possible?
A. 22 B. 23 C. 24 D. 25 E. 26 First of all it should be mentioned in the stem that \(n\) is a positive integer: every GMAT divisibility question will tell you in advance that any unknowns represent positive integers.Given: \(n=5p+2\), so \(n\) can be: 2, 7, 12, 17, 22, 27, ... \(n=7q+1\), so \(n\) can be: 1, 8, 15, 22, 29, ... General formula for \(n\) based on above two statements will be: \(n=35k+22\) (the divisor should be the least common multiple of above two divisors 5 and 7, so 35 and the remainder should be the first common integer in above two patterns, hence 22). Next, given that \(35k+22<800\) > \(k<22.something\) > so \(k\), can take 23 values from 0 to 22, inclusive, which means that \(n\) also can take 23 values (the least value of \(n\) will be 22 for \(k=0\)). Answer: B. For more about this concept see: manhattanremainderproblem93752.html#p721341whenpositiveintegernisdividedby5theremainderis90442.html#p722552whenthepositiveintegeraisdividedby5and125591.html#p1028654Hope it helps. hello BRUNUEL i understood up to 35K+22 Smaller than 800 BUT how did you get the non inclusive 22 values thanks so much best regards \(35k+22<800\) > \(k<22.something\) > so \(k\) can be: 0, 1, 2, ..., 21, 22, so it can take total of 23 values. Hope it's clear.
_________________



Intern
Joined: 09 Feb 2009
Posts: 14

Re: When n is divided by 5 the remainder is 2. When n is divided
[#permalink]
Show Tags
09 May 2012, 04:16
Quote: General formula for n based on above two statements will be: n=35k+22 (the divisor should be the least common multiple of above two divisors 5 and 7, so 35 and the remainder should be the first common integer in above two patterns, hence 22). I don't understand why the remainder should be the first common integer (22).. could you please explain?



Math Expert
Joined: 02 Sep 2009
Posts: 64317

Re: When n is divided by 5 the remainder is 2. When n is divided
[#permalink]
Show Tags
09 May 2012, 05:53
jacket882 wrote: Quote: General formula for n based on above two statements will be: n=35k+22 (the divisor should be the least common multiple of above two divisors 5 and 7, so 35 and the remainder should be the first common integer in above two patterns, hence 22). I don't understand why the remainder should be the first common integer (22).. could you please explain? 22 is the first number that satisfies both conditions, so in general formula it should be the first possible value of n (for k=0).
_________________



Intern
Joined: 13 Jul 2012
Posts: 4

Re: When n is divided by 5 the remainder is 2. When n is divided
[#permalink]
Show Tags
14 Jul 2012, 01:48
When n is divided by 5 the remainder is 2. When n is divided by 7 the remainder is 1. If n is less than 800 , how many values of n are possible?
n = 5x +2, so the unit place must be 2 or 7 n = 7y +1 > n1 = 7y, so (n1) is divisible by 7 or I need to sort out all the numbers which are divisible by 7 with the unit place of 1 or 6.
Look at the first 10 multipications of 7, 7*1 = 7 7*2 = 14 7*3 = 21 7*4 = 28 etc. we have the unit place are 7, 4, 1, 8, 5, 2, 9, 6, 3, 0, respectively. This round will repeat endlessly. Obviously, we can pick 2 out of those first 70 numbers which satisfy the 2 requirements above (divisible by 7 and unit place is either 1 or 6). From 0 to 799 we have 11 rounds like that, that means we can pick 11*2=22 numbers out of 770 numbers. From 771 to 799 we don't have an entire round, but from 7, 4, 1, 8, and we can pick 1 number more.
Totally, we have 22+1=23 numbers > B.



Intern
Joined: 23 May 2012
Posts: 28

Re: When n is divided by 5 the remainder is 2. When n is divided
[#permalink]
Show Tags
18 Oct 2012, 23:29
yezz wrote: When n is divided by 5 the remainder is 2. When n is divided by 7 the remainder is 1. If n is less than 800 , how many values of n are possible?
A. 22 B. 23 C. 24 D. 25 E. 26 n= 5p +2 ; 2,7,12,17, 22n= 7q+1 ; 1,8,15, 22 LCM of 7 & 5 : 35 so, n = 35z +22 Tn = a + (n1)d a= 22 d =35 I started with putting options as values of n Start with c) so : Tn >800+ Then put b) n= 23.... so Tn =792 which is the answer b)




Re: When n is divided by 5 the remainder is 2. When n is divided
[#permalink]
18 Oct 2012, 23:29



Go to page
1 2
Next
[ 26 posts ]

