The process of cancelling a fraction is that of finding a common factor of the numerator and denominator and dividing each by that factor. Continuing until the only common factor is 1 is said to have reduced the fraction to its lowest terms.

This can be done in a single step by dividing by the Highest Common Factor (HCF), which can be found by the Euclidean algorithm.

See also:
AddingComplexNumbers
CommonMultiple
Euclid
EuclideanAlgorithm
LeastCommonMultiple
MultiplyingComplexNumbers
ReducingFractionsToLowestTerms
WhatIsThisAbout 		(none) AddingRationalNumbers
MathematicsTaxonomy
↓
↓
↓
↓
CommonFactor
HighestCommonFactor 		AddingFractions
Admin_ProjectFrontEnd
EquivalentFractions
↓
⇌

You are here

CancellingFractions
↓
Denominator
EuclideanAlgorithm
Numerator
ReducingFractionsToLowestTerms
↓
↓
↓
↓
CommonMultiple
ComplexNumber
Integer
LeastCommonMultiple 		Divisor ContinuedFraction
Euclid
ModuloArithmetic
PrimeNumber
RationalNumber
SquareRoot

Local neighbourhood - D3

Last change to this page
Full Page history
Links to this page
 Edit this page
  (with sufficient authority)
Change password
 Recent changes
All pages
Search