Unit fraction

A unit fraction is a positive fraction with one as its numerator, 1/n. It is the multiplicative inverse (reciprocal) of the denominator of the fraction, which must be a positive natural number. Examples are 1/1, 1/2, 1/3, 1/4, 1/5, etc. When an object is divided into equal parts, each part is a unit fraction of the whole. Multiplying two unit fractions produces another unit fraction, but other arithmetic operations do not preserve unit fractions. In modular arithmetic, unit fractions can be converted into equivalent whole numbers, allowing modular division to be transformed into multiplication. Every rational number can be represented as a sum of distinct unit fractions; these representations are called Egyptian fractions based on their use in ancient Egyptian mathematics. Many infinite sums of unit fractions are meaningful mathematically. In geometry, unit fractions can be used to characterize the curvature of triangle groups and the tangencies of Ford circles. Unit fractions are commonly used in fair division, and this familiar application is used in mathematics education as an early step toward the understanding of other fractions. Unit fractions are common in probability theory due to the principle of indifference. They also have applications in combinatorial optimization and in analyzing the pattern of frequencies in the hydrogen spectral series. The unit fractions are the rational numbers that can be written in the form where can be any positive natural number. They are thus the multiplicative inverses of the positive integers. When something is divided into equal parts, each part is a fraction of the whole. Multiplying any two unit fractions results in a product that is another unit fraction: However, adding, subtracting, or dividing two unit fractions produces a result that is generally not a unit fraction: As the last of these formulas shows, every fraction can be expressed as a quotient of two unit fractions. In modular arithmetic, any unit fraction can be converted into an equivalent whole number using the extended Euclidean algorithm.