Concept

P adic numbers

Numbers built by measuring size through divisibility by a prime p, so that high powers of p count as small. In them 1 + 2 + 4 + … converges to −1, and equations can be solved digit by digit by lifting a solution modulo p.

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

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.

discrete · Modular arithmetic

1 + 2 + 4 + … in two notions of size. Two sets of points against the number of terms up to 20 on an axis whose gridlines are powers of 2: the partial sums' ordinary size rising, their 2-adic distance from −1 falling.

A series that converges to minus one

1 + 2 + 4 + 8 + … runs off to infinity, and yet the formula for a geometric series says it should equal 1/(1 − 2) = −1. Measure size by how many factors of 2 a number has, instead of how large it is, and powers of 2 become small: the series converges, and to exactly −1. The same change of ruler explains why every repeating decimal is a fraction, and why repeating binary digits running off to the left are fractions too.

analysis · Geometric series

Named alongside it

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

Modular arithmetic Binary Convergence Derivative Geometric series Hensel lemma Lifting Local global principle Newtons method Quadratic residue Rational number Square root

All concepts