EVOPEDIA

← all systems · see it in The System

Prime numbers (the practice of number theory that finds, proves and uses them, and the structure of the primes it works on)

A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. ... Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

Properties published scienceour proposal

Sourced fields, and our own readings.

born atabout 1550 BC (Rhind papyrus, different methods for prime denominators) or c. 300 BC (Euclid's Elements), contested
born precisionapproximate
boundaryInside: the primes as number theory describes them (the natural numbers greater than 1 with exactly two divisors, their unique factorization of every other number, their infinitude and distribution), and the practice that works on them: reading and writing numerals and factorizations, sieves and primality tests, factoring algorithms, proofs and verified computations, the theory of their distribution (prime number theorem, Riemann hypothesis, gaps, progressions), and the uses that run on them (public-key keys, hash tables, checksums, record searches, rhythms in music). Outside: the natural numbers and arithmetic they sit in (number walk), the rest of mathematics, the machines and networks that run the searches, the cryptographic systems that run on primes, and the living things (cicadas, chicks, people) that meet the structure without the idea.
nested levelA part of number theory inside mathematics (rung 11), carried by people, written records and computers; the structure it names is booked at rung 0 (roles); cicada life cycles and chick perception meet it at rungs 7-8.
scalesocial

Measures (36) published science

prime-counting asymptoticpi(n) ~ n / log n count
average gap between consecutive primes near xabout log x integers
chance a random integer near x is primeabout 1 in log x probability
primes below 10025 count
proofs of the infinitude of primesat least 200 count
digits in the largest known prime41,024,320 digits
known Mersenne primes52 count
Mersenne primes found by GIMPS18 count
GIMPS users and hosts290,000 users; 3,200,000 hosts count
error rate per Lucas-Lehmer run (no serious error reported)1.5 %
error rate per Lucas-Lehmer run (at least one serious error reported)50 %
round-off check interval128 iterations
cost of the 2024 record huntabout a year and $2 million time and US dollars
largest prime found without electronic computers44 digits
Goldbach conjecture verifiedall even n below 4 x 10^18 bound
Riemann hypothesis verified to height3 x 10^12 imaginary part
computation to verify the Riemann hypothesis to height 3e12some 7.5 million core hours (3.6 GHz)
zeros checked by Odlyzkoover 3 x 10^8 at heights up to 2 x 10^20 zeros
bounded prime gaps: Zhang70,000,000 integers
bounded prime gaps: Polymath (Zhang's method)4680 integers
bounded prime gaps: Maynard600 integers
bounded prime gaps one year after Zhang246 integers
RSA-240 size795 bits
RSA-240 costabout 1000 core-years
common RSA prime size2048 bits
share of TLS certificates with RSA signatures90 %
largest number factored by Shor's algorithm on a quantum computer21 integer
periodical cicada life cycle13 or 17 years
interval between joint emergences of 13- and 17-year broods221 years
periodical cicada density at emergencesometimes more than 1.5 million per acre individuals
chick familiarisation360 stimuli over 1 hour
ratio of the hard chick comparison (13 vs 15)0.87 ratio
savant prime judgement accuracy above 10,00070 (control 40) %
trial division costOmega(sqrt n) steps
Euler polynomial n^2 - n + 41 prime runn = 1 to 40 values
age of the oldest records of prime-aware arithmeticabout 1550 BC (Rhind papyrus); c. 300 BC (Euclid) date

Open contentions (7) open contention

Where sources or readings disagree. Both stay on the map.

Cross-scale patterns seen here (22) our proposal

Shapes that recur when the same kind of problem is solved at different scales, and how each shows in Prime numbers (the practice of number theory that finds, proves and uses them, and the structure of the primes it works on). Each links to every other system that shows it.

Valence: what it trades, and with whom (16) published science

Each exchange with a neighbour, read from both sides: who gains, who pays, and what carries it.

Partners and parts published science

Built from / builds (8)

Sits inside / holds (3)

expressed by (22)

floor filled by (18)

represents (1)

Kinds (8)

Notes published science

Layers

The ways it takes in its world, where they meet, and how it acts back, each from L1 (where it meets the world) up.

prime numbers: whole numbers that cannot be split into equal groups, met as dots, numerals, life cycles and machine output, up to proofs, theories, records and keys (reader's view)

  1. L1: Quantity that can or cannot be split into equal groups: n items, n dots that will or will not make a rectangle, n years in a life cycle; the natural numbers themselves
  2. L2: Taking it in: arrays seen and grouped into subsets (equal for composites, never for primes); numerals read (decimal endings 1, 3, 7, 9 above 5); a machine's residues and reports
  3. L3: Codes: the definition (greater than 1, exactly two divisors), the prime factorization written as prime powers, the symbols P and pi(x), forms such as 2^p - 1
  4. L4: Operations: trial division, the sieve of Eratosthenes, Fermat, Miller-Rabin, AKS and Lucas-Lehmer tests, factoring algorithms (number field sieve; Shor's on quantum hardware)
  5. L5: Proof and verification: Euclid's infinitude and unique factorization, the prime number theorem, Green-Tao, bounded gaps; machine results checked (double checks, Gerbicz, Pietrzak proofs, interval arithmetic, Turing's method)
  6. L6: The theory of their distribution: pi(x) ~ x/log x, the zeta function and its zeros, the Riemann hypothesis, random models, gaps and progressions, the open conjectures (Goldbach, twin primes); in experts carried by a bilateral fronto-parietal-temporal network (C-1188)
  7. L7: Use and meaning back on the world: keys (RSA, Diffie-Hellman), hash tables, checksums and PRNGs; record searches; prizes and open problems; rhythms in music; the question whether primes are discovered or invented (C-2349); cicada cycles explained

the boardroom (shared floors)

  1. L3: Codes (the ports): the definition (exactly two divisors), prime factorizations as prime powers, numerals and their endings, the symbols P and pi(x), special forms (2^p - 1, 2^(2^k) + 1); for perception, sets read as equal or unequal groups
  2. L4: Operating: trial division, sieves, Fermat / Miller-Rabin / AKS / Lucas-Lehmer tests, factoring by the number field sieve, Shor's quantum algorithm; for savants, sieve-like judging
  3. L5: Proof and verification: Euclid's proofs, unique factorization, the prime number theorem, bounded gaps, Green-Tao; results of machines held to proof standards (double checks, Gerbicz checks, Pietrzak proofs, interval arithmetic and Turing's method); what counts as verified to a bound versus proved
  4. L6: The theory of primes: their distribution (prime number theorem, zeta zeros, Riemann hypothesis, random models and their limits, gaps, progressions) and the open conjectures; in experts carried by a bilateral frontal, intraparietal and ventrolateral temporal network shown for advanced mathematics in general (C-1188)
  5. L7: Use and meaning: keys and signatures, hash tables, checksums, PRNGs; record searches and prizes; Messiaen's prime rhythms; the open question whether primes are discovered or invented (C-2349) and what cicadas and chicks say about it

way in: Emotion: fascination with primes

  1. L1: Fascination: Sagan's primes as a sign of an intelligent mind; the cicada puzzle that captivates mathematicians and philosophers

way in: Factoring records and quantum factoring (what attackers achieve)

  1. L1: A record: a public challenge number split into its two primes (RSA-768 in 2009, RSA-240 and RSA-250 in 2019-2020); Shor's algorithm run on 21
  2. L2: The method: the number field sieve, about 1000 core-years, cheaper than predicted; Shor's quantum algorithm in principle
  3. L3: Read as a measure of how hard factoring is: improvements are to be expected

way in: Letters, papers and open collaboration (other people's results)

  1. L1: A letter or a post: Goldbach to Euler (1742); Zhang's paper (2013) and the Polymath posts after it
  2. L2: Read and taken up: Tao proposes a Polymath effort to improve Zhang's bound
  3. L3: Improved and returned: the bound cut from 70,000,000 to 4680 (Polymath) and to 246 within a year

way in: Life cycles in nature that run on primes (periodical cicadas)

  1. L1: Broods emerging every 13 or 17 years, in densities that satiate predators
  2. L2: Observed and timed by naturalists: time-dependent maturation (emerge after exactly 13 or 17 years whatever their size); the timing mechanism unknown
  3. L3: Modelled: individual-based models of glacial cooling, predation and hybridisation; 13 x 17 = 221 years between joint emergences

way in: Machine output: record searches for primes (GIMPS)

  1. L1: Huge numbers held in memory as FFT-length arrays; round-off error checked every 128 iterations
  2. L2: The test run: trial factoring (usually on GPUs), P-1, the probable-prime (Fermat) test or the Lucas-Lehmer test
  3. L3: Results reported to the PrimeNet server across hundreds of thousands of volunteers
  4. L4: Candidates ruled out or flagged: PRP with Gerbicz checks; all exponents below 100 million checked at least once (2020)

way in: Machine output: zeros of the zeta function located

  1. L1: Values of the zeta function computed rigorously with interval arithmetic (Arb)
  2. L2: Sign changes found on the half line, each a zero
  3. L3: Zeros counted over a range (Odlyzko's 3 x 10^8 zeros near 2 x 10^20; Platt and Trudgian's whole range to 3 x 10^12)
  4. L4: Turing's method: the count checked against the expected number, so none lie off the line

way in: Sight: numerals, tables and plots of primes read

  1. L1: Numerals written down: lists of primes, tables, the Ulam spiral's marked squares
  2. L2: Reading the digits: in decimal, every prime above 5 ends in 1, 3, 7 or 9; evens and fives are ruled out at a glance
  3. L3: Patterns seen in tables and pictures: Gauss's density question at 15, the Ulam spiral's diagonals

way in: Sight: sets of objects that do or do not split into equal groups (chicks and people)

  1. L1: Arrays of elements on a screen (dots, shapes, colours): 4, 6, 10, 12 in familiarisation; 7, 9, 11, 13, 15 at test
  2. L2: Perceptual grouping by Gestalt cues (colour, shape, proximity): composites split into equal subsets, primes always leave an odd group
  3. L3: Asymmetry read: chicks prefer the prime set as novel; adults slow down at 5, 7 and 11; the mechanism fails past a set size without cues

way in: Thought: a number held and judged in the mind (savants, mathematicians)

  1. L1: A number held in mind and asked of: is it prime? (where the thought comes from is contested, C-413); twins exchanging ever-larger primes, a young man judging primes above 10,000
  2. L4: Judging: response times matching a sieve-like procedure (Anderson et al.), or visual grouping of imagined sets (Welling, speculative)

way out: Announcing a record prime

  1. L1: The number made public: 41,024,320 digits
  2. L5: The result verified (proof files; double check)
  3. L7: The aim: the largest known prime

way out: Composing with primes (Messiaen's rhythms)

  1. L1: Sound in the air: unpredictable rhythms
  2. L4: Motifs of prime lengths layered at once (41, 43, 47, 53 in Neumes rythmiques)
  3. L7: The aim: ametrical music from 'natural phenomena'

way out: Making keys: large random primes into public and private keys

  1. L1: The public key and signed or encrypted messages on the network (90% of TLS certificates used RSA signatures, late 2019)
  2. L4: Two large primes chosen at random (2048-bit primes are common) and kept secret; tested with fast primality tests
  3. L7: The aim: secure data transmission and signatures

way out: Primes put into computing (hash tables, checksums, PRNGs)

  1. L1: Bits in memory arranged by prime moduli
  2. L7: The aim: spreading and checking data

way out: Writing and publishing a proof or a result

  1. L1: The paper posted and published (arXiv preprint, journal)
  2. L5: The proof written: three ingredients (Szemeredi, transference, Goldston-Yildirim)
  3. L6: The theorem to be stated (arbitrarily long progressions of primes)

Sources (28) published science

Prime number (encyclopedia article, WME snapshot 2026-11-01)
Boudot F, Gaudry P, Guillevic A, Heninger N, Thome E, Zimmermann P. Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. arXiv:2006.06197 (CRYPTO 2020) (behind its links)
Great Internet Mersenne Prime Search (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Twin prime (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Sieve of Eratosthenes (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Toivonen J, Fromhage L (2020) Hybridization selects for prime-numbered life cycles in Magicicada: an individual-based simulation model of a structured periodical cicada population. Ecology and Evolution 10:5259-5269. doi:10.1002/ece3.6270 (CC BY; PMC7319174) (behind its links)
Platt D, Trudgian T (2021) The Riemann hypothesis is true up to 3*10^12. Bull London Math Soc 53:792-797. arXiv:2004.09765 (behind its links)
Integer factorization (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Bombieri E. Problems of the Millennium: the Riemann Hypothesis (Clay Mathematics Institute official problem description) (behind its links)
Fundamental theorem of arithmetic (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Primality test (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Prime number theorem (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Loconsole M, Regolin L (2022) Are prime numbers special? Insights from the life sciences. Biology Direct 17:11. doi:10.1186/s13062-022-00326-w (CC BY; Europe PMC full text PMC9137056) (behind its links)
Agrawal M, Kayal N, Saxena N. PRIMES is in P (author PDF v6; Annals of Mathematics 160 (2004) 781-793) (behind its links)
Soundararajan K. Small gaps between prime numbers: the work of Goldston-Pintz-Yildirim. arXiv:math/0605696 (Bulletin of the AMS 44 (2007) 1-18) (behind its links)
Euclid's theorem (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Largest known prime number (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Mersenne prime (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Goldbach's conjecture (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Maynard J. Small gaps between primes. arXiv:1311.4600 (Annals of Mathematics 181 (2015) 383-413) (behind its links)
Periodical cicadas (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Green B, Tao T. The primes contain arbitrarily long arithmetic progressions. arXiv:math/0404188 (Annals of Mathematics 167 (2008) 481-547) (behind its links)
Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing 26(5), 1997 (arXiv:quant-ph/9508027) (behind its links)
RSA cryptosystem (Wikipedia) (behind its links)
Green, Tao: The primes contain arbitrarily long arithmetic progressions (arXiv:math/0404188; Annals of Mathematics 2008) (behind its links)
Paley graph (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Ulam spiral (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Ito H, Kakishima S, Uehara T, Morita S, Koyama T, Sota T, Cooley JR, Yoshimura J (2015) Evolution of periodicity in periodical cicadas. Scientific Reports 5:14094. doi:10.1038/srep14094 (CC BY; PMC4568538) (behind its links)