November 17, 2018 November 17, 2018 07:00 AM PST 09:00 AM PST Nov. 17, 7 AM PST. Aiming to score 760+? Attend this FREE session to learn how to Define your GMAT Strategy, Create your Study Plan and Master the Core Skills to excel on the GMAT. November 17, 2018 November 17, 2018 09:00 AM PST 11:00 AM PST Join the Quiz Saturday November 17th, 9 AM PST. The Quiz will last approximately 2 hours. Make sure you are on time or you will be at a disadvantage.
Author 
Message 
TAGS:

Hide Tags

Manager
Joined: 25 Jun 2012
Posts: 64

What is the remainder when positive integer t is divided by
[#permalink]
Show Tags
13 Nov 2012, 11:48
Question Stats:
68% (01:47) correct 32% (01:40) wrong based on 340 sessions
HideShow timer Statistics
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
Official Answer and Stats are available only to registered users. Register/ Login.




MBA Section Director
Affiliations: GMAT Club
Joined: 21 Feb 2012
Posts: 5797
City: Pune

Re: What is the remainder when positive integer t is divided by
[#permalink]
Show Tags
01 Oct 2013, 10:09
actleader wrote: 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 Somewhat different way....... LCM MODEL 1 : Any Number N which when divided by p, q, r leaving the same remainder s in each case. The Number will be of the form N = k(LCM of p, q, r) + s, where k is any non negative integer. S1 : t = 4q + 1 > clearly insufficient S2 : t = 3q + 1 > clearly insufficient S1 + S2 : Applying above Model > t = k(LCM of 4 and 3) + 1 > t = 12k + 1 > t = 1, 13, 25, 37, 49 ..... Multiple Answers, Hence Insufficient Choice E Hope that helps!
_________________
Chances of Getting Admitted After an Interview [Data Crunch]
Must Read Forum Topics Before You Kick Off Your MBA Application
New GMAT Club Decision Tracker  Real Time Decision Updates




Manager
Joined: 19 Nov 2010
Posts: 83

Re: What is the remainder when positive integer t is divided by
[#permalink]
Show Tags
13 Nov 2012, 12: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: 83

Re: What is the remainder when positive integer t is divided by
[#permalink]
Show Tags
13 Nov 2012, 12:29
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: 19
Location: United States

Re: What is the remainder when positive integer t is divided by
[#permalink]
Show Tags
13 Nov 2012, 14: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: 178
Concentration: Finance, Economics

Re: What is the remainder when positive integer t is divided by
[#permalink]
Show Tags
19 Feb 2013, 00: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.



Director
Joined: 03 Aug 2012
Posts: 744
Concentration: General Management, General Management
GMAT 1: 630 Q47 V29 GMAT 2: 680 Q50 V32
GPA: 3.7
WE: Information Technology (Investment Banking)

Re: What is the remainder when positive integer t is divided by
[#permalink]
Show Tags
10 Aug 2013, 01:13
Although not a sound approach, here is one:
t=5A + r (What is r?)
(1).
t = 4b + 1 ..... 1 5 9 13 17 ( all give different remainders by 5) Insufficient
(2).
t = 3c + 1 ......1 4 7 10 13 16 ( all give different remainders by 5) Insufficient
Combining them series would be :
t = 12X + 13 ............ 13 , 25, .... (all give different remainders by 5) Insufficient
Hence , (E).



Manager
Joined: 08 Nov 2014
Posts: 84
Location: India
GPA: 3
WE: Engineering (Manufacturing)

Re: What is the remainder when positive integer t is divided by
[#permalink]
Show Tags
20 Jan 2015, 10:32
In S1 and S2 why you have considered Quotients as q only it can be other variables instead and if we solve S1S2 then , q=0, this will give t=1 so, 1/4 ............. remainder 1 1/3.............. remainder 1 and, 1/5 ........... remainder 1 On the contrary I think equations would be t= 4p+1 and, t= 3q+1 Two equations three unknowns, hence no solution. E answer Narenn wrote: actleader wrote: 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 Somewhat different way....... LCM MODEL 1 : Any Number N which when divided by p, q, r leaving the same remainder s in each case. The Number will be of the form N = k(LCM of p, q, r) + s, where k is any non negative integer. S1 : t = 4q + 1 > clearly insufficient S2 : t = 3q + 1 > clearly insufficient S1 + S2 : Applying above Model > t = k(LCM of 4 and 3) + 1 > t = 12k + 1 > t = 1, 13, 25, 37, 49 ..... Multiple Answers, Hence Insufficient Choice E Hope that helps!
_________________
"Arise, Awake and Stop not till the goal is reached"



Manager
Joined: 05 Oct 2014
Posts: 54
Location: India
Concentration: General Management, Strategy
GPA: 3.8
WE: Project Management (Energy and Utilities)

Re: What is the remainder when positive integer t is divided by
[#permalink]
Show Tags
21 Oct 2017, 07:10
Narenn & @Bunnel, can you please check whether I am right ?? It is asked, t=5p+q what is the value of q? (1) says, t=4a+1, we don’t know value of a, INSUFFICIENT. (2) says, t=3b+1, we don’t know value of b, INSUFFICIENT. (1) + (2) , we get 4a+1=3b+1 , here a & b has unknown value. So we can’t really decide what is the reminder. Answer E.




Re: What is the remainder when positive integer t is divided by &nbs
[#permalink]
21 Oct 2017, 07:10






