Series

Modular arithmetic — the series

6 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. Arithmetic on a dial of 12. A dial with 12 positions. Starting at 8 and stepping forward 9 places lands on 5, because the walk passes the top 1 time on the way.

    Numbers that wrap

    A clock does arithmetic. It has finitely many numbers, addition never leaves it, and multiplication behaves entirely differently depending on one property of the size of the dial.

    part 1 · discrete
  2. One number, two dials: 3 and 5. A grid of remainder pairs, each cell holding the smallest number that leaves those two remainders.

    Two dials at once

    Watch one number on two clocks with different faces. If the faces share no factor, every pair of readings occurs exactly once — so two remainders name a number, and a hard calculation can be split into two easy ones.

    part 2 · number
  3. Every residue joined to 2 times itself, on a dial of 199. A circle with 199 equally spaced points and a chord from each point k to the point 2k mod 199, with the 1-cusped curve the chords envelope drawn dashed.

    Multiplying every number on the dial at once

    Join every residue on a dial to twice itself and the chords draw a heart-shaped curve with one cusp; join each to three times itself and the curve has two. The picture is the whole multiplication map at once, and it holds three facts: the map splits the dial into cycles whose lengths are orders, those cycles on a dial of 2ⁿ − 1 are the binary necklaces of length n, and the curve is the caustic light draws inside a cup.

    part 3 · discrete
  4. Square roots of 2, lifted from one power of 7 to the next. A tree whose rows are the square roots of 2 modulo 7 to the powers 1 to 4, each joined to the root it reduces to; counts 2, 2, 2, 2.

    A root lifted one digit at a time

    On a dial of seven, 3 × 3 is 2. On a dial of forty-nine the square root of 2 must reduce to 3, so there are only seven candidates, and exactly one of them works: 10. On a dial of 343 exactly one lift of 10 works: 108. Each step adds one digit on the left, found by solving a linear equation, and the digits go on for ever — a number …21216213 whose square is 2, in a world where closeness means divisibility by seven.

    part 4 · discrete
  5. Powers of 5 and 6 until the digits settle. five-adic tail 0896109004106619977392256259918212890625; six tail 9103890995893380022607743740081787109376; settled after 8: 10, 9.

    A number that is its own square

    Square 625 and the answer, 390625, ends in 625. Square 9376 and it ends in 9376. Keep extending them and two endless strings of digits appear, running leftward, each equal to its own square — and their product is nought, though neither is. Base ten does this because ten is two times five: a number in base ten is secretly a pair of numbers, one in base two and one in base five, and these two strings are the pair (one, nought) and (nought, one). In a prime base no such thing can happen.

    part 5 · discrete
  6. A circle with a count running round it. Josephus circle, n=41, k=3: removal order 3,6,9,12,15,18,21,24,27,30,33,36,39,1,5,10,14,19,23,28,32,37,41,7,13,20,26,34,40,8,17,29,38,11,25,2,22,4,35,16,31.

    The last place in the circle

    Forty-one people stand in a circle and every third is removed. Which place is safe? Counting round by hand is not necessary: the survivor is a running sum on a dial that grows by one each step. With every second person it is n's binary digits rotated by one place, which is a tidier fact than anybody asked for. With every third the rule depends on repeatedly multiplying by three halves and rounding up, and the constant it reaches, 1.62227…, has no known closed form.

    part 6 · discrete

All series