Rules of Fraction Arithmetic
Fractions represent numerical proportions where the numerator indicates parts taken and the denominator indicates equal divisions of a whole.
(a/b) รท (c/d) = (aยทd) / (bยทc)
The Role of the Least Common Denominator (LCD)
Fractions cannot be directly combined via addition or subtraction without matching denominators. The Least Common Denominator is the lowest common multiple of both denominators.
Simplification via Euclid's GCD Algorithm
A fraction is in its lowest reduced form when its numerator and denominator share no common factors other than 1. Dividing both terms by their Greatest Common Divisor (GCD) reduces the fraction.
๐ Mathematical Case Study: Multi-Term Rational Fraction Arithmetic
Real-World Mathematical ProblemAdd two fractions with differing denominators: 5/12 and 7/18.
The least common multiple of 12 and 18 is 36. Converting both fractions yields 15/36 and 14/36.
Adding numerators yields 29/36. Since 29 is prime, 29/36 is in irreducible lowest terms.
The fraction equals approximately 0.8056 (80.56%). Model proportional ratios with our Ratio Calculator and analyze percentages with our Percentage Calculator.
Algebraic Theory of Rational Numbers & Number Fields
In modern abstract algebra, a rational number is an element of the field of fractions $\mathbb{Q}$ formed over the integral domain of integers $\mathbb{Z}$. Every rational number is represented as an equivalence class of ordered pairs $(a, b)$ with $a, b \in \mathbb{Z}$ and $b \ne 0$, denoted as $\frac{a}{b}$. Two fractions $\frac{a}{b}$ and $\frac{c}{d}$ represent the identical rational element if and only if they satisfy the cross-multiplication equivalence relation:
Euclidean Algorithm & Irreducible Canonical Form
To reduce any rational fraction $\frac{a}{b}$ to its irreducible canonical representation ($\gcd(a', b') = 1$), the numerator and denominator are divided by their Greatest Common Divisor (GCD), determined via the Euclidean division algorithm:
The Least Common Multiple (LCM) of two denominators, vital for fraction addition and subtraction, is derived via the fundamental identity:
Continued Fraction Approximations of Real Numbers
Beyond rational arithmetic, continued fractions provide optimal rational approximations for irrational constants ($\pi, e, \sqrt{2}$). Any real number $x$ can be decomposed into an infinite continued fraction $[a_0; a_1, a_2, \dots]$:
For Archimedes' circle constant $\pi \approx 3.14159265$, the first successive continued fraction convergents yield $\frac{3}{1}, \frac{22}{7} \approx 3.142857$, and the famous Chinese Tsu Ch'ung-chih rational approximation $\frac{355}{113} \approx 3.14159292$, accurate to six decimal places!
| Operation | Formal Algebraic Definition | Computational Example | Irreducible Canonical Result |
|---|---|---|---|
| Addition ($+$) | $\frac{a}{b} + \frac{c}{d} = \frac{ad + bc}{bd}$ | $\frac{3}{8} + \frac{5}{12} = \frac{36 + 40}{96} = \frac{76}{96}$ | $\frac{19}{24}$ |
| Subtraction ($-$) | $\frac{a}{b} - \frac{c}{d} = \frac{ad - bc}{bd}$ | $\frac{7}{10} - \frac{4}{15} = \frac{105 - 40}{150} = \frac{65}{150}$ | $\frac{13}{30}$ |
| Multiplication ($\times$) | $\frac{a}{b} \times \frac{c}{d} = \frac{a \cdot c}{b \cdot d}$ | $\frac{4}{9} \times \frac{15}{16} = \frac{60}{144}$ | $\frac{5}{12}$ |
| Division ($\div$) | $\frac{a}{b} \div \frac{c}{d} = \frac{a}{b} \times \frac{d}{c} = \frac{ad}{bc}$ | $\frac{5}{6} \div \frac{10}{21} = \frac{5 \times 21}{6 \times 10} = \frac{105}{60}$ | $\frac{7}{4} = 1\frac{3}{4}$ |
Fractional Exponents, Radical Expressions & Modular Congruence
Rational fractions extend seamlessly into exponentiation and continuous mathematical analysis through the definition of rational exponents. For any non-negative real base $b$ and irreducible fraction $\frac{m}{n} \in \mathbb{Q}$, power operations map into principal $n$-th radicals:
In discrete mathematics, number theory, and modern cryptography (RSA encryption), fractional modular arithmetic evaluates division modulo a prime integer $p$. While integer division $\frac{a}{b} \pmod p$ is non-trivial, it is resolved uniquely by calculating the modular multiplicative inverse $b^{-1} \pmod p$ via the Extended Euclidean Algorithm, such that $b \cdot b^{-1} \equiv 1 \pmod p$, establishing that $\frac{a}{b} \equiv a \cdot b^{-1} \pmod p$.