# Irreducible fraction

{{ safesubst:#invoke:Unsubst||$N=Unreferenced |date=__DATE__ |$B=
{{#invoke:Message box|ambox}}
}}
An **irreducible fraction** (or **fraction in lowest terms** or **reduced fraction**) is a fraction in which the numerator and denominator are integers that have no other common divisors than 1 (and -1, when negative numbers are considered). In other words, a fraction ^{a}⁄_{b} is irreducible if and only if *a* and *b* are coprime, that is, if *a* and *b* have a greatest common divisor of 1. In higher mathematics, "**irreducible fraction**" may also refer to irreducible rational fractions.

An equivalent definition is sometimes useful: if *a*, *b* are integers, then the fraction ^{a}⁄_{b} is irreducible if and only if there is no other equal fraction ^{c}⁄_{d} such that |*c*| < |*a*| or |*d*| < |*b*|, where |*a*| means the absolute value of *a*. (Let us recall that to fractions ^{a}⁄_{b} and ^{c}⁄_{d} are *equal* or *equivalent* if and only if *ad* = *bc*.)

For example, ^{1}⁄_{4}, ^{5}⁄_{6}, and ^{−101}⁄_{100} are all irreducible fractions. On the other hand, ^{2}⁄_{4} is not irreducible since it is equal in value to ^{1}⁄_{2}, and the numerator of the latter (1) is less than the numerator of the former (2).

A fraction that is reducible can be reduced by dividing both the numerator and denominator by a common factor. It can be fully reduced to lowest terms if both are divided by their greatest common divisor. In order to find the greatest common divisor, Euclidean algorithm or prime factorization may be used. Euclidean algorithm is commonly preferred because it allows to reduce fractions with numerators and denominators too large to be easily factored.

## Examples

In the first step both numbers were divided by 10, which is a factor common to both 120 and 90. In the second step, they were divided by 3. The final result, ^{4}/_{3}, is an irreducible fraction because 4 and 3 have no common factors other than 1.

The original fraction could have also been reduced in a single step by using the greatest common divisor of 90 and 120, which would be gcd(90,120)=30.

Which method is faster "by hand" depends on the fraction and the ease with which common factors are spotted. In case a denominator and numerator remain that are too large to ensure they are coprime by inspection, a greatest common divisor computation is needed anyway to ensure the fraction is actually irreducible. 12/14

## Uniqueness

Every rational number has a *unique* representation as an irreducible fraction with a positive denominator (however although both are irreducible). Uniqueness is a consequence of the unique prime factorization of integers, since implies *ad* = *bc* and so both sides of the latter must share the same prime factorization, yet and share no prime factors so the set of prime factors of (with multiplicity) is a subset of those of and vice versa meaning and .

## Generalization

The notion of irreducible fraction generalizes to the field of fractions of any unique factorization domain: any element of such a field can be written as a fraction in which denominator and numerator are coprime, by dividing both by their greatest common divisor. This applies notably to rational expressions over a field. The irreducible fraction for a given element is unique up to multiplication of denominator and numerator by the same invertible element. In the case of the rational numbers this means that any number has two irreducible fractions, related by a change of sign of both numerator and denominator; this ambiguity can be removed by requiring the denominator to be positive. In the case of rational functions the denominator could similarly be required to be a monic polynomial.