LCM = {(2*2*2)*7}
GCF = {(2*2*2) *7} * 3 *5
Theres an (3*5) in the LCM, which could belong to either of the numbers together or one each.
(1) m not divisible by 15, but still could contain either a 3 or a 5. Cant say
(2) n is divisible by 15, so it contains both 3 and 5. So the numbers are 56 and 840. Sufficient
B IMO
GCF LCM
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
-
shankar.ashwin
- Legendary Member
- Posts: 966
- Joined: Sat Jan 02, 2010 8:06 am
- Thanked: 230 times
- Followed by:21 members
-
vaibhavgupta
- Master | Next Rank: 500 Posts
- Posts: 416
- Joined: Tue Aug 30, 2011 2:18 pm
- Location: Delhi, India
- Thanked: 13 times
- Followed by:9 members
IMO EGmatKiss wrote:If the greatest common factor of two integers, m and n, is 56 and the least common multiple is 840, what is the sum of the m and n?
(1) m is not divisible by 15.
(2) n is divisible by 15.
whts OA?
-
user123321
- Master | Next Rank: 500 Posts
- Posts: 385
- Joined: Fri Sep 23, 2011 9:02 pm
- Thanked: 62 times
- Followed by:6 members
should be B.
since for 1)
m=56*3,n=56*5
m=56*1,n=56*15
m=56*5,n=56*3 are all possibilities which give different m+n each time.
for B)
m=56*15,n=56*1
is the only possibility
user123321
since for 1)
m=56*3,n=56*5
m=56*1,n=56*15
m=56*5,n=56*3 are all possibilities which give different m+n each time.
for B)
m=56*15,n=56*1
is the only possibility
user123321
Just started my preparation 
Want to do it right the first time.
Want to do it right the first time.
-
GMATGuruNY
- GMAT Instructor
- Posts: 15539
- Joined: Tue May 25, 2010 12:04 pm
- Location: New York, NY
- Thanked: 13060 times
- Followed by:1906 members
- GMAT Score:790
LCM = (all the prime factors that M and N have IN COMMON) * (all the prime factors that M and N DON'T have in common).GmatKiss wrote:If the greatest common factor of two integers, m and n, is 56 and the least common multiple is 840, what is the sum of the m and n?
(1) m is not divisible by 15.
(2) n is divisible by 15.
GCF = the product of all the prime factors that M and N have IN COMMON:
56 = 2³ * 7.
Since 840 = 2³ * 3 * 5 * 7, the prime factors that M and N DON'T have in common are 3 and 5.
Thus, 3 must be a factor of M or N (but not both) and 5 must be a factor of M or N (but not both).
To determine M+N, we need to know which of the two (M or N) is a multiple of 3 and which is a multiple of 5.
Statement 1: M is not divisible by 15.
Thus, the following are possible:
M is a multiple of 3 and N is a multiple of 5.
M is a multiple of 5 and N is a multiple of 3.
N is a multiple of both 3 and 5 and M is a multiple of neither.
INSUFFICIENT.
Statement 2: N is divisible by 15.
Thus, N is a multiple of both 3 and 5.
M is a multiple of neither.
SUFFICIENT.
The correct answer is B.
Statement 2 indicates the following:
N = (all the prime factors that M and N have in common) * (all the prime factors belonging only to N) = 2³ * 7 * 3 * 5 = 840.
M = (all the prime factors that M and N have in common) = 2³ * 7 = 56.
M+N = 840+56 = 896.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
