🗂️ Maths, Logic & Crypto · View mindmap

Prime Numbers

Prime numbers are natural numbers greater than 1 that have no positive divisors other than 1 and themselves. They are the fundamental building blocks of number theory, as every integer greater than 1 is either a prime itself or can be represented as a unique product of primes (the fundamental theorem of arithmetic).

Key Properties

• Indivisibility: Primes cannot be formed by multiplying two smaller natural numbers.
• Infinite Quantity: There are infinitely many prime numbers (Euclid’s theorem).
• Distribution: The density of primes decreases as numbers get larger, described asymptotically by the prime number theorem.

Prime Gaps

A prime gap is the difference between two successive prime numbers. While primes become less frequent, gaps between them can be arbitrarily large.

Constructive Proof of Large Gaps

It is possible to construct sequences of consecutive composite numbers of any given length $n$. This is typically demonstrated using factorial properties:

• Consider the sequence $n!+2,n!+3,\dots ,n!+n$.
• Each term $n!+k$ (where $2\le k\le n$) is divisible by $k$.
• Thus, this sequence contains $n-1$ consecutive composite numbers.
• This proves that prime gaps can be arbitrarily large, contradicting the intuition that primes are uniformly distributed.

For a detailed breakdown of this constructive proof and its implications for prime distribution, see: Constructive Proof of Arbitrarily Large Prime Gaps Using Factorials

Related Concepts

• Twin Primes: Pairs of primes with a gap of 2.
• Goldbach Conjecture: Every even integer greater than 2 is the sum of two primes.
• Riemann Hypothesis: Deep connection between prime distribution and complex analysis.

References

• Constructive Proof of Arbitrarily Large Prime Gaps Using Factorials (Numberphile, 2026-09-17)