Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
firas92
Current Student
Joined: 16 Jan 2019
Last visit: 02 Dec 2024
Posts: 616
Given Kudos: 142
Location: India
Concentration: General Management
Schools: Tepper '23 (M$) Foster '23 (D)
GMAT 1: 740 Q50 V40
WE:Sales (Other)
Products:
01 Jul 2019, 12:20
Kudos
Bookmarks
B
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
95%
(hard)
Question Stats:
29% (02:43) correct
71%
(02:58)
wrong
based on 157
sessions
History
Date
Time
Result
Not Attempted Yet
Three positive integers a, b and c leave the same remainder y when divided by x, where x is a prime number greater than 3 and y is an integer greater than 1. What is the remainder when x is divided by y?
(1) c + 3 when divided by x yields an integer
(2) a + x - 2 when divided by x yields an integer
(1) c + 3 when divided by x yields an integer
(2) a + x - 2 when divided by x yields an integer
WiziusCareers1
Joined: 27 Apr 2009
Last visit: 24 Apr 2026
Posts: 178
Own Kudos:
Given Kudos: 35
Status:Not Applying
Location: India
Schools: HBS '14 (A)
GMAT 1: 730 Q51 V36
01 Jul 2019, 18:46
Kudos
Bookmarks
Three positive integers a, b and c leave the same remainder y when divided by x, where x is a prime number greater than 3 and y is an integer greater than 1. What is the remainder when x is divided by y?
(1) c + 3 when divided by x yields an integer
(2) a + x - 2 when divided by x yields an integer
Pre-thinking on the question
x is an odd prime number
y is anything greater than 1.
Nothing much can be said from this information.
Considering Statement (1) alone:
Let c = 18, x = 7 => y = 4
So, when x is divided by y, the remainder is 3.
Let c = 12, x = 5 => y = 2
So, when x is divided by y, the remainder is 1.
INSUFFICIENT
Considering statement (2) alone:
Let a = 12, x = 5 => y = 2
So, when x is divided by y, the remainder is 1.
Let a = 5, x = 3 => y = 2
So, when x is divided by y, the remainder is 1.
Let a = 16, x = 7 => y = 2
So, when x is divided by y, the remainder is 1.
Clearly, the statement means that each of a, b, and c are 2 more than a multiple of x.
SUFFICIENT.
The answer is (B).
(1) c + 3 when divided by x yields an integer
(2) a + x - 2 when divided by x yields an integer
Pre-thinking on the question
x is an odd prime number
y is anything greater than 1.
Nothing much can be said from this information.
Considering Statement (1) alone:
Let c = 18, x = 7 => y = 4
So, when x is divided by y, the remainder is 3.
Let c = 12, x = 5 => y = 2
So, when x is divided by y, the remainder is 1.
INSUFFICIENT
Considering statement (2) alone:
Let a = 12, x = 5 => y = 2
So, when x is divided by y, the remainder is 1.
Let a = 5, x = 3 => y = 2
So, when x is divided by y, the remainder is 1.
Let a = 16, x = 7 => y = 2
So, when x is divided by y, the remainder is 1.
Clearly, the statement means that each of a, b, and c are 2 more than a multiple of x.
SUFFICIENT.
The answer is (B).
02 Jul 2019, 02:11
Kudos
Bookmarks
a=y mod x
b= y mod x
c= y mod x
x>y and x>3
Statement 1
c+3=0 mod x
(y+3) mod x= 0 mod x
y=-3 or x-3
x=3 mod y when y>3
x= 1 mod y when y<3
insufficient
Statement 2
a + x - 2= 0 mod x
a-2= 0 mod x
(y-2) mod x= 0 mod x
y=2
As x is an odd number, x=1 mod 2
Sufficient
b= y mod x
c= y mod x
x>y and x>3
Statement 1
c+3=0 mod x
(y+3) mod x= 0 mod x
y=-3 or x-3
x=3 mod y when y>3
x= 1 mod y when y<3
insufficient
Statement 2
a + x - 2= 0 mod x
a-2= 0 mod x
(y-2) mod x= 0 mod x
y=2
As x is an odd number, x=1 mod 2
Sufficient
firas92
