Adding Unlike Fractions
Find the Least Common Denominator (LCM) before adding or subtracting fractions.
Find the Greatest Common Divisor and Least Common Multiple for two or more positive integers. 100% browser-based with explicit formula, worked examples, quick reference table, and FAQs.
Computes the exact GCD using Euclid’s remainder algorithm and derives LCM without overflow via integer division.
LCM(a, b) = |a × b| ÷ GCD(a, b)
Illustrative examples of Greatest Common Divisor and Least Common Multiple.
| Pair (a, b) | GCD(a, b) | LCM(a, b) | Product (a × b) |
|---|---|---|---|
| (12, 18) | 6 | 36 | 216 |
| (8, 12) | 4 | 24 | 96 |
| (15, 25) | 5 | 75 | 375 |
| (24, 36) | 12 | 72 | 864 |
| (14, 21) | 7 | 42 | 294 |
| (16, 24) | 8 | 48 | 384 |
| (18, 24) | 6 | 72 | 432 |
| (20, 30) | 10 | 60 | 600 |
| (21, 28) | 7 | 84 | 588 |
| (25, 40) | 5 | 200 | 1000 |
| (30, 45) | 15 | 90 | 1350 |
| (36, 48) | 12 | 144 | 1728 |
| (42, 56) | 14 | 168 | 2352 |
| (48, 64) | 16 | 192 | 3072 |
| (54, 72) | 18 | 216 | 3888 |
| (60, 84) | 12 | 420 | 5040 |
| (75, 100) | 25 | 300 | 7500 |
| (80, 120) | 40 | 240 | 9600 |
| (90, 135) | 45 | 270 | 12150 |
| (100, 150) | 50 | 300 | 15000 |
Find the Least Common Denominator (LCM) before adding or subtracting fractions.
Determine when two repeating maintenance or shift schedules next align.
Use GCD to find the largest square tile that fits a rectangular room with zero cuts.
Compute principal square root (√x), cube root (∛x), and custom nth roots instantly.
Calculate any base raised to positive, negative, or fractional exponents (aⁿ) with scientific notation.
Solve ax² + bx + c = 0 with discriminant analysis, exact real or complex roots, and parabola vertex.
Factor any integer into prime powers, test primality, and list total divisors instantaneously.
Calculate line slope (m), slope-intercept form (y = mx + b), angle, distance, and midpoint from two points.
Solve for hypotenuse c or missing leg a/b in any right triangle, plus area and perimeter.
Compute exact n!, ordered permutations P(n,r), and unordered combinations C(n,r) using BigInt.