|
|
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.
08 Jun 2023, 01:30
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
85%
(hard)
Question Stats:
51% (02:22) correct
49%
(02:11)
wrong
based on 118
sessions
History
Date
Time
Result
Not Attempted Yet
If m and n are positive integers where m>n, and if z is and odd prime number, is m divisible by z?
(1) (m + n)^2 is divisible by z
(2) (m - n)^2 is divisible by z
(1) (m + n)^2 is divisible by z
(2) (m - n)^2 is divisible by z
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
11 Jul 2023, 01:08
Kudos
Bookmarks
Hi Bunuel,
could you elaborate the reason why answer C is correct? I arrived at the point where neither statement A nor statement B alone is sufficient to answer the question and went for answer E…
Posted from my mobile device
could you elaborate the reason why answer C is correct? I arrived at the point where neither statement A nor statement B alone is sufficient to answer the question and went for answer E…
Posted from my mobile device
11 Jul 2023, 01:47
Kudos
Bookmarks
Laila12618
If m and n are positive integers where m>n, and if z is and odd prime number, is m divisible by z?
(1) (m + n)^2 is divisible by z
Since m and n are integers, then if (m + n)^2 is divisible by z, it implies that m + n is divisible by z. How else would z appear in (m + n)^2 if it's not present as a factor in m + n? However, m + n being divisible by z does not necessarily mean that m is divisible by z. Not sufficient.
(2) (m - n)^2 is divisible by z
Similarly, we can deduce that m - n is divisible by z. However, this again is insufficient to determine whether m is divisible by z.
(1)+(2) From the above, we know that m + n = (a multiple of z) and m - n = (a multiple of z). If we sum these two equations, we get 2m = (a multiple of z). Given that z is an odd prime, then for 2m to be a multiple of z, z itself must be a multiple of z. Sufficient.
Answer: C.
Hope it helps.
