An irreducible fraction (or fraction in lowest terms) is a vulgar fraction in which the numerator and denominator are smaller than those in any other equivalent fraction. In arithmetic, a vulgar fraction (or common fraction) consists of one integer divided by a nonzero integer. ...
In algebra, a vulgar fraction consists of one integer divided by a nonzero integer. ...
In algebra, a vulgar fraction consists of one integer divided by a nonzero integer. ...
Stating it more formally, a fraction ^{a}⁄_{b} is irreducible if there is no other equivalent fraction ^{c}⁄_{d} with c having an absolute value less than the absolute value of a (where a, b, c, and d are all integers). In mathematics, the absolute value (or modulus[1]) of a real number is its numerical value without regard to its sign. ...
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). It can be shown that a fraction ^{a}⁄_{b} is irreducible if, and only if, a and b are coprime (relatively prime), that is, if a and b have a greatest common divisor of 1. Coprime  Wikipedia /**/ @import /skins1. ...
In mathematics, the greatest common divisor (gcd), sometimes known as the greatest common factor (gcf) or highest common factor (hcf), of two nonzero integers, is the largest positive integer that divides both numbers without remainder. ...
A fraction that is not irreducible can be reduced by using the Euclidean algorithm to find the greatest common divisor of the numerator and the denominator, and then dividing both the numerator and the denominator by it. In number theory, the Euclidean algorithm (also called Euclids algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). ...
