|
|
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.
10 Jan 2017, 03:51
Kudos
Bookmarks
B
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
45%
(medium)
Question Stats:
62% (01:36) correct
38%
(01:42)
wrong
based on 182
sessions
History
Date
Time
Result
Not Attempted Yet
What is the remainder when integer n is divided by two?
(1) When n is divided by 3, the remainder is odd.
(2) When n is divided by 4, the remainder is odd.
(1) When n is divided by 3, the remainder is odd.
(2) When n is divided by 4, the remainder is odd.
Pure algebraic questions like this one are no longer part of the GMAT Data Sufficiency syllabus.
For relevant Data Sufficiency questions, please check the Data Sufficiency forum:
Data Sufficiency Forum
Data Sufficiency Forum
10 Jan 2017, 05:55
Kudos
Bookmarks
Bunuel
(1) 3 has only one odd remainder - 1. Our number N=3x + 1 will be even or odd depending on x (1, 4, 7, 10 ...). Insufficient.
(2). 4 has two odd remainders 1 and 3. N=4x + 1 or N=4x + 3. In both cases independently of x our N will always be odd. Sufficient.
Answer B.
11 Jan 2017, 07:47
Kudos
Bookmarks
Bunuel
We need to determine the remainder when integer n is divided by 2. Keep in mind that the only possible remainders when an integer is divided by 2 are 0 and 1.
Statement One Alone:
When n is divided by 3, the remainder is odd.
The information in statement one is not sufficient to answer the question. For example, if n = 7, then the remainder when n is divided by 2 is 1; however, when n = 16, the remainder when n is divided by 2 is 0.
Statement Two Alone:
When n is divided by 4 the remainder is odd.
Because division of n by 4 produces an odd remainder, we know that n is odd. If n is odd, the remainder when n is divided by 2 will always be 1. Statement two alone is sufficient to answer the question.
Answer: B
