--- title: "The Distribution of Primes and What Is Still Open" description: "Prove the primes never run out, meet the estimate for how thinly they spread, and see where the honest boundary of current knowledge sits." canonical: https://lightmysky.com/learn/mathematics/the-distribution-of-primes-and-what-is-still-open-mt_PJwm9kuQWQ source: https://lightmysky.com/learn/mathematics/the-distribution-of-primes-and-what-is-still-open-mt_PJwm9kuQWQ.md retrieved: 2026-09-12 --- > **Agent view.** This is the Markdown twin of the page, for tools and assistants. > When to use this site, and the call that answers each job: https://lightmysky.com/agent-instructions.md > API description (OpenAPI 3.1): https://lightmysky.com/openapi.json · Authentication: https://lightmysky.com/auth.md > Pricing: https://lightmysky.com/pricing.md · Catalog: https://lightmysky.com/llms.txt · Full catalog: https://lightmysky.com/llms-full.txt > Every machine-readable file on this domain: https://lightmysky.com/.well-known/ai-catalog.json > Ask for Markdown with `Accept: text/markdown`, a `.md` address, or `?mode=agent`. # The Distribution of Primes and What Is Still Open Prove the primes never run out, meet the estimate for how thinly they spread, and see where the honest boundary of current knowledge sits. Subject: Mathematics · Area: Number Theory · Ages 21 to 22 Page: https://lightmysky.com/learn/mathematics/the-distribution-of-primes-and-what-is-still-open-mt_PJwm9kuQWQ ## Ready when they can - Give Euclid's proof that the primes are infinite and one other proof of the same fact - State the prime number theorem and use it to estimate a prime count - Describe an open problem about primes precisely enough to say what a solution would need to establish ## Lesson: Primes never end but thin out Primes never run out. Euclid multiplies a finite list and adds one, forcing a prime factor outside the list. From 2, 3, 5 you form 30 plus one, which is 31. That new divisor escapes every member you started with. Listing primes to 10 gives 2, 3, 5, 7, four in total, and to 30 gives ten. The prime number theorem says the count up to x sits near x over the natural log of x. For 100 the log is about 4.6, so the estimate is about 21.7, rounding to 22, against the exact 25. Density thins while persistence remains. Clock remainders and residue classes sharpen how primes spread, but the thinning trend is the heart. Open problems ask about fine structure beyond density. Twin primes are pairs distance 2 apart, like 11 and 13, and nobody knows if they go on forever. Goldbach asks whether every large even number splits into two primes. A solution must prove the infinite versus finite verdict, or the always splits claim, not just show examples. **Tip.** Treat estimates as shadows, not promises. The theorem never pledges exact counts, so 22 against 25 is fit, not failure. When you meet a prime claim, ask first if it wants infinitude, density, or exact structure. **Recap.** Primes never end, thin out near x over log x, and hide open puzzles. ## Practice 17 questions on this page, each with its working shown. ## Needs first - [Quadratic Residues and the Law of Reciprocity](https://lightmysky.com/learn/mathematics/quadratic-residues-and-the-law-of-reciprocity-mt_0KS9eTCY4p) - [Improper Integrals and Their Convergence](https://lightmysky.com/learn/mathematics/improper-integrals-and-their-convergence-mt_gvtZPFRA6Z) - [Divisibility and the Division Algorithm](https://lightmysky.com/learn/mathematics/divisibility-and-the-division-algorithm-mt_UkQNs-6-40)