Theme

The same thing twice — page 18

Two constructions that look unrelated and turn out to be the same object wearing different clothes.
Scrambled in three steps, restored in thirty. Cat map on 61×61: period 30; frames at steps 0, 1, 2, 3, 7, 22, 30; lit pixels 693. Dynamics

A chaotic map that always comes back

Arnold's cat map stretches a square by the golden ratio squared and wraps it round, and any two nearby points fly apart: a difference of a million-millionth fills the square in twenty-seven steps. Apply the same map to a picture made of pixels and it dissolves into noise within a few steps — and then, after exactly thirty steps on a 61 × 61 grid, every pixel is back where it started. Chaos and exact return are both true, and the Fibonacci numbers decide how long the return takes.

Where charges settle on a sphere. N=4: E=3.674234614, distinct minima from 8 starts: 1; N=6: E=9.985281374, distinct minima from 8 starts: 1; N=8: E=19.675287861, distinct minima from 8 starts: 1; N=12: E=49.165253058, distinct minima from 8 starts: 1; N=20: E=150.881568334, distinct minima from 8 starts: 1; five charges: bipyramid 6.474691, best square pyramid 6.483661. Geometry

Where charges settle on a sphere

Put equal electric charges on a sphere and let them push each other apart until nothing moves. Four settle at the corners of a tetrahedron, six of an octahedron, twelve of an icosahedron — but eight do not make a cube, and twenty do not make a dodecahedron. The cube loses to two squares turned half a corner apart, because charges on a sphere prefer triangles; and however many charges there are, exactly twelve more of them have five neighbours than have seven.

The largest prime factor, as a power of the number. Share of n with log P(n)/log n ≤ s: at s=0.5, n≤10⁴ 0.268, n≤10⁷ 0.272, Dickman 0.307; median e^(−1/2) = 0.6065; largest gap at 10⁷ 0.061. Number

The largest prime in a typical number

Count a number's prime factors and the answer is about log log n. Ask instead how big the largest one is, and the answer is a power of n with a law of its own: half of all large numbers have a prime factor above n^0.6065, and the share whose primes all stay below n^(1/u) is Dickman's ρ(u), a function defined by its own past. The same law governs the longest cycle of a random shuffle, and there it arrives at once; for the numbers themselves, at ten million, it is still visibly on its way.

All themes