Unit fraction

For fractions of a measurement unit, see Unit prefix.

Slices of approximately 1/8 of a pizza

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.

Arithmetic

The unit fractions are the rational numbers that can be written in the form

$${\displaystyle {\frac {1}{n}},}$$

where ${\displaystyle n}$ can be any positive natural number. They are thus the multiplicative inverses of the positive integers. When something is divided into ${\displaystyle n}$ equal parts, each part is a ${\displaystyle 1/n}$ fraction of the whole. ^[1]

Elementary arithmetic

Multiplying any two unit fractions results in a product that is another unit fraction: ^[2]

$${\displaystyle {\frac {1}{x}}\times {\frac {1}{y}}={\frac {1}{xy}}.}$$

However, adding, ^[3] subtracting, ^[3] or dividing two unit fractions produces a result that is generally not a unit fraction:

$${\displaystyle {\frac {1}{x}}+{\frac {1}{y}}={\frac {x+y}{xy}}}$$

$${\displaystyle {\frac {1}{x}}-{\frac {1}{y}}={\frac {y-x}{xy}}}$$

$${\displaystyle {\frac {1}{x}}\div {\frac {1}{y}}={\frac {y}{x}}.}$$

As the last of these formulas shows, every fraction can be expressed as a quotient of two unit fractions. ^[4]

Modular arithmetic

In modular arithmetic, any unit fraction can be converted into an equivalent whole number using the extended Euclidean algorithm. ^{[5] [6]} This conversion can be used to perform modular division: dividing by a number ${\displaystyle x}$, modulo ${\displaystyle y}$, can be performed by converting the unit fraction ${\displaystyle 1/x}$ into an equivalent whole number modulo ${\displaystyle y}$, and then multiplying by that number. ^[7]

In more detail, suppose that ${\displaystyle x}$ is relatively prime to ${\displaystyle y}$ (otherwise, division by ${\displaystyle x}$ is not defined modulo ${\displaystyle y}$). The extended Euclidean algorithm for the greatest common divisor can be used to find integers ${\displaystyle a}$ and ${\displaystyle b}$ such that Bézout's identity is satisfied:

$${\displaystyle \displaystyle ax+by=\gcd(x,y)=1.}$$

In modulo-${\displaystyle y}$ arithmetic, the term ${\displaystyle by}$ can be eliminated as it is zero modulo ${\displaystyle y}$. This leaves

$${\displaystyle \displaystyle ax\equiv 1{\pmod {y}}.}$$

That is, ${\displaystyle a}$ is the modular inverse of ${\displaystyle x}$, the number that when multiplied by ${\displaystyle x}$ produces one. Equivalently, ^{[5] [6]}

$${\displaystyle a\equiv {\frac {1}{x}}{\pmod {y}}.}$$

Thus division by ${\displaystyle x}$ (modulo ${\displaystyle y}$) can instead be performed by multiplying by the integer ${\displaystyle a}$. ^[7]

Combinations

Several constructions in mathematics involve combining multiple unit fractions together, often by adding them.

Finite sums

See also: List of sums of reciprocals § Finitely many terms

Any positive rational number can be written as the sum of distinct unit fractions, in multiple ways. For example,

${\displaystyle {\frac {4}{5}}={\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{20}}={\frac {1}{3}}+{\frac {1}{5}}+{\frac {1}{6}}+{\frac {1}{10}}.}$

These sums are called Egyptian fractions, because the ancient Egyptian civilisations used them as notation for more general rational numbers. There is still interest today in analyzing the methods used by the ancients to choose among the possible representations for a fractional number, and to calculate with such representations. ^[8] The topic of Egyptian fractions has also seen interest in modern number theory; for instance, the Erdős–Graham conjecture ^[9] and the Erdős–Straus conjecture ^[10] concern sums of unit fractions, as does the definition of Ore's harmonic numbers. ^[11]

A pattern of spherical triangles with reflection symmetry across each triangle edge. Spherical reflection patterns like this with ${\displaystyle 2x}$, ${\displaystyle 2y}$, and ${\displaystyle 2z}$ triangles at each vertex (here, ${\displaystyle x,y,z=2,3,5}$) only exist when ${\displaystyle {\tfrac {1}{x}}+{\tfrac {1}{y}}+{\tfrac {1}{z}}>1}$.

In geometric group theory, triangle groups are classified into Euclidean, spherical, and hyperbolic cases according to whether an associated sum of unit fractions is equal to one, greater than one, or less than one respectively. ^[12]

Infinite series

See also: List of sums of reciprocals § Infinitely many terms

Many well-known infinite series have terms that are unit fractions. These include:

• The harmonic series, the sum of all positive unit fractions. This sum diverges, and its partial sums
  $${\displaystyle {\frac {1}{1}}+{\frac {1}{2}}+{\frac {1}{3}}+\cdots +{\frac {1}{n}}}$$
  closely approximate the natural logarithm of ${\displaystyle n}$ plus the Euler–Mascheroni constant. ^[13] Changing every other addition to a subtraction produces the alternating harmonic series, which sums to the natural logarithm of 2: ^[14]
  $${\displaystyle \sum _{n=1}^{\infty }{\frac {(-1)^{n+1}}{n}}=1-{\frac {1}{2}}+{\frac {1}{3}}-{\frac {1}{4}}+{\frac {1}{5}}-\cdots =\ln 2.}$$
• The Leibniz formula for π is ^[15]
  $${\displaystyle 1-{\frac {1}{3}}+{\frac {1}{5}}-{\frac {1}{7}}+{\frac {1}{9}}-\cdots ={\frac {\pi }{4}}.}$$
• The Basel problem concerns the sum of the square unit fractions: ^[16]
  $${\displaystyle 1+{\frac {1}{4}}+{\frac {1}{9}}+{\frac {1}{16}}+\cdots ={\frac {\pi ^{2}}{6}}.}$$
  Similarly, Apéry's constant is an irrational number, the sum of the cubed unit fractions. ^[17]
• The binary geometric series is ^[18]
  $${\displaystyle 1+{\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+{\frac {1}{16}}+\cdots =2.}$$

Matrices

A Hilbert matrix is a square matrix in which the elements on the ${\displaystyle i}$th antidiagonal all equal the unit fraction ${\displaystyle 1/i}$. That is, it has elements

$${\displaystyle B_{i,j}={\frac {1}{i+j-1}}.}$$

For example, the matrix

$${\displaystyle {\begin{bmatrix}1&{\frac {1}{2}}&{\frac {1}{3}}\\{\frac {1}{2}}&{\frac {1}{3}}&{\frac {1}{4}}\\{\frac {1}{3}}&{\frac {1}{4}}&{\frac {1}{5}}\end{bmatrix}}}$$

is a Hilbert matrix. It has the unusual property that all elements in its inverse matrix are integers. ^[19] Similarly, Richardson (2001) defined a matrix whose elements are unit fractions whose denominators are Fibonacci numbers:

$${\displaystyle C_{i,j}={\frac {1}{F_{i+j-1}}},}$$

where ${\displaystyle F_{i}}$ denotes the ${\displaystyle i}$th Fibonacci number. He calls this matrix the Filbert matrix and it has the same property of having an integer inverse. ^[20]

Adjacency and Ford circles

Fractions with tangent Ford circles differ by a unit fraction

Two fractions ${\displaystyle a/b}$ and ${\displaystyle c/d}$ (in lowest terms) are called adjacent if

$${\displaystyle ad-bc=\pm 1,}$$

which implies that they differ from each other by a unit fraction:

$${\displaystyle \left|{\frac {1}{a}}-{\frac {1}{b}}\right|={\frac {|ad-bc|}{bd}}={\frac {1}{bd}}.}$$

For instance, ${\displaystyle {\tfrac {1}{2}}}$ and ${\displaystyle {\tfrac {3}{5}}}$ are adjacent: ${\displaystyle 1\cdot 5-2\cdot 3=-1}$ and ${\displaystyle {\tfrac {3}{5}}-{\tfrac {1}{2}}={\tfrac {1}{10}}}$. However, some pairs of fractions whose difference is a unit fraction are not adjacent in this sense: for instance, ${\displaystyle {\tfrac {1}{3}}}$ and ${\displaystyle {\tfrac {2}{3}}}$ differ by a unit fraction, but are not adjacent, because for them ${\displaystyle ad-bc=3}$. ^[21]

This terminology comes from the study of Ford circles. These are a system of circles that are tangent to the number line at a given fraction and have the squared denominator of the fraction as their diameter. Fractions ${\displaystyle a/b}$ and ${\displaystyle c/d}$ are adjacent if and only if their Ford circles are tangent circles. ^[21]

Applications

Fair division and mathematics education

In mathematics education, unit fractions are often introduced earlier than other kinds of fractions, because of the ease of explaining them visually as equal parts of a whole. ^{[22] [23]} A common practical use of unit fractions is to divide food equally among a number of people, and exercises in performing this sort of fair division are a standard classroom example in teaching students to work with unit fractions. ^[24]

Probability and statistics

A six-sided die has probability 1/6 of landing on each side

In a uniform distribution on a discrete space, all probabilities are equal unit fractions. Due to the principle of indifference, probabilities of this form arise frequently in statistical calculations. ^[25]

Unequal probabilities related to unit fractions arise in Zipf's law. This states that, for many observed phenomena involving the selection of items from an ordered sequence, the probability that the ${\displaystyle n}$th item is selected is proportional to the unit fraction ${\displaystyle 1/n}$. ^[26]

Combinatorial optimization

In the study of combinatorial optimization problems, bin packing problems involve an input sequence of items with fractional sizes, which must be placed into bins whose capacity (the total size of items placed into each bin) is one. Research into these problems has included the study of restricted bin packing problems where the item sizes are unit fractions. ^{[27] [28]}

One motivation for this is as a test case for more general bin packing methods. Another involves a form of pinwheel scheduling, in which a collection of messages of equal length must each be repeatedly broadcast on a limited number of communication channels, with each message having a maximum delay between the start times of its repeated broadcasts. An item whose delay is ${\displaystyle k}$ times the length of a message must occupy a fraction of at least ${\displaystyle 1/k}$ of the time slots on the channel it is assigned to, so a solution to the scheduling problem can only come from a solution to the unit fraction bin packing problem with the channels as bins and the fractions ${\displaystyle 1/k}$ as item sizes. ^[27]

Even for bin packing problems with arbitrary item sizes, it can be helpful to round each item size up to the next larger unit fraction, and then apply a bin packing algorithm specialized for unit fraction sizes. In particular, the harmonic bin packing method does exactly this, and then packs each bin using items of only a single rounded unit fraction size. ^[28]

Physics

The hydrogen spectral series, on a logarithmic scale. The frequencies of the emission lines are proportional to differences of pairs of unit fractions.

The energy levels of photons that can be absorbed or emitted by a hydrogen atom are, according to the Rydberg formula, proportional to the differences of two unit fractions. An explanation for this phenomenon is provided by the Bohr model, according to which the energy levels of electron orbitals in a hydrogen atom are inversely proportional to square unit fractions, and the energy of a photon is quantized to the difference between two levels. ^[29]

Arthur Eddington argued that the fine-structure constant was a unit fraction. He initially thought it to be 1/136 and later changed his theory to 1/137. This contention has been falsified, given that current estimates of the fine structure constant are (to 6 significant digits) 1/137.036. ^[30]

See also

• 17-animal inheritance puzzle, a puzzle involving fair division into unit fractions
• Submultiple, a number that produces a unit fraction when used as the numerator with a given denominator
• Superparticular ratio, one plus a unit fraction, important in musical harmony

References

1. Cavey, Laurie O.; Kinzel, Margaret T. (February 2014), "From whole numbers to invert and multiply", Teaching Children Mathematics, 20 (6): 374–383, doi:10.5951/teacchilmath.20.6.0374, JSTOR   10.5951/teacchilmath.20.6.0374
2. Solomon, Pearl Gold (2007), The Math We Need to Know and Do in Grades 6 9: Concepts, Skills, Standards, and Assessments, Corwin Press, p. 157, ISBN   978-1-4129-1726-1
3. Betz, William (1957), Algebra for Today, First Year, Ginn, p. 370
4. Humenberger, Hans (Fall 2014), "Egyptian fractions – representations as sums of unit fractions", Mathematics and Computer Education , 48 (3): 268–283, ProQuest   1622317875
5. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990], "31.4 Solving modular linear equations", Introduction to Algorithms (2nd ed.), MIT Press and McGraw-Hill, pp. 869–872, ISBN   0-262-03293-7
6. Goodrich, Michael T.; Tamassia, Roberto (2015), "Section 24.2.2: Modular multiplicative inverses", Algorithm Design and Applications, Wiley, pp. 697–698, ISBN   978-1-118-33591-8
7. Brent, Richard P.; Zimmermann, Paul (2010), "2.5 Modular division and inversion", Modern Computer Arithmetic (PDF), Cambridge Monographs on Applied and Computational Mathematics, vol. 18, Cambridge University Press, pp. 65–68, arXiv: 1004.4710 , doi:10.1017/cbo9780511921698.001, ISBN   978-1-139-49228-7, S2CID   441260
8. Guy, Richard K. (2004), "D11. Egyptian Fractions", Unsolved problems in number theory (3rd ed.), Springer-Verlag, pp. 252–262, ISBN   978-0-387-20860-2
9. Croot, Ernest S. III (2003), "On a coloring conjecture about unit fractions", Annals of Mathematics , 157 (2): 545–556, arXiv: math.NT/0311421 , doi:10.4007/annals.2003.157.545, MR   1973054, S2CID   13514070
10. Elsholtz, Christian; Tao, Terence (2013), "Counting the number of solutions to the Erdős–Straus equation on unit fractions" (PDF), Journal of the Australian Mathematical Society, 94 (1): 50–105, arXiv: 1107.1010 , doi:10.1017/S1446788712000468, MR   3101397, S2CID   17233943
11. Ore, Øystein (1948), "On the averages of the divisors of a number", The American Mathematical Monthly , 55 (10): 615–619, doi:10.2307/2305616, JSTOR   2305616
12. Magnus, Wilhelm (1974), Noneuclidean Tesselations and their Groups, Pure and Applied Mathematics, vol. 61, Academic Press, p. 65, ISBN   978-0-08-087377-0, MR   0352287
13. Boas, R. P. Jr.; Wrench, J. W. Jr. (1971), "Partial sums of the harmonic series", The American Mathematical Monthly , 78 (8): 864–870, doi:10.1080/00029890.1971.11992881, JSTOR   2316476, MR   0289994
14. Freniche, Francisco J. (2010), "On Riemann's rearrangement theorem for the alternating harmonic series" (PDF), The American Mathematical Monthly , 117 (5): 442–448, doi:10.4169/000298910X485969, JSTOR   10.4169/000298910x485969, MR   2663251, S2CID   20575373
15. Roy, Ranjan (1990), "The discovery of the series formula for π by Leibniz, Gregory and Nilakantha" (PDF), Mathematics Magazine , 63 (5): 291–306, doi:10.1080/0025570X.1990.11977541
16. Ayoub, Raymond (1974), "Euler and the zeta function", The American Mathematical Monthly , 81 (10): 1067–86, doi:10.2307/2319041, JSTOR   2319041
17. van der Poorten, Alfred (1979), "A proof that Euler missed ... Apéry's proof of the irrationality of ${\displaystyle \zeta (3)}$" (PDF), The Mathematical Intelligencer , 1 (4): 195–203, doi:10.1007/BF03028234, S2CID   121589323, archived from the original (PDF) on 2011-07-06
18. Euler, Leonhard (September 1983), "From Elements of Algebra", Old Intelligencer, The Mathematical Intelligencer , 5 (3): 75–76, doi:10.1007/bf03026580, S2CID   122191726
19. Choi, Man Duen (1983), "Tricks or treats with the Hilbert matrix", The American Mathematical Monthly , 90 (5): 301–312, doi:10.2307/2975779, JSTOR   2975779, MR   0701570
20. Richardson, Thomas M. (2001), "The Filbert matrix" (PDF), Fibonacci Quarterly , 39 (3): 268–275, arXiv: math.RA/9905079 , Bibcode:1999math......5079R
21. Ford, L. R. (1938), "Fractions", The American Mathematical Monthly , 45 (9): 586–601, doi:10.1080/00029890.1938.11990863, JSTOR   2302799, MR   1524411
22. Polkinghorne, Ada R. (May 1935), "Young-children and fractions", Childhood Education, 11 (8): 354–358, doi:10.1080/00094056.1935.10725374
23. Empson, Susan Baker; Jacobs, Victoria R.; Jessup, Naomi A.; Hewitt, Amy; Pynes, D'Anna; Krause, Gladys (April 2020), "Unit fractions as superheroes for instruction", The Mathematics Teacher, 113 (4): 278–286, doi:10.5951/mtlt.2018.0024, JSTOR   10.5951/mtlt.2018.0024, S2CID   216283105
24. Wilson, P. Holt; Edgington, Cynthia P.; Nguyen, Kenny H.; Pescosolido, Ryan C.; Confrey, Jere (November 2011), "Fractions: how to fair share", Mathematics Teaching in the Middle School, 17 (4): 230–236, doi:10.5951/mathteacmiddscho.17.4.0230, JSTOR   10.5951/mathteacmiddscho.17.4.0230
25. Welsh, Alan H. (1996), Aspects of Statistical Inference, Wiley Series in Probability and Statistics, vol. 246, John Wiley and Sons, p. 66, ISBN   978-0-471-11591-5
26. Saichev, Alexander; Malevergne, Yannick; Sornette, Didier (2009), Theory of Zipf's Law and Beyond, Lecture Notes in Economics and Mathematical Systems, vol. 632, Springer-Verlag, ISBN   978-3-642-02945-5
27. Bar-Noy, Amotz; Ladner, Richard E.; Tamir, Tami (2007), "Windows scheduling as a restricted version of bin packing", ACM Transactions on Algorithms, 3 (3): A28:1–A28:22, doi:10.1145/1273340.1273344, MR   2344019, S2CID   2461059
28. van Stee, Rob (June 2012), "SIGACT news online algorithms column 20: The power of harmony" (PDF), ACM SIGACT News, 43 (2): 127–136, doi:10.1145/2261417.2261440, S2CID   14805804
29. Yang, Fujia; Hamilton, Joseph H. (2009), Modern Atomic and Nuclear Physics, World Scientific, pp. 81–86, ISBN   978-981-283-678-6
30. Kilmister, Clive William (1994), Eddington's Search for a Fundamental Theory: A Key to the Universe, Cambridge University Press, ISBN   978-0-521-37165-0