Concept

Periodicity

The property of a pattern that repeats itself exactly after a fixed step. It is what a Fourier series assumes, and imposing it on a function that lacks it is what produces the artefacts at the ends.

Named by 20 essays across 7 fields — each of them below, with the objects they name alongside it.

A circle unrolled into a sine wave. On the left a radius turns through an angle; on the right the height of its tip is plotted against the angle, tracing a sine curve.

A sine wave is a circle seen from the side

Sine is introduced as a ratio in a right triangle, which is true and explains nothing about why its graph is a wave. There is a better picture.

analysis · Circular functions
Partial sums of the square wave. Approximations using 1, 3, 7, 21 terms; the corners sharpen but a fixed overshoot remains.

A square wave built entirely out of round ones

Add enough sine waves together and flat tops and vertical cliffs appear from nothing. Almost — there is a 9% overshoot that never goes away, and it is not a bug.

analysis · Fourier series
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.

discrete · Modular arithmetic
φ as a continued fraction. The nested fraction, one quotient per step, descending to the right.

A fraction that never closes

Euclid's algorithm throws away everything except the number of squares it peeled at each step. Those counts are a second name for the number it started from — one that terminates exactly when the ratio is a ratio.

number · Euclidean algorithm
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.

number · Modular arithmetic
A rule for moving between 3 states. 3 states drawn as circles with an arrow for every move the rule allows, labelled with its chance; a dashed loop is the chance of staying put.

The rule that forgets where it came from

A walk between a few states, with the next step decided by the current one and nothing else. Run it long enough and the starting point stops mattering — but only when two conditions hold, and both of them have a picture in which they fail.

probability · Markov chains
The spectrum of a pulse train, as the period grows. The same pulse repeated at three different intervals, with its spectrum below each. The lines move closer together as the period lengthens and the curve they lie on does not move at all.

When the period grows without bound

A repeating signal has a spectrum of separate lines. Stretch the gap between repeats and the lines crowd together while the curve they sit on stays exactly where it is — and at infinite period the lines are gone and the curve is the whole answer.

analysis · Fourier series
A 4-bit register that visits all 15 nonzero states. The first 15 states of a 4-bit linear feedback shift register with taps at 4 and 1, with the bit that leaves the register at each step; the output shows every nonzero window of 4 bits exactly once.

A memory of four bits

A register holding four bits, shifting them along and adding two of them back, runs through all fifteen nonzero states before it repeats. Which two are added back is a question about a polynomial, and getting it wrong costs fourteen of the fifteen.

computation · De bruijn
The states the continued fraction of √61 can be in. A grid of whole-number pairs with the band of reduced states shaded, the pairs that qualify marked, and the cycle of states visited by the expansion of the square root numbered in order.

Why the expansion has to repeat

The continued fraction of √61 runs 7; 1, 4, 3, 1, 2, 2, 1, 3, 4, 1, 14 and then starts again. It must: each step's state is a pair of whole numbers trapped in a small band, and only 14 pairs fit. The expansion of √61 visits 11 of them in a cycle, the other 3 form a cycle of their own, and the period reads the same backwards before its last term, which is twice the first.

number · Pell
Lissajous figures for every coprime pair of frequencies up to 4. A 4 by 4 grid of Lissajous figures x = sin(pt + 0.3), y = sin(qt), with the crossing count 2pq − p − q under each and the non-coprime pairs left blank.

When two circular motions come home

Drive a point across with one sine wave and up and down with another. If the two frequencies are in a whole-number ratio the point retraces a closed figure whose crossings can be counted in advance — 2pq − p − q of them — and if they are not, it never comes back and fills the square, spending twenty times longer in the corners than in the middle.

analysis · Circular functions
The continued fraction of e. Bars for the first 30 continued-fraction terms of e: mostly ones, with every third bar rising in a straight staircase, 2, 1, 2, 1, 1, 4, 1, 1, 6, ….

The pattern in e's continued fraction

Written as a continued fraction, e is 2; 1, 2, 1, 1, 4, 1, 1, 6, 1, 1, 8 — two ones, then the next even number, for ever. Euler found the pattern and proved it with a differential equation. A proof from 2006 needs only three integrals, each of which turns out to be exactly the error of one of e's own convergents.

number · Irrationality
A plucked string, released. A string plucked into a tent shape at 0.5, drawn at times 0, 0.1, 0.25, 0.5, 0.75, 1: the corner splits into two corners that run apart, reflect off the ends upside down and meet again.

A plucked string keeps its corners

Heat smooths a sharp profile at once, because each harmonic decays at a rate set by the square of its frequency. Change one time derivative into two and nothing decays at all: each harmonic swings for ever, the corner of a pluck splits in two and runs along the string, and after one period the shape comes back exactly. The same sines, the same coefficients — and a flow that loses nothing.

analysis · Fourier series
Whole-number points in a strip, and the shadow they cast. The lattice points satisfying 2x ≤ 5y ≤ 2x + 1 for x from 0 to 30, and their projection onto the x-axis, which repeats every 5.

Arithmetic with addition alone

Over the real numbers, a quantifier's shadow is described by inequalities. Over the whole numbers with addition and multiplication, a shadow can be any set a computer can list. In between lies arithmetic with addition and no multiplication, and there the shadows are always the same kind of thing: a finite exception, then a pattern that repeats. The whole numbers made from coins worth 6, 9 and 20 are every number from 44 on; the squares, which need multiplication, never repeat at all.

logic · Quantifiers
Integration error against the number of points: lattice, Halton and random, on a smooth periodic function. Log-log plot of integration error against N for random points (slope -0.47), Halton points (-0.96) and Fibonacci lattices (-1.83).

Points on a lattice that see almost nothing

Average a function over the points of a carefully tilted lattice and the error can fall like one over the square of the number of points — far faster than random sampling, and faster than the most evenly spread sequences. The reason is that a lattice rule is blind to only a thin set of frequencies, its dual lattice, and a smooth periodic function has almost nothing there.

probability · Monte Carlo
Which D up to 400 make x² − Dy² = −1 solvable. D from 2 to 400: 69 solvable, 302 blocked by 4 or a prime 4k + 3, 9 unsolvable with no such obstruction, first at 34.

When minus one can be reached

x² − Dy² = 1 always has a solution. Put −1 on the right and it sometimes does and sometimes does not. A remainder rules out most D at a glance, every prime of the form 4k + 1 is guaranteed one, and between the two lies a set of D decided by arithmetic several layers deep — of which, a million numbers in, 78% are solvable, on the way to a limit of 58% that was proved only in 2022.

number · Pell
The first 600 terms of the continued fraction of ∛2. Partial quotients of ∛2 computed exactly: 1, 3, 1, 5, 1, 1, 4, 1, 1, 8, 1, 14, 1, 10, 2, 1, 4, 12, 2, 3 …; the largest in the first 600 is 7451.

A cube root that looks like chance

The continued fraction of √61 repeats after eleven terms, and every square root's must. The cube root of 2 obeys no such law. Computed exactly, by a method of Lagrange's that never leaves the whole numbers, its terms run 1, 3, 1, 5, 1, 1, 4 … and throw up a 534 at the thirty-fifth place and a 7,451 at the 571st — and in every statistic anyone has measured, they look like the terms of a number picked at random.

number · Pell
Rule 30 from one cell, 120 steps, and its centre column. The rule 30 triangle grown from a single cell for 120 rows, with the centre column outlined; it begins 110111001100010110010011.

The column rule 30 will not explain

Start rule 30 from one live cell and read down the middle. The column has passed every test of randomness tried on it, and three plain questions about it are open: whether it ever repeats, whether its 1s make up half of it, and whether its n-th cell can be had without n steps of work. What can be measured says something about each — and the diagonals beside it are periodic, with periods that double going inwards.

dynamics · Cellular automata
Walking a figure eight, and the sine it makes. Bernoulli's lemniscate with 24 equally spaced stations, and the graph of the distance from its centre against arc length walked: the lemniscatic sine, period 2ϖ ≈ 5.2441, beside an ordinary sine of the same period.

The sine of a figure eight

Walk round a circle and read the height against the distance walked, and the reading is the sine. Do the same on Bernoulli's figure eight and the reading is a new function, with an arc integral that has t⁴ where the circle's has t², a length Gauss found inside an average, two periods instead of one — and exactly the same list of equal divisions that compass and straightedge can draw.

analysis · Circular functions
Two losing games that win together. A alone: -3.000 after 300; B alone: -3.131 after 300; A or B at random: 4.428 after 300; A A B B repeated: 4.322 after 300.

Two losing games that win together

Game A is a coin that wins 49.5% of the time. Game B tosses a bad coin when the capital is a multiple of three and a good one otherwise, and it loses too, because the capital spends more than a third of its time on multiples of three. Choose between the two games at random and the walk drifts upwards by 0.0157 a round; play A, B, B over and over and it gains 0.0574. Nothing is wrong with the arithmetic. The losing coin A wins by knocking the capital off the bad remainder.

probability · Random walk
Two waves through the same samples. A sine of 9 cycles per unit sampled 10 times per unit coincides at every sample with minus a sine of 1 cycle per unit. Samples: 0.000, -0.588, -0.951, -0.951, -0.588, 0.000, 0.588, 0.951, 0.951, 0.588, -0.000.

A wave known only at its ticks

Read a sine wave nine cycles a second at ten instants a second and the readings describe a wave of one cycle a second instead. Read a wave with nothing faster than 3.7 cycles a second at more than 7.4 instants a second and the readings determine it exactly. Both facts are the same fold of the frequency axis, and it is why wagon wheels turn backwards on film.

analysis · Fourier series

Named alongside it

The objects these essays reach for when they reach for this one.

Continued fractionsSineGreatest common divisorLatticeModular arithmeticPiSpectrumConvergenceCyclic groupFourier analysisFourier seriesFourier transform

All concepts