# publicKhan/khan-exercises

### Subversion checkout URL

You can clone with HTTPS or Subversion.

Fetching contributors…

Cannot retrieve contributors at this time

file 46 lines (43 sloc) 1.648 kb
 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 ` Least common multiple
randRange( 2, 6 ) randRange( 1, 10 ) randRangeExclude( 1, 10, [ START_A ] ) START_A * C START_B * C Math.max( A, B ) Math.min( A, B ) A * B getGCD( A, B ) PRODUCT / GCD getMultiples( BIGGER, LCM )

What is the least common multiple of A and B?

Another way to say this is:

\lcm(A, B) = {?}

LCM

The least common multiple is the smallest number that is a multiple of A and B.

We know that A x B (or PRODUCT) is a common multiple, but is it the least common multiple?

Write out the multiples of BIGGER until we find a number divisible by SMALLER.

M,

So, LCM is the least common multiple of A and B.

`
Something went wrong with that request. Please try again.