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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Re: What is the remainder when positive integer t is divided by [#permalink]

Show Tags

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

Re: What is the remainder when positive integer t is divided by [#permalink]

Show Tags

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

Re: What is the remainder when positive integer t is divided by [#permalink]

Show Tags

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. _________________

Re: What is the remainder when positive integer t is divided by [#permalink]

Show Tags

10 Aug 2013, 02: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). _________________

Rgds, TGC! _____________________________________________________________________ I Assisted You => KUDOS Please _____________________________________________________________________________

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

Re: What is the remainder when positive integer t is divided by [#permalink]

Show Tags

20 Jan 2015, 11:32

In S1 and S2 why you have considered Quotients as q only it can be other variables instead and if we solve S1-S2 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"

gmatclubot

Re: What is the remainder when positive integer t is divided by
[#permalink]
20 Jan 2015, 11:32

Check out this awesome article about Anderson on Poets Quants, http://poetsandquants.com/2015/01/02/uclas-anderson-school-morphs-into-a-friendly-tech-hub/ . Anderson is a great place! Sorry for the lack of updates recently. I...