What is the remainder when positive integer t is divided by : GMAT Data Sufficiency (DS)
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 22 Jan 2017, 09:56

### GMAT Club Daily Prep

#### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# What is the remainder when positive integer t is divided by

Author Message
TAGS:

### Hide Tags

Manager
Joined: 25 Jun 2012
Posts: 65
Followers: 0

Kudos [?]: 48 [0], given: 21

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

### Show Tags

13 Nov 2012, 11:48
3
This post was
BOOKMARKED
00:00

Difficulty:

45% (medium)

Question Stats:

66% (02:24) correct 34% (01:20) wrong based on 240 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
[Reveal] Spoiler: OA
Manager
Joined: 19 Nov 2010
Posts: 91
Followers: 6

Kudos [?]: 159 [0], given: 9

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: 91
Followers: 6

Kudos [?]: 159 [2] , given: 9

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

### Show Tags

13 Nov 2012, 12:29
2
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 [?]: 9 [0], given: 1

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: 237
Concentration: Finance, Economics
Followers: 7

Kudos [?]: 286 [0], given: 121

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: 916
Concentration: General Management, General Management
GMAT 1: 630 Q47 V29
GMAT 2: 680 Q50 V32
GPA: 3.7
WE: Information Technology (Investment Banking)
Followers: 23

Kudos [?]: 695 [0], given: 322

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

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

MBA Section Director
Status: On vacation...
Affiliations: GMAT Club
Joined: 21 Feb 2012
Posts: 3947
Location: India
City: Pune
GMAT 1: 680 Q49 V34
GPA: 3.4
Followers: 396

Kudos [?]: 2888 [2] , given: 2161

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

### Show Tags

01 Oct 2013, 10:09
2
KUDOS
Expert's post
1
This post was
BOOKMARKED
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 .....

Choice E

Hope that helps!
_________________
Manager
Joined: 08 Nov 2014
Posts: 94
Location: India
GPA: 3
WE: Engineering (Manufacturing)
Followers: 0

Kudos [?]: 14 [0], given: 90

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

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

Choice E

Hope that helps!

_________________

"Arise, Awake and Stop not till the goal is reached"

Re: What is the remainder when positive integer t is divided by   [#permalink] 20 Jan 2015, 10:32
Similar topics Replies Last post
Similar
Topics:
2 What is the remainder when the positive integer x is divided 2 14 Apr 2010, 06:04
3 What is the remainder when the positive integer n is divided 9 17 Nov 2009, 09:50
29 What is the remainder when the positive integer n is divided 17 10 May 2009, 20:09
14 What is the remainder when the positive integer x is divided 9 07 Oct 2008, 05:25
14 What is the remainder when the positive integer x is divided 12 15 Apr 2007, 04:57
Display posts from previous: Sort by