If the greatest common factor of two integers, m and n, is

Question

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.

gmat1220 · Answer

s1 insufficient 
Consider m=56*3 and n=56*5
consider m = 56 and n=56*15

s2 sufficient
m=56 and n=56*15

Hence B

Posted from my mobile device

Spidy001 · Answer

1 not sufficient 
 as there more than one possible combination for m and n

m = (2^3)7(3) n = (2^3)7(5)

m = (2^3)7 n = (2^3)7(15)

2. Sufficient

only possible combination for m and n here is m = (2^3)7 n = (2^3)15

Hence answer is B.

subhashghosh · Answer

56 = 2^3 * 7

So m and n have 2^3 * 7 as factor

840 = 7 * 120 = 7 * 5 * 24 = 7 * 5 * 3 * 2^3

(1), m is m is not divisible by 15, so m does not have 5 and 3 as factor

So m = 2^3 * 7 * k (where k is an intger other than 3 or 5)

Now m*n = 56 * 840

So n = 56/56k * 840 = 840/k , which is not sufficient as n could be 840, or 840/56 = 15

(2) n is divisible by 15, so n has 3 and 5 as factor

So n = 3*5* 2^3 * 7*p, where p is an integer
 
 => m = 56*840/15*56p = 56*56/56p, so m can be 56/p, now m has to be minimum 56, so p = 1, hence m = 56 and n = 840
 
 So answer is B

Onell · Answer

Product of M & N= LCM *GCD
==>56*840
==>7^2*2^6*5*3

Stmt 1 m could be 7*2^3*5 or 7*2^3*3..
Stmt 2 
Since GCD is 56 both m and n should have 7 *2^3
n =>7 *2^3 *3*5 (n is divisible by 15 so it should have 3 and 5 as a factor).. Sufficient

B

gmatopoeia · Answer

prime factors of 56: 7, 2, 2, 2
prime factors of 840: 7, 2, 2, 2, 3, 5

From Statement 1 
m = 56*3 or m=56
Insufficient
 
From Statement 2 
m=56; n=840
sufficient

Answer: B

amitbharadwaj7 · Answer

It is given GCF = 56 = 7 x 2 x 2 x 2
and LCM = 840 = 56 (GCF) x 15
For more fundamental elaboration:-
 GCF and LCM
 ----------
7 |m , n
2 |m1, n1
2 |m2, n2
2 |m3, n3
--- 1 , 15
 or
--- 3 , 5
From Statement 1 informs "m" is not divisible by 15, so in above illustration, we can have either 1 or 3 under "m", which makes the statement insufficient to identify the value of m,

From Statement 2 informs "n" is divisible by 15, so in above graphic illustration, we can establish that we will have 1 under "m" and 15 under "n", which is sufficient to derive both the value of n and m

The value of m = 1 x 2 x 2 x 2 x 7 = 56
The value of n = 15 x 2 x 2 x 2 x 7 = 840
m + n = 896

nechets · Answer

For the sake of my comprehension, should m=56*5 be a possibility as well?

ytsejam · Answer

In such questions with a common GCD, I find it convenient to take the numbers as:

m=56*x
n=56*y

Also we know that the LCM is 840:
so we can write

56*x*a=840 => x*a=15
56*y*b=840 => y*b=15

Where a & b are two integers.

We get the four options for the two pairs and solve as has been shown above.

Hope it helps.

OptimusPrepJanielle · Answer

To solve this, first we need to find the prime factors of 56 and 840

prime factors of 56 = 2, 2, 2, 7
prime factors of 840 = 2, 2, 2, 3, 5, 7

Statement 1 
m = 56*3, n = 56*5 or m=56, n = 56*3*5 
Insufficient

Statement 2 
m=56; n=56*3*5
Sufficient

The correct answer choice is B

Aves · Answer

The answer of this question is apparently B but if the statement 2 change to "n is not divisible by 15", will the answer be C?

ytsejam · Answer

Yes in   that   case, combining the two equations will lead to a unique solution i.e. 56*(5+3)=56*8=448 & the answer would be C.

bumpbot · Answer

Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.

If the greatest common factor of two integers, m and n, is

Prep Toolkit

Top 5 GMAT Debrief Videos

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia