|
|
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.
19 Sep 2024, 09:14
Kudos
Bookmarks
Classic divisibility problem. Complete the square so that it makes sense, and then solve for n:
arushi118
Joined: 21 Jul 2024
Last visit: 09 May 2026
Posts: 266
Own Kudos:
Given Kudos: 894
Location: India
Concentration: Leadership, General Management
Schools: INSEAD Aug '26 LBS '26 Kellogg '26
GPA: 8.2/10
Products:
21 Feb 2026, 01:44
Kudos
Bookmarks
72 = (3^2)*(2^3)
So largest integer that divides n is a way of asking that what is the value of n.
We can see that n should contain atleast one 3 and two 2s. So, n = 3*4 = 12
Ans: B
(n can be 24 as well as 12 etc) -> We have to find the largest number that "MUST" divide n - so if we choose 24 as an answer but 12 is the actual value of n, then 24 will not be able to divide n. Hence ans = 12.
So largest integer that divides n is a way of asking that what is the value of n.
We can see that n should contain atleast one 3 and two 2s. So, n = 3*4 = 12
Ans: B
(n can be 24 as well as 12 etc) -> We have to find the largest number that "MUST" divide n - so if we choose 24 as an answer but 12 is the actual value of n, then 24 will not be able to divide n. Hence ans = 12.
23 Feb 2026, 13:11
Kudos
Bookmarks
