Studies in Countingt 0 c 33:30
Series
A research series in mechanical graphics, 2026.
Thirteen figures, one grid, one clock.
Index
Thirteen studies in order,
with the number of elements each plate draws.

(i:)About the project Thirteen drawings that move by arithmetic. Each study puts one figure on a grid of 12 px and hands it to a clock: once per second a rule is applied and the drawing jumps to its next state, with no easing and nothing animated for its own sake. Every position can be derived from the number on the clock, and every rule is printed beside the plate it moves, with its live values.

Explore studies

01Orbits(18)

Study 01 of 13: Orbits
Twenty four stations, one rule each

Eighteen rings in six rows of three. Every ring has twenty four stations, fifteen degrees apart, the even ones on an outer orbit and the odd ones on an inner one. A bead either stands on a station or does not, so each ring is a word of twenty four bits, and each second every ring rewrites its word by its own rule.

The first five rings only open and turn: a gap that walks round the ring one station a second, an inner orbit that swings fifteen degrees back and forth, an eclipse whose window grows by one bead on each side per second along a triangle wave, an alternation in which every bead changes orbit every second, and a gate that opens at top and bottom at once. The rest compute: Fourier modes with one to twelve lobes, two doors and four gates on the same triangle wave, two windows that travel against each other and meet every twenty four seconds, two combs that make a moiré, Bjorklund's even distribution of n beads over twenty four stations, Thue–Morse, the numbers coprime to n, the quadratic residues modulo seven primes, two openings breathing at 12 and 8 seconds, the Josephus elimination that leaves station 16, a scattered walk of mirrored pairs and the doubling map modulo 25, which lights twenty stations because 2 is a primitive root.

Almost every rule depends only on the distance of a station from the top, so station k and station 24 − k always agree and the rings are symmetric, with two deliberate exceptions, Josephus and doubling, which run round the ring in one direction. Beneath each row a line prints the rule and its current value.

rings
18
stations
24 of 15°
orbits
2, inner and outer
step
one per second
shortest period
2 s
longest period
26 s
Plate 01OrbitsSVG
1 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 2 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 3 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 4 001 002 003 004 005 006 007 008 009 010 011 012 5 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 6 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 7 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 8 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 9 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 10 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 11 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 12 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 13 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 14 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 15 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 16 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 17 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 18 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024
1
Gap, missing bead = t mod 24. 24 beads on 24 stations, the even ones on the outer orbit, the odd ones on the inner. One bead is missing and the absence moves one station, 15°, per second. Period 24 s.  
2
Breath, inner offset = 15° × (t mod 2). Only the inner orbit moves: 15° forward, 15° back. Its beads stand alternately between the outer ones and on the same radii. Period 2 s.  
3
Eclipse, hidden where |θ − 180°| < 15° × n, n = 6 − |6 − (t mod 12)|. n is a triangle wave from 0 to 6. The opening at the bottom grows by one bead on each side per second, to 13 beads at n = 6, and closes again. Period 12 s.  
4
Alternate, r = outer if k + t is even, else inner. Twelve beads, each switching orbit every second, neighbours always on opposite orbits. The ring folds into a twelve pointed star and back. Period 2 s.  
5
Gate, hidden where |θ| or |θ − 180°| < 15° × n. The dense ring opens at top and bottom at once, two mirrored gates widening to 165° and closing again. Period 12 s.  
6
Harmonic, visible where cos(h·θ) ≥ 0, h = 1 + (t mod 12). Twelve Fourier modes in turn. Mode h leaves h lobes of beads separated by h gaps, from a half ring to a twelve fold flower. Period 12 s.  
7
Doors, hidden where |θ ∓ 90°| < 15° × n. The gate turned a quarter: two mirrored doors open at 3 and 9 o'clock until only a top and a bottom arc remain. Period 12 s.  
8
Quarters, hidden where θ is within 15° × n of 0°, 90°, 180°, 270°. Four gates at once. At n = 3 only four beads at the diagonals survive, a square standing on its corner. Period 6 s.  
9
Beats, hidden where |θ ∓ 15°·t| ≤ 15°. Two gaps of three beads leave the top in opposite directions, cross at the bottom after 12 s and meet again at the top. Period 24 s.  
10
Sieves, hidden where (k ± t) mod s = 0, s = 24, 12, 8, 6. Two combs turning against each other. Where their teeth coincide the ring shows a moiré of gaps. s gets finer every six seconds.  
11
Euclid, n beads spread as evenly as 24 stations allow, n = 2 × (12 − |12 − (t mod 24)|). Bjorklund's even distribution. The count rises by two per second; each step redistributes every bead so the gaps differ by at most one station.  
12
Thue–Morse, visible where the binary digits of m + t sum to an even number. The Thue–Morse sequence, the fairest way to share turns, slides one place per second around both halves of the ring.  
13
Coprime, visible where gcd(m, n) = 1, n = 2 + (t mod 23). The numbers 1 to 12 that share no factor with n. Prime n leaves almost the whole ring, n = 12 or 24 only a few beads. Period 23 s.  
14
Residue, visible where m is a square mod p, p = 5, 7, 11, 13, 17, 19, 23. Quadratic residues for seven primes in turn, three seconds each. Half of the classes are squares, so each figure holds about half the ring.  
15
Cascade, hidden near 180° by 15° × (6 − |6 − t mod 12|), near 0° by 15° × (4 − |4 − t mod 8|). Eclipse and gate at two rates. The bottom opening breathes every 12 s, the top one every 8 s, and the ring only repeats after 24 s.  
16
Josephus, every second bead still standing is removed, clockwise. The Josephus problem for 24. One bead goes per second until the survivor is the one at station J(24) = 16. Period 26 s.  
17
Scatter, pair m = (7t + 3) mod 13 toggles. A deterministic walk through the thirteen mirrored positions. Pairs appear and vanish in an order that looks random and repeats every 26 s.  
18
Doubling, station 2ⁱ mod 25 lights, i < t. The doubling map. Station 2ᵗ mod 25 lights and stays, so the ring fills in the order 1, 2, 4, 8, 16, 7, 14 … 2 is a primitive root mod 25, so 20 of the 24 stations light before the cycle closes. Period 22 s.  

Study 01: Notes on the arithmetic

Itwenty four stations Every ring has 24 stations, 15° apart, numbered from the top. The even stations lie on the outer orbit and the odd ones on the inner, so a full ring is 24 beads and every figure is a subset of those 24: a word of 24 bits that changes once a second.1 Most rules depend only on m, the distance of a station from the top, 0 to 12. Station k and station 24 − k always agree, so the figures are symmetric left to right, and the plate is really a set of words of 13 bits.

IIopenings Gap moves a single absence round the ring, one station per second. Breath and Alternate swap between two states every second. Eclipse, Gate, Doors and Quarters open one, two, two and four windows that widen by one bead each side per second along a triangle wave n = 6 − |6 − (t mod 12)| and close again; Cascade runs two such windows at 12 s and 8 s, so it repeats only after 24 s.2 Beats moves two windows of three beads in opposite directions at 15° per second: they cross at the bottom after 12 s and meet at the top after 24 s.

  1. 124 stations = 2 × 12
  1. 2n = 6 − |6 − (t mod 12)|

IIIarithmetic on the ring Harmonic keeps the stations where cos(h·θ) ≥ 0 for h = 1 … 12, so it shows h lobes. Sieves sets two combs of period s turning against each other; where their teeth coincide the ring shows a moiré. Euclid spreads n beads over 24 stations as evenly as possible, the gaps never differing by more than one. Thue–Morse lights m + t where its binary digits have an even sum.3 Coprime keeps the m that share no factor with n, Residue the m that are squares modulo a prime p, and in both about half the ring survives. Josephus removes every second bead still standing until only station J(24) = 16 is left. Scatter toggles the pair (7t + 3) mod 13, a walk through all thirteen positions. Doubling lights 2ⁱ mod 25, and since 2 is a primitive root modulo 25 it reaches 20 stations before it closes.

IVperiods The rings repeat after 2, 6, 12, 21, 22, 23, 24 and 26 seconds; Thue–Morse never repeats, because its sequence is not periodic. Two of them, Josephus and Doubling, run round the ring in one direction and break the mirror symmetry on purpose.4 Under every row a line prints each rule with its current value, so any ring can be checked against its formula.

  1. 3J(24) = 2 · (24 − 16) + 1 = 17
  1. 42 has order 20 mod 25
02Chords(9)

Study 02 of 13: Chords
The times table drawn on a circle

Nine circles. Round each one n points are placed evenly and numbered from the top, and from every point k a straight chord goes to another point f(k) given by a rule. No curve is ever drawn; where many chords crowd together their envelope appears, a curve that none of them is.

The top row multiplies: k goes to k × m modulo n. For m = 2 the envelope is a cardioid, for 3 a nephroid, and for every multiplier m an epicycloid with m − 1 cusps. Cusps keeps 48 points and steps m from 2 to 11, one per second, so the cusps multiply. Resolution keeps m = 2 and adds six points per second, 6 to 72: the rule stays the same, only its sampling gets finer. Multipliers runs every multiplier from 0 to 59 on sixty points: m = 0 sends every chord to one point, m = 1 joins every point to itself and draws nothing, and m = 59 = −1 mirrors the circle onto itself.

The middle row adds. In Stars k goes to k + m on 24 points, the star polygon {24/m}, which falls apart into gcd(m, 24) separate polygons whenever m shares a factor with 24. Complete adds a point per second and joins every pair, the complete graph Kₙ with n(n − 1) / 2 chords, so the count climbs along the triangular numbers to 276. Distances adds one chord length per second until all C(36, 2) = 630 chords of 36 points are drawn.

The third row reflects. k goes to c − k, and every chord of such a family is parallel to every other. Since the points are equally spaced in angle, not in height, the parallels crowd towards the rim, as cos does near its maximum. In Globe two families at right angles make a sphere seen from the front, denser every second. In Tunnel two chord lengths on 96 points each touch their own inner circle of radius R · cos(πs / 96); as s grows one circle closes and the other opens. Mesh lays 1, 2, 3 and up to 12 families over each other, through the divisors of 72, until 432 chords form a mesh.

circles
9
rules
k·m, k + m, all pairs, all d ≤ D, k → c − k
points
6 to 96
most chords
630
shortest period
10 s
longest period
60 s
Plate 02ChordsSVG
148 · 226 · 2360 · 0424 / 153, 3 chords636, d ≤ 1740, 2 axes896, s 20 / 28972, 3 axes
1
Cusps, n = 48, m = 2 + (t mod 10). The multiplier steps from 2 to 11. Cardioid, nephroid, then curves with 3, 4, … 10 cusps.  
2
Resolution, m = 2, n = 6 + 6 (t mod 12). The cardioid at growing resolution: 6, 12, 18 … 72 points. The curve is the same, only the envelope sharpens.  
3
Multipliers, n = 60, m = t mod 60. Every multiplier once. m = 0 sends all chords to one point, m = 1 draws nothing, m = 59 mirrors m = 1. Period 60 s.  
4
Stars, n = 24, k → k + m, m = 1 + (t mod 11). The star polygon {24 / m}. When gcd(m, 24) > 1 it falls apart into gcd(m, 24) smaller polygons, printed at the centre.  
5
Complete, n = 3 + (t mod 22), every pair joined. The complete graph Kₙ, n(n − 1) / 2 chords: 3, 6, 10, 15 … 276 at n = 24. One point per second.  
6
Distances, n = 36, all chords of length d ≤ D, D = 1 + (t mod 18). Each second adds the next chord length. At D = 18 every pair of the 36 points is joined, 630 chords.  
7
Globe, n = 8 + 4 (t mod 15), k → −k and k → n / 2 − k. Two families of parallels, one horizontal and one vertical. The points are equally spaced in angle, so the lines crowd towards the rim and the disc reads as a sphere seen from the front.  
8
Tunnel, n = 96, k → k + s and k → k + 48 − s, s = 1 + (t mod 23). All chords of one length touch an inner circle of radius R · cos(πs / 96). Two lengths give two such circles; as s grows one closes and the other opens, and the band between them reads as depth.  
9
Mesh, n = 72, f families k → c − k, c = j · 72 / f. f families of parallels at f directions spaced 180° / f, always symmetric about the vertical. f runs through the divisors 1, 2, 3, 4, 6, 8, 9, 12 of 72; at 12 there are 432 chords.  

Study 02: Notes on the arithmetic

Ithe rule n points are equally spaced on a circle and numbered 0 to n − 1 from the top. Point k is joined by a straight chord to point k·m mod n. No curve is ever drawn; where many chords crowd together their envelope appears, a curve that no single chord contains.1 Every figure is a list of pairs (k, f(k)) computed fresh each second, so the plate is nine functions on finite circles.

IIcusps The envelope of the chords for multiplier m is an epicycloid with m − 1 cusps. For 2 it is the cardioid, for 3 the nephroid. Cusps steps through these once per second, so the number of cusps rises by one each time.2 Every figure is symmetric about the vertical axis through point 0, because k and −k are sent to m·k and −m·k.

  1. 1chord k → k·m mod n
  1. 2epicycloid with m − 1 cusps

IIIresolution Resolution keeps m = 2 and adds six points per second. With six points the figure is a few lines; with seventy two the cardioid is unmistakable. The curve does not change, only how much of it the eye can reconstruct.3 Cusps and Resolution together separate the two things that make the picture: the rule and its sampling.

IVadding instead of multiplying Stars joins k to k + m. On 24 points this is the star polygon {24 / m}: a 24-gon for m = 1, a star for m = 5, 7 or 11, and for m with a common factor with 24 a compound of several polygons, as many as the gcd. Complete adds a point a second and joins every pair, so the chord count climbs along the triangular numbers. Distances adds one chord length per second until all 630 chords of 36 points are drawn.4 Each centre prints its parameters, so any chord can be checked by counting points. Globe, Tunnel and Mesh join k to c − k: all chords of one family are parallel, and because the points are equally spaced in angle the parallels crowd towards the rim, so two families at right angles read as a sphere, two chord lengths as a tunnel, and twelve families as a mesh of 432 chords.

  1. 3n = 6, 12, … 72
  1. 4{24 / m}, Kₙ, 36 · 18 = 630
03Capsules(23)

Study 03 of 13: Capsules
One clock, twenty three functions

Twenty three capsules, one variable. Every capsule computes a function of t, the seconds since the page opened, and shows the result. Nothing else enters: no randomness, no memory beyond t itself. Each second t grows by one, every capsule takes one step of its rule and holds, so the whole plate is a table of twenty three functions evaluated at the same number.

The first row moves quantities: a remainder t mod 3 that walks, a belt of five places, a column that loses six units a second, two lengths that close on each other in four equal steps, and a triangle wave that fills and empties a glass. After the gap, the number ten is cut in two parts that always add up, then into all thirty six ways of three. The second row reads the clock: a needle and a ring driven by the same triangle wave, the time written backwards, a jump of seven that visits all ten places because 7 and 10 are coprime, and two discs stepping three and four that meet only every ten seconds. The third row counts and adds: a soroban digit, the sum of two remainders, the squares as sums of odd numbers, then a row of Pascal's triangle and Zeckendorf's unique sums. The fourth row divides and iterates: Euclid's algorithm by subtraction, prime factors, then procedures that always settle, Kaprekar's 6174, happy numbers that reach 1 and Newton's square root, which doubles its correct digits at every step.

Every capsule prints the value it is showing, so each drawing can be checked as arithmetic.

capsules
23
variable
t, seconds
clock
c = 33:30 + t
step
one per second
shortest period
3 s
longest period
144 s
Plate 03CapsulesSVG
1 33:30 33:39 2 33:30 33:39 3 33:30 33:39 4 8U 46U 5 6 7 8 8U 9 33:30 33:31 33:32 33:33 33:34 33:35 33:36 33:37 33:38 33:39 10 33:30 33:29 33:28 33:27 33:26 33:25 33:24 33:23 33:22 33:21 11 12 13 14 15 16 17 18 19 20 21 22 23
1
Pulse, a = t mod 3
Three dots; dot a is enlarged. a runs 0, 1, 2, 0, … so the large dot moves down one place per second and jumps back to the top. Period 3 s.
 
2
Conveyor, y(k) = 23 + 6 × ((k + t) mod 5)
Five dots on a belt of five places. Every second each dot moves one place down; the one that leaves at the bottom comes back in at the top. Period 5 s.
 
3
Drain, h = 50 − 6 × (t mod 8)
A column loses 6 units of height every second, seven times, then refills in one step. The reading is h, from 50 down to 8. Period 8 s.
 
4
Pincer, h = 8 + 23 / 4 × (t mod 5)
Two lengths grow towards each other from the two ends, a quarter of the free length per second. At step 4 they meet. The top reading is h, the bottom one the gap 62 − 2h, which shrinks twice as fast. Period 5 s.
 
5
Hourglass, n = 5 − |5 − (t mod 10)|
Five discs pass a waist. Disc j is below it when j ≥ 5 − n. n is a triangle wave: it climbs 0 to 5 in five seconds and falls back in five, so the glass fills and empties. Period 10 s.
 
6
Split, a + b = 10
One length of ten stations cut in two. The cut moves down one station per second, so a grows by one and b shrinks by one; their sum never changes.
 
7
Three, p + q + r = 10, p, q, r ≥ 1
The compositions of 10 into three positive parts. There are C(9, 2) = 36 of them; one per second, in order, each part printing its length. Period 36 s.
 
8
Ruler, r = 9 − |9 − (t mod 18)|
A needle on a scale of ten. r is a triangle wave: it reads 0, 1, … 9 going down and 9, 8, … 0 coming back. Period 18 s.
 
9
Picker, ring = 9 − |9 − (t mod 18)|
The same function as the Ruler, read on a column of times. The ring always stands on the Ruler's row, so the two capsules show one value two ways. Hover picks a time, a click books it.
 
10
Ledger, row k = c − k
The clock written backwards: row 0 is the current second c, each row below is one second earlier. Every second the whole column shifts down by one and a new time enters at the top.
 
11
Beads, head = (7t + 2) mod 10
The head jumps seven places at a time on ten rings. Because gcd(7, 10) = 1 it lands on every ring exactly once before it repeats: 2, 9, 6, 3, 0, 7, 4, 1, 8, 5. Period 10 s.
 
12
Orbit, station = t mod 10
Two discs go round a closed track of ten stations, always five stations apart, so they stand at opposite points of the loop at every moment. Period 10 s.
 
13
LCM, stations 3t mod 10 and 4t mod 10
Two discs on the same ten stations, one stepping three, one four. They differ by t mod 10, so they meet only when t is a multiple of 10. The centre counts the meetings.
 
14
Abacus, d = t mod 10
A soroban rod. The upper bead is worth five and each lower bead one, so the digit d is ⌊d / 5⌋ upper and d mod 5 lower beads. Period 10 s.
 
15
Adder, a = t mod 5, b = (3t + 1) mod 5
Two lengths in steps of one station, a from the top, b from the bottom. The gap between them prints a + b. Because 3 and 5 are coprime, b runs through every value as well. Period 5 s.
 
16
Squares, n² = 1 + 3 + 5 + … + (2n − 1)
The odd numbers stacked into a pyramid. Every new bar is two longer than the last, and the total is always a perfect square: 1, 4, 9, 16, 25.
 
17
Pascal, row k = C(n, k), n = t mod 10
Row n of Pascal's triangle written down the capsule. Each entry is the sum of the two above it in the row before, and the row adds up to 2ⁿ. Period 10 s.
 
18
Zeckendorf, v = sum of non consecutive Fibonacci numbers, v = t mod 144
Zeckendorf's theorem: every number has exactly one way of being written as a sum of Fibonacci numbers with no two neighbours. The plate writes 0 to 143 that way, one per second. Period 144 s.
 
19
Euclid, (a, b) → (a − b, b) while a ≠ b
Euclid's algorithm by subtraction. Every second the larger number loses the smaller. When the two are equal, that value is the greatest common divisor.
 
20
Factor, n = 2 + (t mod 98)
n written as a product of primes, smallest at the bottom, one factor per disc. A prime is a single disc; 64 = 2⁶ needs six. Period 98 s.
 
21
Kaprekar, n → desc(n) − asc(n)
Kaprekar's routine on four digits: sort the digits high to low, subtract them sorted low to high. Every seed whose digits are not all equal reaches 6174 in at most seven steps, and 7641 − 1467 = 6174 keeps it there.
 
22
Happy, n → sum of the squares of the digits
Repeat and watch where it ends. Happy numbers reach 1 and stay; every other number falls into the same loop of eight, 4, 16, 37, 58, 89, 145, 42, 20.
 
23
Newton, x → (x + S / x) / 2
The Babylonian square root of S = 2, 3, 5, 7, 10. Each step averages a guess with S divided by it; the error is squared every step, so the number of correct digits roughly doubles.
 

Study 03: Notes on the arithmetic

Ione integer Every capsule is a function of t and of nothing else. Two readers who open the page in the same second see the same plate, and anyone can predict any capsule at any second with pencil and paper.1 The clock c = 33:30 + t is the same number written as minutes and seconds. The Ledger prints c, c − 1, c − 2 down the column, so it reads the clock backwards.

IIfour kinds of function Remainders, t mod n, run forward and jump back: the Pulse, the Belt, the Drain, the Abacus. Triangle waves, n − |n − (t mod 2n)|, run forward and then back again without a jump: the Ruler, the Picker and the Hourglass.2 Products modulo ten step by a fixed amount: 7t + 2 in Beads, 3t and 4t in LCM. Recursions take the previous value and transform it: Euclid subtracts, Kaprekar sorts and subtracts, Newton averages.

  1. 1c = 33:30 + t
  1. 2r = 9 − |9 − (t mod 18)|

IIIperiods Each capsule repeats after its own period: 3 s for the Pulse, 5 for the Belt, the Pincer and the Adder, 8 for the Drain, 10 for the Hourglass, Beads, the Orbit, LCM, the Abacus and Pascal, 18 for the Ruler and the Picker. Together these return to their opening state only after lcm(3, 5, 8, 10, 18) = 360 seconds.3 The sequences run longer: 36 compositions of ten, 98 numbers to factor and 144 Zeckendorf sums.

IVsmall proofs Beads jumps by seven on ten rings and hits every ring once in ten seconds, because gcd(7, 10) = 1. In LCM the two discs differ by t mod 10, so they meet exactly when t is a multiple of ten.4 Squares is an identity drawn as a stack: 1 + 3 + … + (2n − 1) = n². Kaprekar reaches 6174 in at most seven steps from any four digits that are not all equal, and Newton squares its error at every step.

  1. 3lcm(3, 5, 8, 10, 18) = 360
  1. 4gcd(7, 10) = 1
04Places(78)

Study 04 of 13: Places
One number grows into six bases

One number, written six times. Each row is a place value system with thirteen places: base 2 at the top, then 3, 4, 8, 10 and 16. The rightmost place counts units, the next one b, then b², and so on up to b¹². An empty place carries only its index, 12 on the left to 0 on the right, so before anything is written the plate shows pure capacity: seventy eight places that could hold a number up to b¹³ − 1. Each index turns with its disc: a place holding the digit d stands d / b of a turn clockwise from the bottom, so a binary one carries its index to the top and a hexadecimal place moves 22.5° per unit. The indices wake one per second, from the top right place leftwards and row by row, so after seventy eight seconds every index is turning.

The number grows by the Fibonacci rule: every second the new value is the sum of the two before it, 1, 1, 2, 3, 5, 8, 13, 21 … Each step multiplies it by about φ ≈ 1.618, so its length grows at a constant rate, but the rate depends on the base: a new place opens every 1 / log_b φ steps. Binary needs a new digit every 1.44 steps and is full at n = 19, when F(19) = 4181 passes 2¹². Ternary fills at n = 30, quaternary at 37 and octal at 54, the last term. Decimal and hexadecimal never fill. A full row keeps F(n) mod b¹³, the last thirteen digits of a number that no longer fits.

At n = 54, F(54) = 86 267 571 272: eleven decimal places and ten hexadecimal ones, so five places of the plate are never written. Six seconds later the cycle starts again from a single 1, so one cycle is a minute. A place that changes is marked for a quarter of a second, which makes the carries visible: early on only the units change, near the end an addition rewrites almost every place at once.

bases
2, 3, 4, 8, 10, 16
places
13 per base, 78 in all
rule
F(n+1) = F(n) + F(n−1)
growth
× φ per step
last value
F(54)
period
60 s
Plate 04PlacesSVG
1 12 2 11 3 10 4 9 5 8 6 7 7 6 8 5 9 4 10 3 11 2 12 1 13 0 14 12 15 11 16 10 17 9 18 8 19 7 20 6 21 5 22 4 23 3 24 2 25 1 26 0 27 12 28 11 29 10 30 9 31 8 32 7 33 6 34 5 35 4 36 3 37 2 38 1 39 0 40 12 41 11 42 10 43 9 44 8 45 7 46 6 47 5 48 4 49 3 50 2 51 1 52 0 53 12 54 11 55 10 56 9 57 8 58 7 59 6 60 5 61 4 62 3 63 2 64 1 65 0 66 12 67 11 68 10 69 9 70 8 71 7 72 6 73 5 74 4 75 3 76 2 77 1 78 0
1
Base 2, F(n) in binary. Gains a place every 1.44 steps, since F(n) grows by φ and log₂ φ ≈ 0.69. Full at n = 19, then it keeps F(n) mod 2¹³. The units place runs 0, 1, 1 with period 3: F(n) is even exactly when 3 divides n.  
2
Base 3, F(n) in ternary. A place every 2.28 steps. Full at n = 30, when F(30) = 832 040 passes 3¹². The units place repeats every 8 steps, 0 1 1 2 0 2 2 1, the Pisano period of 3.  
3
Base 4, F(n) in quaternary. A place every 2.88 steps, two binary places in one. Full at n = 37. The units place repeats every 6 steps, 0 1 1 2 3 1, so its zero comes back every sixth term.  
4
Base 8, F(n) in octal. A place every 4.32 steps, three binary places in one. Full at n = 54, the last term, when F(54) passes 8¹². The units place repeats every 12 steps.  
5
Base 10, F(n) in decimal. A place every 4.78 steps. At n = 54 it holds eleven places; two never fill. The last digit repeats every 60 steps, the same minute the plate runs on.  
6
Base 16, F(n) in hexadecimal, digits 0 to F. A place every 5.76 steps, four binary places in one. At n = 54 it holds ten places; three never fill. The units place repeats every 24 steps.  

Study 04: Notes on the arithmetic

Icapacity before content With thirteen places, base b can hold every number from 0 to b¹³ − 1. Binary stops at 8191, decimal at 9 999 999 999 999, hexadecimal at about 4.5 quadrillion. At n = 0 nothing is written and every place shows only its index, the power of b it would count.1 The six rows are six answers to one question: how much room the same quantity needs in a given base.

IIgrowth by addition From n = 1 the plate writes F(n), one term per second. Since F(n) ≈ φⁿ / √5, the number of digits in base b grows like n · log_b φ, a straight line whose slope is the logarithm.2 So a new place opens every 1 / log_b φ steps: 1.44 in base 2, 2.28 in base 3, 2.88 in base 4, 4.32 in base 8, 4.78 in base 10 and 5.76 in base 16. Base 4 runs exactly half as fast as base 2, because one quaternary digit is two binary digits, and base 8 a third as fast.

  1. 1largest value b¹³ − 1
  1. 2F(n) ≈ φⁿ / √5

IIIrows that fill Binary is full at n = 19, ternary at n = 30, quaternary at 37 and octal at 54: these are the first n with F(n) ≥ b¹². From then on a row shows F(n) mod b¹³, the last thirteen digits, and they keep changing although the number no longer fits.3 The marked places show the carries. Adding two small numbers changes only the last digits; adding two large ones rewrites almost every place, so late in the cycle whole rows change in a single second.

IVthe cycle At n = 54, F(54) = 86 267 571 272: eleven decimal digits and ten hexadecimal ones, so two places of base 10 and three of base 16 are never written. The plate holds for six seconds and starts again from 1, so one cycle lasts 60 seconds.4 Under the plate each row is also printed as a string, so every place can be checked against its digit.

  1. 3F(19) ≥ 2¹², F(37) ≥ 4¹², F(54) ≥ 8¹²
  1. 4F(54) = 86 267 571 272
05Punch(13)

Study 05 of 13: Punch
Seeds, growth, a closing surface

Thirteen rows of 216 cells each. A row starts empty. One second into the cycle a seed appears at cell 108, the middle of the middle row. Three seconds later two more appear at 54 and 162, the middles of the two halves, then four at the middles of the quarters, then eight, then sixteen. Each new level halves the gaps that remain, so after five levels 1 + 2 + 4 + 8 + 16 = 31 seeds divide the row into 32 equal parts.

Every seed grows three cells to each side per second. A seed of level L starts at second 3L, so the old pieces are long and the new ones short, and halfway through a row reads like a ruler with marks of five lengths. When two pieces touch they merge into one. The smallest gaps close first and the oldest last, and about fifteen seconds after its first seed the row is a single piece of 216 cells. The numerals print the length of every piece and every gap, and they always add up to 216.

Row k runs the same programme |k − 6| seconds after the middle row, so the filling spreads across the plate from the centre in a diamond, one row per second, and about twenty one seconds in every row is full. Then the programme runs again on the full rows: the same seeds, in the same order, cut the pieces back apart, the middle row first, until at forty eight seconds every row is empty and the cycle begins again.

rows
13
cells
216 per row
seeds
1 + 2 + 4 + 8 + 16 = 31
growth
3 cells each side per second
delay
|k − 6| s per row
period
48 s, fill then empty
Plate 05PunchSVG
1 2 3 4 5 6 7 8 9 10 11 12 13
1
Seeds by halving, x = (2j + 1) · 216 / 2ᴸ⁺¹. Level L adds 2ᴸ seeds midway between the old ones, one level every 3 s: 1, 2, 4, 8, 16, in all 31, cutting the row into 32 equal parts.  
2
Growth, r = 3 · (τ − 3L) cells to each side. Every seed grows three cells left and three right per second. Two bars that touch become one; a row of 31 pieces becomes a single piece.  
3
Front, τ = t − |k − 6|. Row k runs the same programme |k − 6| seconds after the middle row, so the filling spreads from the centre in a diamond. At 24 s the programme runs again in reverse. Period 48 s.  

Study 05: Notes on the arithmetic

Iseeds by halving A row is 216 cells long. The first seed stands at 108, the middle. Three seconds later two more stand at 54 and 162, the middles of the two halves; then four at 27, 81, 135 and 189; then eight; then sixteen. Level L adds 2ᴸ seeds at (2j + 1) · 216 / 2ᴸ⁺¹, so after five levels 1 + 2 + 4 + 8 + 16 = 31 seeds cut the row into 32 equal parts of 6.75 cells.1 Every new level lands exactly in the middle of the gaps that remain, so the empty length is halved again and again.

IIgrowth and merging A seed of level L starts at second 3L and from then on grows three cells to each side per second: its half width is r = 3 · (τ − 3L). Old pieces are long, new ones short, so in the middle of the cycle a row reads like a ruler with marks of five lengths.2 Two pieces that touch become one. Because every level halves the gaps and every piece grows at the same rate, the gaps close in a fixed order, the smallest first, and about fifteen seconds after its first seed the row is one piece.

  1. 1x = (2j + 1) · 216 / 2ᴸ⁺¹
  1. 2r = 3 · (τ − 3L)

IIIa front from the centre Row k runs the same programme |k − 6| seconds after the middle row, k = 0 … 12. The filling therefore spreads in two directions at once: along each row from its seeds, and across the plate from the middle row outwards, one row per second. The whole plate is full about twenty one seconds into the cycle.3 At 24 s the programme runs again on the full rows: the same seeds in the same order now cut the pieces back, so the empty length spreads from the middle in the same diamond, and at 48 s the plate is back where it began. Every piece at every second follows from three numbers: its level, its row and t.

IVwhat the numbers say The small numerals print the length of every piece and every gap in cells. Read along a row they always add up to 216, so each row is a partition of 216 that changes once a second.4 Early in the cycle the partition has many small parts; when the row is full it has a single part of 216, and in the reverse half the parts split again in the same order.

  1. 3τ = t − |k − 6|
  1. 4pieces + gaps = 216
06Dials(3)

Study 06 of 13: Dials
Three rates, three times tables

Three dials, A, B and C, each a ring of twenty four stations fifteen degrees apart. Once a second every dial turns by a whole number of stations and holds: A by 1, B by −2, C by 3, positive clockwise. After t seconds dial ω has turned m = ωt stations, counted modulo 24. A dial returns home after 24 / gcd(ω, 24) seconds, 24, 12 and 8, so all three stand at the start together only every 24 seconds.

The labels do not turn. The label at place p prints p, a colon and p × m modulo 24, so each ring writes out the times table of its own position. Every second all twenty four products on every dial change at once; the places never do. When m shares no factor with 24 the ring holds every number from 00 to 23 exactly once, shuffled. When gcd(m, 24) = d, only 24 / d different values appear, each d times, and exactly d products read 00, evenly spaced round the ring. When the dial is home every product is 00.

The zeros are set on discs, so the factors of m can be read off the ring at a glance: three zeros mean 3 divides m, eight mean 8 does. The hub carries only the dial's letter; everything the dial computes is written on its ring.

dials
3, A to C
stations
24 of 15°
rates
1, −2, 3
label
p · m mod 24
zeros
gcd(m, 24)
period
24 s
Plate 06DialsSVG
1 00:00 01:00 02:00 03:00 04:00 05:00 06:00 07:00 08:00 09:00 10:00 11:00 12:00 13:00 14:00 15:00 16:00 17:00 18:00 19:00 20:00 21:00 22:00 23:00 A 2 00:00 01:00 02:00 03:00 04:00 05:00 06:00 07:00 08:00 09:00 10:00 11:00 12:00 13:00 14:00 15:00 16:00 17:00 18:00 19:00 20:00 21:00 22:00 23:00 B 3 00:00 01:00 02:00 03:00 04:00 05:00 06:00 07:00 08:00 09:00 10:00 11:00 12:00 13:00 14:00 15:00 16:00 17:00 18:00 19:00 20:00 21:00 22:00 23:00 C
1
Rates, ω = 1, −2, 3 stations per second. One station is 15°. Positive turns clockwise, negative against.  
2
Products, the label at place p prints p : p · m mod 24, m = ωt mod 24. Each dial writes out the times table of its own position m. When m shares no factor with 24 the labels are all 24 numbers shuffled; otherwise only 24 / gcd(m, 24) values appear, repeated round the ring.  
3
Reachable, 24 / gcd(ω, 24) stations. A dial of rate ω only ever brings the multiples of gcd(ω, 24) to the top: all 24 for ω = 1, 12 for −2, 8 for 3.  
4
Clock, the dial's own count, ω·t. Each dial counts the stations it has passed. All three stand at their start together only every lcm of their periods, 24 s.  
5
Zeros, gcd(m, 24) labels end in 00. The dials are lettered A to C. The zeros on a ring are as many as the greatest common divisor of its position and 24, evenly spaced, and every label whose product is 00 sits on a pill.  

Study 06: Notes on the arithmetic

Irates and directions Dial A turns 1 station per second, B −2 and C 3, one station being 15°; positive is clockwise. After t seconds a dial has turned m = ωt stations, and only m mod 24 matters, because 24 stations make a full turn.1 A dial comes home after 24 / gcd(ω, 24) seconds: 24 for A, 12 for B and 8 for C. All three are home together only every lcm(24, 12, 8) = 24 seconds.

IIwhere a dial can stand A dial of rate ω only ever brings the multiples of gcd(ω, 24) to the top. A, with a rate coprime to 24, reaches all 24 positions; B reaches 12, the even ones, and C 8, every third.2 So the three dials show three subgroups of the clock of 24: the whole clock, half of it and a third of it.

  1. 1m = ωt mod 24
  1. 224 / gcd(ω, 24) positions

IIIa times table on every ring The lines turn, the labels stay in their places. The label at place p prints its place, a colon and p · m mod 24, so each ring is the multiplication table of m modulo 24, written round a circle. Every second all 24 labels of every dial change at once.3 If gcd(m, 24) = d, the ring shows only 24 / d different values, each d times, and exactly d products read 00, evenly spaced. When m is 1, 5, 7, 11, 13, 17, 19 or 23 every number from 00 to 23 appears once, shuffled; when m = 12 the ring alternates 00 and 12; when the dial is home every product is 00. The zero products are set on pills, so the divisors of m can be read off the ring.

IVthe zeros Each dial carries only its letter at the centre; everything else is on the ring. The number of labels that read 00 is gcd(m, 24), so a ring with one zero sits at a position coprime to 24 and a ring of zeros is home.4 Read across a row, the counts of zeros are the greatest common divisors gcd(ωt mod 24, 24) of three multiples of the same t.

  1. 3label = p · m mod 24
  1. 4zeros = gcd(m, 24)
07Discs(63)

Study 07 of 13: Discs
Sixty three numbers in six families, turning their bits

The numbers 1 to 63, every number that six binary digits can write, each on its own disc. All of them stand at once, sorted into six families by how many ones they carry: 6 numbers with one 1, 15 with two, 20 with three, 15 with four, 6 with five and 63 alone with six. The family sizes are C(6, k), row six of Pascal's triangle.

Every disc shows its bits round the rim: twelve stations, and a tick at station s when bit min(s, 12 − s) is one, so bit 0 sits at the top and bits 1 to 5 appear twice, mirrored left and right. Once a second every disc rotates its six bits by one place. The ticks move, some stations go dark and others light, and the number in the centre becomes a new number with the same count of ones: 3 = 000011 becomes 6, 12, 24, 48, 33 and then 3 again. No disc ever leaves its family. Numbers whose bits repeat return sooner: 21 = 010101 alternates with 42 every second, and 63 never changes.

In every family one disc is lit, and the light steps to the next disc once a second. The families have 6, 15, 20, 15, 6 and 1 members, so the lights meet in their opening places only every lcm = 60 seconds, and since the rotation has period 6 the whole plate repeats exactly once a minute. When the number a disc holds is prime, a dot stands beneath it; as the bits turn, the primes wander across the plate.

numbers
1 to 63
families
6 + 15 + 20 + 15 + 6 + 1
bits
6, shown at 12 stations
rule
v = rot(n, t mod 6)
light
one per family
period
60 s
Plate 07DiscsSVG
11 22 34 48 516 632 73 85 96 109 1110 1212 1317 1418 1520 1624 1733 1834 1936 2040 2148 227 2311 2413 2514 2619 2721 2822 2925 3026 3128 3235 3337 3438 3541 3642 3744 3849 3950 4052 4156 4215 4323 4427 4529 4630 4739 4843 4945 5046 5151 5253 5354 5457 5558 5660 5731 5847 5955 6059 6161 6262 6363
1
Families, the numbers 1 to 63 grouped by how many ones they have in binary. Six families of 6, 15, 20, 15, 6 and 1 numbers, row six of Pascal's triangle, one empty place between two families.  
2
Ticks, station s marked when bit min(s, 12 − s) of n is set. Twelve stations of 30°. Bit 0 is at the top, bits 1 to 5 appear on both sides, so every disc is mirror symmetric. Every second each disc turns its six bits one place: ticks appear and vanish round the rim and the number changes, but the count of ones, and so the family, stays.  
3
Light, in each family one disc is lit. The light steps to the next disc of its family every second. The families have periods 6, 15, 20, 15, 6 and 1, so the whole plate returns after lcm = 60 s. 63 is alone and always lit.  
4
Centre, the number the disc holds now, a dot beneath when it is prime. As the bits turn, primes come and go: a disc returns to its first number after 6 s, or sooner when its pattern repeats.  

Study 07: Notes on the arithmetic

Ifamilies Six bits give the numbers 1 to 63. Sorted by how many of their bits are one they fall into six families of C(6, k) = 6, 15, 20, 15, 6 and 1, row six of Pascal's triangle without its first 1. The families follow each other in reading order, smallest number first, with one empty place between two families.1 All 63 numbers are on the plate at all times. Nothing arrives and nothing leaves; what changes is which number each disc holds.

IIbits on a dial Each disc has twelve stations, every 30°. Station s carries a tick when bit min(s, 12 − s) of the disc's value is one: bit 0 is the top, bits 1 to 5 appear twice, once on each side, and the bottom station is always empty. So every dial is mirror symmetric and can be read back into its number.2 Once a second every disc rotates its six bits by one place, the top bit carried round to the bottom: v = rot(n, t mod 6). Ticks move, appear and vanish, and the number in the centre changes, but the count of ones stays, so no disc ever leaves its family. Most return to their first number after six seconds; 21 and 42 after two; 9, 18, 27, 36, 45 and 54 after three; 63 never changes.

  1. 1C(6, k) = 6, 15, 20, 15, 6, 1
  1. 2tick at s ⇔ bit min(s, 12 − s) of v

IIIthe light In every family exactly one disc is lit, and each second the light moves to the next disc of its family, wrapping at the end. The six families have periods 6, 15, 20, 15, 6 and 1, so the lights stand in their opening places together only every lcm(6, 15, 20) = 60 seconds. The single disc 63 is its own family and is always lit.3 The bit rotation has period 6, which divides 60, so the whole plate, lights and numbers, repeats exactly once a minute.

IVprimes The centre prints the number the disc holds at this second, with a dot beneath it when that number is prime. There are 18 primes below 64, and since the rotation changes every number, the primes wander: a disc holding 3 = 000011 holds 6, 12, 24, 48 and 33 in the next five seconds, none of them prime.4 The live readings print the lit number of every family in decimal and in binary, and how many primes stand on the plate.

  1. 3lcm(6, 15, 20, 1) = 60
  1. 4v = rot(n, t mod 6)
08Hands(44)

Study 08 of 13: Hands
Forty four clock faces, one hand each

A hand on a dial of n stations holds one number from 0 to n − 1. Forty four of them, in four rows, read the same second four ways: t in base twelve, eleven rates of turning, t in base four, and eleven divisions of the circle from 2 to 12. Together the rows show positional notation, multiplication modulo 12 and the least common multiple at work on one clock.

dials
44, four rows of 11
row 1
t in base 12
row 2
k · t mod 12
row 3
t in base 4
row 4
t mod (k + 1)
longest period
27 720 s
Plate 08HandsSVG
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44
1
Odometer, t in base 12, units on the right. Eleven digits of t in base twelve. The right dial moves every second, the next every 12 s, the next every 144 s, the left one after 12¹⁰ s.  
2
Rates, dial k turns k stations a second, k = 1 … 11. On twelve stations. Dials with k coprime to 12 visit every station; the others only gcd-spaced ones. All hands stand at noon every 12 s.  
3
Quarters, t in base 4. Only four stations, so the hands point up, right, down or left and nothing between: two binary places on each dial.  
4
Divisions, dial k has n = k + 1 stations, hand at t mod n. From a half turn to twelve stations. The ticks show the division. All eleven hands meet at noon only every lcm(2 … 12) = 27 720 s.  

Study 08: Notes on the arithmetic

Ione hand A dial of n stations can hold exactly n values, 0 to n − 1, and a hand has nothing to read but its direction. Eleven dials side by side can therefore hold a number of eleven digits, or eleven separate remainders, depending on how they are tied together.1 The four rows tie them in four ways: as digits of one number, as multiples of one step, as digits again with a smaller base, and as remainders by eleven different moduli.

IIcounters The first and third rows are odometers. The first writes t in base twelve, one digit per dial, units on the right; t = Σ dᵢ · 12ⁱ, so eleven dials can count to 12¹¹ − 1. The third writes t in base four, so each hand only ever points up, right, down or left.2 Reading from the right, the dials turn every second, every twelve, every hundred and forty four; in the quarter row every second, every four, every sixteen. The left dials of both rows will not move in a lifetime.

  1. 1n stations hold 0 … n − 1
  1. 2t = Σ dᵢ · 12ⁱ

IIIrates In the second row dial k turns k stations per second on twelve stations. Dials 1, 5, 7 and 11 are coprime to twelve and visit every station; dial 6 only flips between noon and six; dial 4 draws a triangle and dial 3 a square.3 Whatever the rate, after twelve seconds every hand is back at noon, so the row closes into a straight line of vertical hands once every twelve seconds.

IVdivisions In the fourth row dial k divides its circle into k + 1 stations, from 2 to 12, and the ticks show where. Each hand takes one step a second. Two neighbours share noon every n(n + 1) seconds, and the whole row only at the least common multiple of 2 to 12, 27 720 seconds, seven hours and forty two minutes.4 The readings under the plate print t, the digits of both counters, the hands of the rates and the seconds to the next full meeting.

  1. 3k · 12 ≡ 0 mod 12
  1. 4lcm(2, …, 12) = 27 720
09Rings(20)

Study 09 of 13: Rings
Three, five and twelve rings of numbers in step

Concentric rings of numbers turn round a fixed notch, each ring by its own step and direction. On dials A and B, named after Sunzi and Qin Jiushao who first wrote down the Chinese remainder theorem, the numbers are placed so that whatever stands at the notch adds up to the count: three rings count to 60, five to 4620. Dial C, after Eratosthenes, has twelve rings of 2 to 13 stations, and the zeros that line up at its notch sieve out the divisors of the count.

rings
3 + 5 + 12
moduli
3, 4, 5 · 3, 4, 5, 7, 11 · 2 to 13
sums
n mod 60, n mod 4620
step
one count every 3 s
sieve
zeros at the notch divide n
longest period
360 360 counts
Plate 09RingsSVG
1Sunzi040200153045036124824A 2Qin Jiushao01540308001155231034650184836969242772033001980660396026401320012602520378042016802940420084021003360B 3Eratosthenes010210123043210123450654321012345670876543210123456789010987654321012345678910110121110987654321C
1
A, Sunzi, rings of 3, 4 and 5 turning against each other. The middle ring runs anticlockwise. Each ring carries the multiples of its idempotent e: 40, 45, 36, placed in the order it brings them to the notch, so the three numbers there always add up to n mod 60.  
2
B, Qin Jiushao, rings of 3, 4, 5, 7 and 11 turning 1, −1, 2, −2 and 2 stations a step. Every speed is coprime to its ring, so each ring still visits all its stations, in a shuffled order. Idempotents 1540, 3465, 3696, 2640, 2520. The sum at the notch is n mod 4620.  
3
C, Eratosthenes, rings of 2 to 13 turning in alternate directions. At the notch each ring shows t mod m. A zero means m divides t, so the column of zeros at the notch sieves the divisors of t between 2 and 13.  
4
Coincidence, all zeros at the notch at once. Every 60 counts on dial A, every 4620 on dial B, and every lcm(2 … 13) = 360 360 counts on dial C.  

Study 09: Notes on the arithmetic

Irings round a notch Each dial has a notch at the top where it is read, and concentric rings round it. Ring m has m stations, each carrying a number. Every three seconds the count n goes up by one and every ring turns k stations, some clockwise and some against. k is always coprime to m, so every station of the ring reaches the notch exactly once in m counts.1 The rings follow one after another from the centre outwards, so a single count can be watched travelling through the dial.

IInumbers that add up to the count On dial A the rings have 3, 4 and 5 stations, coprime to each other. A ring turning k stations a step brings station j to the notch when n ≡ j / k modulo m, so station j carries that residue times e, where e is 1 modulo m and 0 modulo the other rings: 40, 45, 36. By the Chinese remainder theorem, known from Sunzi's manual and made general by Qin Jiushao, the labels at the notch add up to n modulo 60. Dial B does the same with 3, 4, 5, 7 and 11 at speeds 2, −3, 2, −3 and 4, and counts to 4620.2 So the rings read like a meter: 20 and 45 and 36 at the notch make 101, which is 41 modulo 60, however the rings happen to be turning.

  1. 1gcd(k, m) = 1
  1. 2Σ e·(n mod m) ≡ n mod L

IIIzeros that line up Dial C has twelve rings of 2 to 13 stations, labelled with their residues. Every zero is marked. At the notch ring m shows n mod m, so a zero there means that m divides n, and the zeros that stack up at the notch are the divisors of n, a sieve in the manner of Eratosthenes. The rings turn in alternate directions, so between the notch and the rim the zeros run apart and close again. At n = 60 seven rings show zero at once, 2, 3, 4, 5, 6, 10 and 12; all twelve agree only at n = 360 360.3 The inner rings return quickly and the outer ones slowly, so away from the notch the zeros scatter round the dial and gather again whenever n has many divisors.

IVcomplexity The three dials grow in the number of rings and in their period: lcm(3, 4, 5) = 60 counts for three rings, 4620 for five and lcm(2, …, 13) = 360 360 for twelve, twelve and a half days at one count every three seconds.4 The live readings print the labels at each notch, their sum, and the divisors of n.

  1. 3zero on ring m ⇔ m | t
  1. 460, 4620, 360 360 counts
10Planes(51)

Study 10 of 13: Planes
Thin planes in central perspective, inside a circle

A circle of radius 32 is cut by seventeen fixed chords. Each chord is read as the near edge of a plane running back to one vanishing point, and every ray and every hidden region is computed from that point. Three arrangements: chords at equal steps x = 4k, the same turned through 90°, and chords at x = 32 · sin(k · 11.25°), the projection of equal angles round a cylinder. Once a second the vanishing point moves along a sine path; the chords never change, yet the whole space appears to turn.

figures
3
chords
17 each
positions
x = 4k, or 32 · sin(k · 11.25°)
rays
34 per figure
vanishing point
sine paths
periods
28 to 44 s
Plate 10PlanesSVG
1Fins 2Slats 3Drum
1
Fins, chords at x = 4k, k = −8 … 8. Each chord is the near edge of a plane running back to the vanishing point. The region between a chord, the rim and the ray from the vanishing point through the end of the next chord outward is hidden, and is filled.  
2
Slats, the same chords turned through 90°. Horizontal planes instead of vertical ones. When the vanishing point moves up, the hidden wedges above it shorten and those below lengthen, and the other way round.  
3
Drum, chords at x = 32 · sin(k · 11.25°). Planes at equal angles round a cylinder seen end on: the projection of equal angles gives wide strips in the middle and crowded ones at the rim. The vanishing point circles the centre once in 36 s.  
4
Vanishing point, a few units from the centre, one step a second. Every ray and every hidden wedge is recomputed from it. Its position from the centre is printed beside it, x to the right and y downwards, in units of a 32 unit radius. It steps once a second along sine paths of 28 to 44 s, so the planes seem to turn in space while the chords never move.  

Study 10: Notes on the arithmetic

Ia chord as the edge of a plane Every vertical chord of the circle is taken as the near edge of a plane that stands edge on to the viewer and runs straight back. In central perspective all its other edges meet at the vanishing point, so the top and the bottom of the plane are rays from that point through the ends of the chord.1 Between two neighbouring planes, the outer one hides everything behind it below its top ray. What it cannot hide, between its ray, the rim and the inner plane, is the hidden region, and it is filled.

IIthree arrangements Fins places seventeen chords at x = 4k, k = −8 … 8, equal steps of an eighth of the radius. Slats turns the same set through 90°, so the planes are horizontal. Drum places them at x = 32 · sin(k · 11.25°): planes at equal angles round a cylinder, seen end on, so their spacing is the cosine of the angle, wide in the middle and crowded at the rim.2 In the strip that holds the vanishing point both neighbouring planes face away from it, so there the hidden region is a single wedge that runs into the point itself.

  1. 1rays from the vanishing point
  1. 2x = 4k, or 32 · sin(k π / 16)

IIIa moving eye The vanishing point moves a few units around the centre along sine paths with periods of 28 to 44 seconds, one step a second. Every wedge is recomputed from it, so the hidden regions grow on one side and shrink on the other while the planes appear to swing.3 In Drum the point goes round the centre once in 36 s, so the cylinder seems to rotate although none of its chords move.

IVreading the plate The position of each vanishing point is printed beside it, and with the grid on its every step can be read off a lattice of one unit.4 The figure works because the eye insists on one consistent space: a chord, a ray and the rim are enough for it to see depth.

  1. 328, 32, 36, 40, 44 s
  1. 4x, y from the centre
11Trellis(88)

Study 11 of 13: Trellis
Eight states, two arrows each, a number read bit by bit

Eleven columns of eight circles hold the numbers 0 to 7, one column per step. From every number two arrows lead to the next column: to twice the number, or twice the number plus one, counted modulo 8. That is all reading a binary number ever does, double and add a digit, so any stream of bits becomes a path through the lattice. The stream here is the Thue–Morse sequence, and its path moves across the plate one bit every two seconds.

states
8
columns
11
arrows
160
rule
s → 2s + b mod 8
stream
Thue–Morse
step
2 s
Plate 11TrellisSVG
0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0/0 1/1 0/1 1/0 0/1 1/0 0/0 1/1 0 1 2 3 4 5 6 7 k − 10 0 1 2 3 4 5 6 7 k − 9 0 1 2 3 4 5 6 7 k − 8 0 1 2 3 4 5 6 7 k − 7 0 1 2 3 4 5 6 7 k − 6 0 1 2 3 4 5 6 7 k − 5 0 1 2 3 4 5 6 7 k − 4 0 1 2 3 4 5 6 7 k − 3 0 1 2 3 4 5 6 7 k − 2 0 1 2 3 4 5 6 7 k − 1 0 1 2 3 4 5 6 7 k
1
States, 0 to 7 in each of eleven columns. A state is the last three bits read. Each column is one step; the newest step is on the right.  
2
Arrows, s → 2s + b mod 8. Reading one more bit doubles the number and adds the bit; only the last three bits are kept. Solid arrows add 0, dashed arrows add 1. Every state has two ways out and two ways in.  
3
Labels, b / p. On every arrow the bit that is read and the parity of the state it leads to: 1 when the new state holds an odd number of ones.  
4
Path, the Thue–Morse sequence 0 1 1 0 1 0 0 1 …. Bit n is the parity of the ones in n. Its path picks one arrow out of every pair and moves one column to the left every two seconds; the bits are printed under the columns.  

Study 11: Notes on the arithmetic

Ia lattice of states Eight states, 0 to 7, are the eight possible windows of the last three bits read. Eleven columns repeat them for eleven consecutive steps, k − 10 on the left to k on the right, so the plate holds 88 states and 160 arrows.1 The drawing is a trellis, the diagram engineers use for shift registers and convolutional codes: time runs to the right, and every arrow is one possible step.

IIdouble and add From state s the arrows go to 2s mod 8 and 2s + 1 mod 8. In binary this shifts the three bits one place to the left, drops the oldest and appends the new one. Solid arrows append 0, dashed arrows append 1. The arrows from 0 and 4 meet at 0 and 1, those from 1 and 5 at 2 and 3, and so on, so the lattice crosses itself in a regular weave.2 Each arrow is labelled b / p: the bit appended and the parity of the state it reaches.

  1. 18 × 11 states, 160 arrows
  1. 2s → 2s + b mod 8

IIIa path through it A stream of bits picks one arrow out of every pair. The Thue–Morse sequence, where bit n is the parity of the number of ones in n, never repeats a block three times in a row, so its path wanders over all eight states without settling into a loop.3 Every two seconds the next bit arrives on the right and the whole path moves one column to the left, so the plate always shows the last eleven steps.

IVreading the plate The states on the path, from left to right, spell the last eleven windows of three bits. The live readings print the stream, the current state, and the sum of the states on the path.4 All the other arrows stay in place, so the path that was taken always reads against the 2¹⁰ paths that could have been taken from the same first state.

  1. 3tₙ = popcount(n) mod 2
  1. 411 windows of 3 bits
12Rays(216)

Study 12 of 13: Rays
Seventy two rays, three rules, a tick for every unit

Three suns of 72 rays, five degrees apart. The length of every ray is a number and the ticks across it count it out. The first sun writes the multiplication table modulo the prime 73, a new permutation of 1 to 72 each second; the second counts the divisors of 72 consecutive numbers; the third makes every ray a clock of its own size, so the empty rays mark the divisors of the time.

suns
3
rays
72 each, 5° apart
A
k · m mod 73
B
d(n), n ≤ 144
C
c mod (k + 1)
step
1 s
Plate 12RaysSVG
1Products 727170696867 2Divisors 14414060483624 3Remainders 666058575050
1
Products, ray k has length k · m mod 73, m = 1 + (c mod 72). 73 is prime, so for every m the 72 lengths are the numbers 1 to 72, each exactly once, in a new order. m = 1 is a spiral that grows clockwise, m = 72 = −1 the same spiral turned back, m = 36 and 37 split the circle in two. A tick every 8.  
2
Divisors, ray k shows d(n), n = 1 + ((k + c) mod 144). One tick for every divisor of n. Primes are short rays of two ticks, highly composite numbers the longest: 120 has 16 divisors. The window moves one number a second, so the whole pattern turns by one ray.  
3
Remainders, ray k has length c mod (k + 1). Every ray is a clock of its own size: ray k grows one unit a second and falls back to nothing after k + 1 seconds. The rays that are empty at the same moment are exactly the k + 1 that divide c. A tick every 6.  

Study 12: Notes on the arithmetic

Ilengths as numbers Each ray starts on an inner circle of a quarter of the radius and runs outwards to at most 29/32 of it; the outer band up to the rim is kept for the numbers, which never cross it. Its length is a whole number of units, and ticks across the ray mark every 8th unit on the first sun, every unit on the second and every 6th on the third, with a longer bar at the end; the six longest rays of each sun print their number beyond it, the length on the first and third sun and n itself on the second. Ticks span a fixed angle, so they widen with the radius and the ticks of neighbouring rays never meet. A tick that would fall closer than half a step to the end is left out, so every gap along a ray is between half a step and a step and a half. A ray can therefore be read like a ruler.1 Rays are numbered k = 0 … 71 from the top, clockwise. The time enters as c = 33:30 + t, the same clock as everywhere in the series.

IIa permutation every second On the first sun ray k has length (k + 1) · m mod 73 with m = 1 + (c mod 72). Because 73 is prime and m is never a multiple of it, the map k → k · m is a bijection: the 72 rays always carry the 72 lengths 1 to 72, each once, only in a different order.2 For m = 1 the lengths grow steadily round the circle, a spiral; m = 72 ≡ −1 is the same spiral running the other way; m = 2 winds it twice; m = 27 has 27² = 729 ≡ −1 modulo 73, so applying it twice gives the reversed spiral.

  1. 1length = whole number of units
  1. 2k → k · m is a bijection mod 73

IIIdivisors in a window On the second sun ray k shows n = 1 + ((k + c) mod 144) and has length d(n), the number of divisors of n, one tick per divisor. Primes have exactly two divisors, so every prime is a short ray of two ticks; 1 is a single tick; 120 has sixteen divisors and 144 fifteen.3 Each second the window of 72 numbers slides by one, so the whole sun turns one ray anticlockwise and one new number enters at the top.

IVevery ray a clock On the third sun ray k has length c mod (k + 1). Each ray grows by one unit a second until it reaches k and then falls back to zero, so ray 0 is always empty, ray 1 blinks, and ray 71 takes 72 seconds to go round. The rays that are empty together are exactly those with k + 1 dividing c, so the gaps in the sun print the divisors of the time.4 The whole third sun returns to an earlier state only after lcm(1, …, 72) seconds, a number of 31 digits.

  1. 3d(p) = 2, d(120) = 16
  1. 4ray k empty ⇔ (k + 1) | c
13Grains(37)

Study 13 of 13: Grains
Three figures of discs that fill with grains and topple

A sandpile, counted. Every disc holds at most as many grains as it has neighbours. One more and it topples: it gives one grain to each neighbour and loses one, which falls out of the figure. A topple can fill a neighbour, which topples in turn, so one grain can set off an avalanche; but every topple loses a grain, so every avalanche stops. Once a second a grain falls on each figure, always at the same rule's place, and after a short beginning each figure settles into a cycle it repeats for ever: 80 seconds for the flower, 55, 55, 11 and 5 for the trays, 105 for the ring.

figures
3
discs
9, 20 and 8
rule
topple at deg + 1
grains
6 a second
periods
5 s to 105 s
step
1 s
Plate 13GrainsSVG
1Flower 2Trays 3Ring 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1
Toppling, a disc with more grains than neighbours topples. It gives one grain to every neighbour and loses one, which leaves the figure. A small dot inside a disc is a grain. The ticks count the disc's topples round its dial, eight to a full turn, then the dial empties and starts again; the number above is the total. A black disc toppled this second. The filled dot marks where the next grain falls.  
2
Flower, a centre with eight leaves, grain on leaf t mod 8. A leaf holds one grain, the centre eight. Leaves topple into the centre, and a full centre sends one grain back down every spoke. Period 80 s.  
3
Trays, four rows of five, grains on discs 1, 2, 3 and t mod 5. Inside a tray every disc has two neighbours, at the ends one. The same tray repeats every 55, 55, 11 and 5 s, depending only on where its grain falls.  
4
Ring, eight discs, grain on the top disc. Every disc has two neighbours and holds two grains. The lost grains fall into the middle and are counted at the arrow, which turns one station anticlockwise for every grain lost. Period 105 s.  
5
Balance, dropped = held + lost. Six grains fall every second, one on the flower, one on each tray and one on the ring. None is ever made or destroyed in between, so the three counts always agree.  

Study 13: Notes on the arithmetic

Ithe rule Each figure is a graph: discs are vertices, neighbours share an edge. A disc v with deg(v) neighbours is stable while it holds at most deg(v) grains. With deg(v) + 1 it topples: deg(v) grains go one to each neighbour and the last one leaves. A leaf of the flower has one neighbour and holds one grain, the centre has eight and holds eight, a disc inside a tray has two, a disc at the end of a tray one, every disc of the ring two.1 Because a topple always loses a grain, the number of grains on a figure can only stay level for a while; an avalanche cannot run for ever. The order in which unstable discs topple does not change the result, which is why the sandpile is called abelian: the plate topples all of them at once and repeats until none is left.

IIa cycle for every figure After the first grains have filled the empty figure, it reaches states it will return to, the recurrent states. Adding a grain at a fixed place and toppling is an addition in the sandpile group of the figure, which has det(Δ + I) elements, where Δ is the graph Laplacian: 1280 for the flower, 55 for a tray and 2205 for the ring.2 The period is the order of the added grain in that group. A grain at the end of a tray or next to it has order 55 and walks through every recurrent state; a grain in the middle has order 11, because the tray is symmetric about it. A tray fed on its five discs in turn adds one grain to every disc each five seconds, and its period is 5.

  1. 1stable: g(v) ≤ deg(v)
  1. 2|K| = det(Δ + I)

IIIthe flower and the ring The flower is fed on its leaves in turn, clockwise from the top. A leaf that already holds a grain topples at once, so every second leaf grain goes into the centre; the centre fills to eight and on the ninth sends one grain down each spoke, which can topple several leaves at once. The largest avalanche on the flower is nine topples in one second, the period 80 s, reached after 7 s.3 The ring is fed on its top disc. Grains spread both ways round it in waves; the whole ring repeats every 105 s = 3 · 5 · 7, after 29 s of filling, and its largest avalanche is eight topples, one for every disc.

IVcounting the grains Six grains fall every second. Each one is at every moment either on a disc or gone, and a grain is gone only by the last share of a topple, so after t seconds 6t = held + lost exactly. The number at the ring's arrow counts its lost grains, and the arrow steps one station anticlockwise for each, so it stands at station −lost mod 8; the topple counts above the discs add up to the lost grains of each figure.4 In a cycle the figure neither gains nor loses on balance: over one period it loses exactly as many grains as fall on it, one a second.

  1. 3flower: period 80, transient 7
  1. 4dropped = held + lost

Measurements by Study

metricOrbits (n=18)Chords (n=9)Capsules (n=23)Places (n=78)Punch (n=13)Dials (n=3)Discs (n=63)
figures189236 rows13 rows363
step1 s1 s1 s1 s1 s1 s1 s
shortest period2 s10 s3 s60 s48 s8 s6 s
longest period26 s60 s144 s60 s48 s24 s60 s
modulus246 to 963 to 1442 to 16322464
rulestation k ± t mod 24k → k·m mod nf(t), 23 functionsF(n + 1) = F(n) + F(n − 1)x = (2j + 1) · 216 / 2ᴸ⁺¹p · m mod 24rot(n, t mod 6)
largest value24 stations630 chords6174F(54)216 cells2363
live values189236354
plate width362U216U256U258U216U216U216U
plate height366U216U294U121U104U72U138U
height / width1.011.001.150.470.480.330.64
drawn elements2 1646621 6201 0223166471 532
circles52745258312027144
lines1 1584901 1494752694601 198
paths018101300
rectangles0186700750
groups37281912764
printed values420457884197563
numerals420030840063
distinct numerals24014130063
changes per second6 9088141 09728 0885123961 028
ink min / mean / max %27.7 / 29.7 / 31.10.2 / 0.2 / 0.227.8 / 28.1 / 28.352.5 / 52.8 / 53.132.0 / 35.7 / 39.816.0 / 16.3 / 16.839.3 / 39.3 / 39.3
grid lines1 248535879631269379909
table rows6666666
words in lead284374265349262229265
words in notes7924271 038257148224216
equations in notes2628457352
live characters1841752524282113103
chapters4444444
words in chapters427361320337410356397
footnotes4444444
page size KB105808351234671
SVG size KB85656138114166
metricHands (n=44)Rings (n=20)Planes (n=51)Trellis (n=88)Rays (n=216)Grains (n=37)
figures443 dials311 columns337 discs
step1 s3 s1 s2 s1 s1 s
shortest period12 s3 counts28 s––5 s
longest period27 720 s360 360 counts44 s––105 s
modulus2 to 122 to 13–873, 14455, 1280, 2205
rulet in base 12 and 4n mod 60, n mod 4620x = 32 · sin(k · 11.25°)s → 2s + b mod 8k · m mod 73g(v) > deg(v): topple
largest value12¹¹ − 1461934 rays714414 topples
live values444435
plate width216U216U216U216U216U216U
plate height96U72U72U108U72U72U
height / width0.440.330.330.500.330.33
drawn elements1 4228195871 2553681 071
circles198869889372
lines1 135430451488328596
paths0396160312
rectangles033008
groups4515619249439
printed values013532701838
numerals01320991838
distinct numerals04608152
changes per second881 20018 319385785 020
ink min / mean / max %0.3 / 0.3 / 0.30.6 / 0.6 / 0.617.1 / 17.2 / 17.21.3 / 1.3 / 1.40.0 / 0.0 / 0.00.0 / 0.0 / 0.0
grid lines745318301328337294
table rows666666
words in lead7188948274111
words in notes185247224183213267
equations in notes6643143
live characters1251739710093125
chapters444444
words in chapters339436337321501524
footnotes444444
page size KB604932804696
SVG size KB564428764290
Back to top