Carl Friedrich Gauss1777–1855 · Mathematician“Mathematics is the queen of the sciences, and number theory is the queen of mathematics.”Find the period, and the exponent 2024 loses its terror.
31 ≡ 3, 32 ≡ 9, 33 = 27 ≡ 1 (mod 13).
So 3 has order 3 modulo 13, and the powers cycle 3, 9, 1 forever. Only 2024 modulo 3 matters.
2024 = 3 · 674 + 2, so 2024 ≡ 2 (mod 3), and
32024 = (33)674 · 32 ≡ 1 · 9 = 9 (mod 13).
Fermat guarantees only that 312 ≡ 1; the true order 3 divides 12, as it must. Working with 12 instead of 3 also gives 9 — but with four times the labour.
Archimedes of Syracusec. 287–212 BC · Mathematician & Engineer“Give me a place to stand, and I shall move the Earth.”Three sides and no angle: this is Heron’s ground. Take the semiperimeter first.
s = (5 + 6 + 7)/2 = 9.
Area = √[s(s−a)(s−b)(s−c)] = √(9 · 4 · 3 · 2) = √216.
Simplify: 216 = 36 · 6, so the area is 6√6 ≈ 14.7.
A check by the law of cosines: cos of the angle between 5 and 6 is (25 + 36 − 49)/60 = 1/5, so its sine is √24/5, and the area is ½ · 5 · 6 · √24/5 = 3√24 = 6√6. ✓
Beware the right-triangle instinct: 5-6-7 is not right, since 25 + 36 ≠ 49. Treating it as such gives 15.
Blaise Pascal1623–1662 · Mathematician & Philosopher“Chance is tamed the moment we learn to count the ways.”A sum of logarithms is the logarithm of a product. Write the whole sum as one logarithm and watch the product telescope.
The sum equals log2[(2/1) · (3/2) · (4/3) · … · (64/63)].
Inside the bracket, every numerator cancels the next denominator, leaving only the first denominator and the last numerator:
product = 64/1 = 64.
So the sum is log264 = 6, since 26 = 64.
Equivalently, each term is log2(k+1) − log2k, and the sum telescopes to log264 − log21 = 6 − 0.
There are 63 terms, not 64 — but the count of terms is not the answer. Answering 63 confuses the two.
John Napier1550–1617 · Mathematician“Seeing there is nothing that is so troublesome as the multiplications and divisions.”My logarithms turn multiplication into addition; read the equation backwards and the product reappears.
log2[x(x − 2)] = 3, so x(x − 2) = 23 = 8.
x2 − 2x − 8 = 0, that is (x − 4)(x + 2) = 0, giving x = 4 or x = −2.
Now the step that decides the problem: check the domain. A logarithm demands a positive argument. At x = −2 both log2(x) and log2(x − 2) are undefined. At x = 4 we have log24 + log22 = 2 + 1 = 3. ✓
The answer is 4. Combining logarithms can create solutions the original equation never had; every candidate must be returned to the equation it came from.
Blaise Pascal1623–1662 · Mathematician & Philosopher“Chance is tamed the moment we learn to count the ways.”Lay the ten balls in a row. Nine gaps separate them. Choosing where to cut the row into four nonempty runs means choosing 3 of those 9 gaps — and the boxes, being distinguishable, receive the runs in order.
Number of ways = C(9, 3) = (9 · 8 · 7)/(3 · 2 · 1) = 84.
Equivalently, substitute xi = yi + 1 to absorb the “nonempty” condition; then y1 + … + y4 = 6 with yi ≥ 0, and the stars-and-bars count is C(6 + 3, 3) = C(9, 3) = 84.
Allowing empty boxes would give C(13, 3) = 286 — the distractor. The single word “nonempty” moves the answer by a factor of more than three.
François Viète1540–1603 · Mathematician“There is no problem that cannot be solved.”The roots need never be found. My relations give their sum and product at a glance:
r + s = 3, rs = 1.
The sum of cubes is built from exactly these two:
r3 + s3 = (r+s)3 − 3rs(r+s) = 27 − 3(1)(3) = 18.
The roots themselves are (3 ± √5)/2 — irrational, and utterly unnecessary. That is the point: a symmetric function of the roots is a polynomial in the coefficients.
Answering 27 forgets the term 3rs(r+s).
Gottfried Wilhelm Leibniz1646–1716 · Mathematician & Philosopher“Nothing is more important than to see the sources of invention.”The binomial theorem tells us the general term of (a + b)n is C(n, k) an−kbk.
Here a = 1, b = 2x, n = 6, and we want k = 3:
C(6, 3) · 13 · (2x)3 = 20 · 8x3 = 160x3.
The coefficient is 160.
The whole difficulty is that the 2 travels with the x and is therefore cubed as well. Answering 20 reports C(6,3) alone; answering 40 cubes nothing but doubles once. The coefficient is C(6,3)·23, never C(6,3)·2.
Carl Friedrich Gauss1777–1855 · Mathematician“Mathematics is the queen of the sciences, and number theory is the queen of mathematics.”The last two digits are the residue modulo 100. Find the period.
72 = 49, 73 = 343 ≡ 43, 74 = 7 · 43 = 301 ≡ 1 (mod 100).
So 7 has order 4 modulo 100 and the residues cycle 7, 49, 43, 1.
Since 2024 = 4 · 506, the exponent is a multiple of 4, and
72024 = (74)506 ≡ 1 (mod 100).
The last two digits are 01 — the leading zero matters, since we were asked for two digits.
Euler’s theorem promises only 7φ(100) = 740 ≡ 1; the true order 4 divides 40, as it must, and finding it saves ten-fold work.
John Napier1550–1617 · Mathematician“Seeing there is nothing that is so troublesome as the multiplications and divisions.”A sum of logarithms is the logarithm of a product. Undo the logarithm once and a quadratic remains.
log3[x(x + 6)] = 3, so x(x + 6) = 33 = 27.
x2 + 6x − 27 = 0, that is (x + 9)(x − 3) = 0, giving x = −9 or x = 3.
Now the domain decides. A logarithm demands a positive argument, and x = −9 makes both log3x and log3(x+6) undefined. Only x = 3 survives.
Check: log33 + log39 = 1 + 2 = 3. ✓
Combining logarithms can manufacture solutions the original equation never had. Every candidate must be returned to the equation it came from.
Euclid of Alexandriac. 300 BC · Mathematician“There is no royal road to geometry.”My Elements state it as a proposition about the square on a side; today it is written as the law of cosines. For an angle A between sides b and c:
a2 = b2 + c2 − 2bc cos A.
Here b = 8, c = 7, and cos 60° = 1/2:
BC2 = 64 + 49 − 2(8)(7)(1/2) = 113 − 56 = 57.
So BC = √57 ≈ 7.55 — sensibly between 7 and 8, as the picture demands.
Dropping the cosine term entirely gives √113, which is the answer for a right angle at A. A 60° angle is sharper, so the opposite side must be shorter than the right-angle case — and √57 < √113. Use the estimate to catch sign errors.