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.
Nov 2007:30 AM PST
-08:30 AM PST
Learn what truly sets the UC Riverside MBA apart and how it helps in your professional growth
Nov 2001:30 PM EST
-02:30 PM IST
Learn how Kamakshi achieved a GMAT 675 with an impressive 96th %ile in Data Insights. Discover the unique methods and exam strategies that helped her excel in DI along with other sections for a balanced and high score.
Nov 2206:30 AM PST
-08:30 AM PST
Let’s dive deep into advanced CR to ace GMAT Focus! Join this webinar to unlock the secrets to conquering Boldface and Paradox questions with expert insights and strategies. Elevate your skills and boost your GMAT Verbal Score now!
Nov 2211:00 AM IST
-01:00 PM IST
Do RC/MSR passages scare you? e-GMAT is conducting a masterclass to help you learn – Learn effective reading strategies Tackle difficult RC & MSR with confidence Excel in timed test environment- Nov 23
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Nov 2407:00 PM PST
-08:00 PM PST
Full-length FE mock with insightful analytics, weakness diagnosis, and video explanations!
Nov 2510:00 AM EST
-11:00 AM EST
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors.
27 Dec 2016, 09:05
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
65%
(hard)
Question Stats:
53% (01:49) correct
47%
(01:57)
wrong
based on 173
sessions
History
Date
Time
Result
Not Attempted Yet
If x and y are nonzero integers, what is the remainder when odd integer y is divided by x?
(1) The product of x and any other integer will be divisible by 2.
(2) There is only one pair of positive integers whose product will be equal to x.
(1) The product of x and any other integer will be divisible by 2.
(2) There is only one pair of positive integers whose product will be equal to x.
27 Dec 2016, 11:28
Kudos
Bookmarks
According to Statement 1,x should be an even number.Only then the product of x and any other integer would be divisible by 2.
But both x and y can be either positive or negative.
When both are either positive or negative,then the remainder would be 1.[Eg: -3/-2 => 1 remainder]
Otherwise,[Eg : -11/4 => Remainder 1 but -11/8 => Remainder 5]
Statement 1 alone isn't sufficient.
Statement 2 implies that x is a prime number.Then again, we can have innumerable possibilities for x and y.
Hence 2 alone too is insufficient.
Taken together, Statement 1 and 2 mean that x is greater than 0, even and prime.
And y can be either a positive or negative.In all such cases, the remainder when divided by +2 will always be 1.
Hence Statement 1 and 2 taken together are sufficient.
Ans Choice C, according to me, is the correct answer.
But both x and y can be either positive or negative.
When both are either positive or negative,then the remainder would be 1.[Eg: -3/-2 => 1 remainder]
Otherwise,[Eg : -11/4 => Remainder 1 but -11/8 => Remainder 5]
Statement 1 alone isn't sufficient.
Statement 2 implies that x is a prime number.Then again, we can have innumerable possibilities for x and y.
Hence 2 alone too is insufficient.
Taken together, Statement 1 and 2 mean that x is greater than 0, even and prime.
And y can be either a positive or negative.In all such cases, the remainder when divided by +2 will always be 1.
Hence Statement 1 and 2 taken together are sufficient.
Ans Choice C, according to me, is the correct answer.
07 Jan 2017, 06:15
Kudos
Bookmarks
st 1 says x is an even number as it is divisible by 2 and other number could be any non negative integer. -- not sufficient
st2 says there is only one pair of positive integer whose product is equal to x. this can be (1,2), (1,3) or any prime number pair--- not sufficient
combining two, we can conclude that (1,2) is the required pair and x is equl to 2. and remainder of any odd number divided by 2 is 1.
Hence option C
st2 says there is only one pair of positive integer whose product is equal to x. this can be (1,2), (1,3) or any prime number pair--- not sufficient
combining two, we can conclude that (1,2) is the required pair and x is equl to 2. and remainder of any odd number divided by 2 is 1.
Hence option C
