Khan/khan-exercises

Subversion checkout URL

You can clone with HTTPS or Subversion.

Fetching contributors…

Cannot retrieve contributors at this time

75 lines (65 sloc) 2.372 kb
 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.