|
Author |
Message |
|
TAGS:
|
|
|
Manager
Joined: 25 Jun 2012
Posts: 63
Followers: 0
Kudos [?]:
3
[0], given: 20
|
What is the remainder when positive integer t is divided by [#permalink]
 13 Nov 2012, 12:48
Question Stats:
64% (02:05) correct
35% (01:23) wrong based on 1 sessions
What is the remainder when positive integer t is divided by 5? (1) When t is divided by 4, the remainder is 1 (2) When t is divided by 3, the remainder is 1
|
|
|
|
|
|
|
Manager
Joined: 19 Nov 2010
Posts: 93
Followers: 2
Kudos [?]:
38
[0], given: 9
|
Re: What is the remainder when positive integer t is divided by [#permalink]
13 Nov 2012, 13:10
Number picking:
Stmt 1: 1,5,9,13,17,21 and R: 1,0,4,3,2,1 :- looks like a pattern might emerge here, but nothing else - Insufficient
Stmt 2: 1,4,10,13,16 and R: 1,4,0,3,1 :- again a pattern might emerge, but nothing else - Insufficient.
Both: 13,25 R: 3,0 :- Insufficient
Any body has a quick algebra for this?
|
|
|
|
|
|
Manager
Joined: 19 Nov 2010
Posts: 93
Followers: 2
Kudos [?]:
38
[2] , given: 9
|
Re: What is the remainder when positive integer t is divided by [#permalink]
13 Nov 2012, 13:29
2
This post received
KUDOS
On the second thought, I think algebra will go like this:
1: The number would be 4K+1, so (4K + 1)/5 would be 4R*K + R (R means remainder)
So if K is 1 then it will be 4R*1+R = 5R => R=0
if K is 2 then it will be 4R*2 + R = 9R => R = 4 ----- Insuficient
2: The number will be 3K + 1 so (3K + 1)/5 will be 3R*K + R
So if K is 1 then it will be 3R*1 + R = 4R => R = 4
if K is 2 then it will be 3R*2 + R = 7R => R = 2 ---------- Insufficient
Both: The number will be 12K + 1 so (12K + 1)/5 will be 2R*K + R
So if K is 1 then it will be 2R*1 + R = 3R => R = 3
if K is 2 then it will be 2R * 2 + R = 5R => R = 0 --------- Insufficient
Any body has sorter way to do it!
|
|
|
|
|
|
Intern
Status: wants to beat the gmat
Joined: 18 Jul 2012
Posts: 20
Location: United States
Followers: 0
Kudos [?]:
6
[0], given: 1
|
Re: What is the remainder when positive integer t is divided by [#permalink]
13 Nov 2012, 15:56
I believe it's like this:
t/4 => remainder 1 : n can equal: 1, 5, 9, 13, 17, 21, etc
t/3 => remainder 1 : n can equal: 1, 4, 7, 10, 13, etc.
If n = 1 => n/5 remainder 1
If n = 13 => n/5 remainder 3
So it's insufficient. E
|
|
|
|
|
|
Manager
Joined: 16 Feb 2012
Posts: 214
Concentration: Finance, Economics
Followers: 4
Kudos [?]:
18
[0], given: 93
|
Re: What is the remainder when positive integer t is divided by [#permalink]
19 Feb 2013, 01:53
Statement 1: t=4p+1 So the remainder could be 1,5,9,13,17,21,25.... Insufficient Statement 2: t=3q+1 The remainder could be 1,4,7,10,13,16,19... Insufficient 1 and 2: t=12N+1 We take LCM of 3 and 4 plus firs common remainder from the lists above. Now just put in numbers instead of N. t could be 1,13,25,37 and so on... We and conclude from this that we don't know what is the remainder of t and the answer is E.
_________________
Kudos if you like the post!
Failing to plan is planning to fail.
|
|
|
|
|
|
|
Re: What is the remainder when positive integer t is divided by
[#permalink]
19 Feb 2013, 01:53
|
|
|
|
|
|
|
|
|
|
|
close
