publicKhan/khan-exercises

Subversion checkout URL

You can clone with HTTPS or Subversion.

Fetching contributors…

Cannot retrieve contributors at this time

file 74 lines (65 sloc) 2.372 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 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74  Simplifying fractions
randRange( 3, 15 ) randRange(2, 10) * FACTOR randRange(2, 10) * FACTOR getGCD( NUM, DENOM ) getPrimeFactorization( GCD ) (function(){ var factorValue = 1; var factorDisplay = ""; var hint = "\\dfrac{" + NUM + "}{" + DENOM + "}"; jQuery.each( GCD_FACTORS, function( index, value) { factorValue *= value; var dot = index == 0 ? "" : "\\cdot "; factorDisplay += dot + value; hint += "= \\dfrac{" + factorDisplay + "\\cdot" + NUM / factorValue + "}{" + factorDisplay + "\\cdot" + DENOM / factorValue + "}"; }); hint += "= \\dfrac{" + NUM / GCD + "}{" + DENOM / GCD + "}"; return hint; })()

Simplify to lowest terms.

\dfrac{NUM}{DENOM}

NUM / DENOM

There are several ways to tackle this problem.

What is the GCD of NUM and DENOM?

GCD(NUM, DENOM) = GCD

\dfrac{NUM}{DENOM}

= \dfrac{NUM / GCD \cdot GCD}{ DENOM / GCD\cdot GCD}

= \dfrac{NUM / GCD}{DENOM / GCD} \cdot \dfrac{GCD}{GCD}

= \dfrac{NUM / GCD}{DENOM / GCD}

You can also solve this problem by repeatedly breaking the numerator and denominator into common factors.

For example:

HINT

Something went wrong with that request. Please try again.