lcm and gcf

This topic has expert replies
Legendary Member
Posts: 789
Joined: Sun May 06, 2007 1:25 am
Location: Southern California, USA
Thanked: 15 times
Followed by:6 members

lcm and gcf

by resilient » Tue Feb 05, 2008 3:59 pm
I can understand the concept of lcm and gcf by simply drawing out the multipes and seeing where they match.

BUt in the prime factorization way: I get confused on which multiples to eliminate when getting the product of gcf and lcm.

ex. lcm of 18 and 24 - common sense says 72 by looking out at where the mutliples meet. but when seeing harder problems its different you have to look at the prime factors.

18 prime factors are 2,3,3
24 prime factors are 2,2,2,3 and then get the product of the factors. I dont know which factors to eliminate for gcf and lcm. Can someone explain I knew all this but forgot temporarily untill I get your replies.
Appetite for 700 and I scraped my plate!
Source: — Problem Solving |

User avatar
GMAT Instructor
Posts: 3225
Joined: Tue Jan 08, 2008 2:40 pm
Location: Toronto
Thanked: 1710 times
Followed by:614 members
GMAT Score:800

by Stuart@KaplanGMAT » Tue Feb 05, 2008 7:45 pm
The lowest common multiple of two numbers has to contain all of the prime factors that each number contains.

24 = 2 * 2 * 2 *3
18 = 2 * 3 * 3

so, we need 2 * 2 * 2 *3 for 24 to go into the number; we already have a 2 and a 3, so for 18 to go into the number we need one more 3.

Therefore, the LCM of 18 and 24 is 2 * 2 * 2 * 3 * 3 = 72
Image

Stuart Kovinsky | Kaplan GMAT Faculty | Toronto

Kaplan Exclusive: The Official Test Day Experience | Ready to Take a Free Practice Test? | Kaplan/Beat the GMAT Member Discount
BTG100 for $100 off a full course

Legendary Member
Posts: 789
Joined: Sun May 06, 2007 1:25 am
Location: Southern California, USA
Thanked: 15 times
Followed by:6 members

overlap

by resilient » Tue Feb 05, 2008 8:05 pm
so in order to get lcm I will only use the minimal numbers and no overlap? Is that what this boils down to?
Appetite for 700 and I scraped my plate!

User avatar
GMAT Instructor
Posts: 3225
Joined: Tue Jan 08, 2008 2:40 pm
Location: Toronto
Thanked: 1710 times
Followed by:614 members
GMAT Score:800

Re: overlap

by Stuart@KaplanGMAT » Tue Feb 05, 2008 8:13 pm
Enginpasa1 wrote:so in order to get lcm I will only use the minimal numbers and no overlap? Is that what this boils down to?
Correct!
Image

Stuart Kovinsky | Kaplan GMAT Faculty | Toronto

Kaplan Exclusive: The Official Test Day Experience | Ready to Take a Free Practice Test? | Kaplan/Beat the GMAT Member Discount
BTG100 for $100 off a full course

Newbie | Next Rank: 10 Posts
Posts: 2
Joined: Sun Oct 28, 2007 9:06 pm

Re: overlap

by ahsan.saeed » Fri Jan 23, 2009 10:48 pm
Stuart Kovinsky wrote:
Enginpasa1 wrote:so in order to get lcm I will only use the minimal numbers and no overlap? Is that what this boils down to?
Correct!
Hello Stuart,
Can you please solve this question for me, and explain any G.C.F and L.C.M theory behind it? I'm confused about what could be the relationship between the ratio of two numbers and their L.C.M.

I'd really appreciate your response...

Q - The least common multiplier of A and B is 120, the ratio of A and B is 3:4, what is the largest common divisor?

Master | Next Rank: 500 Posts
Posts: 424
Joined: Sun Dec 07, 2008 5:15 pm
Location: Sydney
Thanked: 12 times

Re: overlap

by piyush_nitt » Sat Jan 24, 2009 1:53 am
ahsan.saeed wrote:Q - The least common multiplier of A and B is 120, the ratio of A and B is 3:4, what is the largest common divisor?
I am not sure if there is any shorter way but this is how I solved it.

L.C.M = 120

therefore, numbers has to be less than 120 and such that their ratios is 3:4

120 = 2*2*2*3*5

By hit and trail I found out that numbers are 30 and 40

(LCM of 30 and 40 is 120)

G.C.D of 30,40 = 10

Master | Next Rank: 500 Posts
Posts: 160
Joined: Sat Dec 20, 2008 9:12 pm
Thanked: 11 times

by aroon7 » Sat Jan 24, 2009 7:37 am
Let the numbers be A and B

LCM * GCD = A * B
120 * GCD = 3 (GCD) * 4(GCD)
GCD = 10

is this correct?
--------------------------
i am back!