logo
Kurashizu Blogwhere ideas flow
  • Home
  • News
  • Blog
  • About
  • Home
  • News
  • Blog
  • About

© 2026 Kurashizu. All rights reserved.

Admin·New Post·Service Status
Powered by Cloudflare·01.11.26
← Back to news

What does the Riemann zeta function have to do with the distribution of primes?

Original article
hidden-phenomena.com|91 points|18 comments|by mb1699|Jul 17, 2026

The Connection Between the Riemann Zeta Function and Prime Distribution


The Eternal Question of Primes

One of the most foundational pillars of mathematics is the realization that prime numbers never end. This was established by the geometer Euclid around 300 BCE. For many centuries, this discovery was seen as the final word on the matter.

"If there are infinitely many primes, is there anything left to discover about them?"

The answer is a resounding yes. To understand why, we must look at the "density" of different sets of numbers.

Quantifying "Commonality"

Consider the difference between even numbers and powers of 2. While both are infinite sets, they occupy the number line very differently.

Number SetFrequency (1 to 1000)Nature
Even Numbers500Relatively Common
Powers of 210Relatively Rare

We can mathematically express this difference by summing their reciprocals:

  • Even Numbers: 12+14+16+18+⋯=∞\frac{1}{2} + \frac{1}{4} + \frac{1}{6} + \frac{1}{8} + \cdots = \infty21​+41​+61​+81​+⋯=∞ (Divergent)
  • Powers of 2: 12+122+123+124+⋯=1\frac{1}{2} + \frac{1}{2^2} + \frac{1}{2^3} + \frac{1}{2^4} + \cdots = 121​+221​+231​+241​+⋯=1 (Convergent)

In essence, powers of 2 grow so rapidly that their reciprocals shrink fast enough to hit a finite ceiling. Even numbers, however, stay "close" enough together that their sum climbs forever. This led Leonhard Euler to wonder about the primes:

Is ∑p prime1p=12+13+15+17+111+⋯ finite or infinite?\text{Is } \sum_{p\text{ prime}} \frac{1}{p} = \frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + \frac{1}{11} + \cdots \text{ finite or infinite?}Is ∑p prime​p1​=21​+31​+51​+71​+111​+⋯ finite or infinite?


Introducing the Riemann Zeta Function

To tackle this, Euler utilized a specific mathematical object. Although it is now called the Riemann zeta function (named after Bernhard Riemann, who expanded upon it much later), Euler was the one who first uncovered its secrets.

The function is defined as the infinite sum: ζ(s)=∑n=1∞1ns=1+12s+13s+14s+⋯\zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s} = 1 + \frac{1}{2^s} + \frac{1}{3^s} + \frac{1}{4^s} + \cdotsζ(s)=∑n=1∞​ns1​=1+2s1​+3s1​+4s1​+⋯

The Euler Product Formula

Euler's breakthrough was realizing that ζ(s)\zeta(s)ζ(s) could be rewritten as a product involving only prime numbers. Imagine multiplying these infinite series together:

(1+12s+14s+⋯ )(1+13s+19s+⋯ )(1+15s+125s+⋯ )⋯\left(1+\frac{1}{2^s}+\frac{1}{4^s}+\cdots\right)\left(1+\frac{1}{3^s}+\frac{1}{9^s}+\cdots\right)\left(1+\frac{1}{5^s}+\frac{1}{25^s}+\cdots\right) \cdots(1+2s1​+4s1​+⋯)(1+3s1​+9s1​+⋯)(1+5s1​+25s1​+⋯)⋯

When you distribute these terms, you generate every possible combination of prime powers. For example:

  • 1⋅1⋅1=11 \cdot 1 \cdot 1 = 11⋅1⋅1=1
  • 12s⋅1⋅1=12s\frac{1}{2^s} \cdot 1 \cdot 1 = \frac{1}{2^s}2s1​⋅1⋅1=2s1​
  • 12s⋅13s⋅1=16s\frac{1}{2^s} \cdot \frac{1}{3^s} \cdot 1 = \frac{1}{6^s}2s1​⋅3s1​⋅1=6s1​
  • 14s⋅19s⋅15s=1180s\frac{1}{4^s} \cdot \frac{1}{9^s} \cdot \frac{1}{5^s} = \frac{1}{180^s}4s1​⋅9s1​⋅5s1​=180s1​

Because of the Fundamental Theorem of Arithmetic (which states every integer has a unique prime factorization), every single 1/ns1/n^s1/ns appears exactly once.

# Conceptual logic of the Euler Product expansion
def expand_zeta(primes, s):
    # Each prime p contributes a geometric series: 1 + p^-s + p^-2s...
    # The product of these series equals the sum of all n^-s
    return "Sum of all 1/n^s"

This gives us the Euler Product Formula: ∑n=1∞1ns=∏p prime(1+1ps+1p2s+1p3s+⋯ )\sum_{n=1}^{\infty} \frac{1}{n^s} = \prod_{p\text{ prime}} \left(1 + \frac{1}{p^s} + \frac{1}{p^{2s}} + \frac{1}{p^{3s}} + \cdots\right)∑n=1∞​ns1​=∏p prime​(1+ps1​+p2s1​+p3s1​+⋯)


Simplifying via Geometric Series

The terms inside the product are geometric series. We can simplify them using a standard algebraic trick. If we let XXX be the sum: X=1+1ps+1p2s+⋯X = 1 + \frac{1}{p^s} + \frac{1}{p^{2s}} + \cdotsX=1+ps1​+p2s1​+⋯ Then: Xps=1ps+1p2s+1p3s+⋯\frac{X}{p^s} = \frac{1}{p^s} + \frac{1}{p^{2s}} + \frac{1}{p^{3s}} + \cdotspsX​=ps1​+p2s1​+p3s1​+⋯

Subtracting the two: X−Xps=1  ⟹  X(1−1ps)=1  ⟹  X=11−1psX - \frac{X}{p^s} = 1 \implies X\left(1 - \frac{1}{p^s}\right) = 1 \implies X = \frac{1}{1 - \frac{1}{p^s}}X−psX​=1⟹X(1−ps1​)=1⟹X=1−ps1​1​

Thus, the zeta function becomes: ζ(s)=∏p prime11−p−s\zeta(s) = \prod_{p\text{ prime}} \frac{1}{1 - p^{-s}}ζ(s)=∏p prime​1−p−s1​

Zeta Function Concept

The Bridge to Calculus

This formula is a critical "bridge." It connects Number Theory (the study of primes) with Calculus (the study of infinite series and continuous functions).

Crossing the Bridge

To solve the original problem—the sum of the reciprocals of primes—we need to turn the product into a sum. The standard tool for this is the logarithm.

Proof Roadmap:

  • Define ζ(s)\zeta(s)ζ(s) as a sum.
  • Convert ζ(s)\zeta(s)ζ(s) to a product over primes.
  • Simplify using geometric series.
  • Apply logarithms to convert the product back to a sum.
  • Use Taylor series to isolate the prime reciprocals.

By taking the log of the Euler product, we get: log⁡ζ(s)=∑p primelog⁡(11−1ps)\log \zeta(s) = \sum_{p \text{ prime}} \log \left( \frac{1}{1 - \frac{1}{p^s}} \right)logζ(s)=∑p prime​log(1−ps1​1​)

While these logarithms look daunting, they can be further simplified using the Taylor series expansion for log⁡(11−x)…\log(\frac{1}{1-x}) \dotslog(1−x1​)…