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

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

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

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.

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
_________________

"The best day of your life is the one on which you decide your life is your own. No apologies or excuses. No one to lean on, rely on, or blame. The gift is yours - it is an amazing journey - and you alone are responsible for the quality of it. This is the day your life really begins." - Bob Moawab

Re: If the greatest common factor of two integers, m and n, is [#permalink]

Show Tags

15 Oct 2013, 17:27

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

Re: If the greatest common factor of two integers, m and n, is [#permalink]

Show Tags

19 Jan 2017, 02:55

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

There’s something in Pacific North West that you cannot find anywhere else. The atmosphere and scenic nature are next to none, with mountains on one side and ocean on...

This month I got selected by Stanford GSB to be included in “Best & Brightest, Class of 2017” by Poets & Quants. Besides feeling honored for being part of...

Joe Navarro is an ex FBI agent who was a founding member of the FBI’s Behavioural Analysis Program. He was a body language expert who he used his ability to successfully...