Riemann Zeta: Euler Product Explained with Worked Examples

For , , the product being over all primes .

Write 2x or 2*x to multiply, ^ for powers, and ; between simultaneous equations. You can also type factor, expand, derivative of, integrate … from a to b, limit … as x->0 or 15% of 80.

Try an example

Before you start

This page is easier if you are comfortable with:

What Riemann zeta: Euler product means

Each factor is a geometric series: . Multiplying these series for all primes and expanding gives every integer exactly once, as a product of prime powers, by the uniqueness of prime factorisation. So the product equals . The sum converges for , as in the p-series test.

For , ; the first four primes already give . For , , and three primes give . The reciprocal is .

At the sum is the harmonic series, which diverges, and the product then shows that there are infinitely many primes, a link to proof by contradiction and the prime number theorem. The zeta function extends to complex and its zeros are the subject of the Riemann hypothesis; a functional equation comes from the Poisson summation formula.

What is it used for?

The Euler product expresses a sum over all integers as a product over the primes, linking analysis to number theory.

How to use riemann zeta: euler product

  1. Choose .
  2. For each prime compute .
  3. Multiply the factors for as many primes as needed.
  4. Compare with the sum or the known value.

Graph

Euler products for ζ(2) with primes 2, 3, 5, 7, and the limit 1.6449prime 2: 1.333primes to 7: 1.595limit π²/6 = 1.645012345600.20.40.60.811.21.41.61.8Euler products for ζ(2) with primes 2, 3, 5, 7, and the limit 1.6449primes includedvalueGraph with x from 0 to 6 and y from 0 to 1.9. Shows bars (5); point prime 2: 1.333 at (1, 1.3333); point primes to 7: 1.595 at (4, 1.5951); point limit π²/6 = 1.645 at (5, 1.6449).

Each extra prime moves the product closer to the exact value π²/6.

Worked examples

These examples are worked by hand, step by step, so you can compare your own working.

Example 1: four primes for ζ(2)

Estimate using the primes 2, 3, 5, 7.

Worked example
Answer
≈1.5951 (ζ(2)=1.6449)\approx1.5951\ (\zeta(2)=1.6449)
  1. Factors
  2. Product

Example 2: three primes for ζ(4)

Estimate using the primes 2, 3, 5.

Worked example
Answer
≈1.0817 (ζ(4)=1.0823)\approx1.0817\ (\zeta(4)=1.0823)
  1. Factors
  2. Product

Example 3: the exact value

Evaluate exactly and as a decimal.

Worked example
Answer
1.64491.6449
  1. Known result

Special cases

A few situations come up again and again. Knowing them saves time and helps you spot answers that cannot be right.

ζ(2)

π²/6

1.6449.

ζ(4)

π⁴/90

1.0823.

Factor p = 2, s = 2

1/(1 − 1/4)

1.3333.

Primes 2 and 3, s = 2

1.3333 × 1.125

1.5.

Word problems

For s > 1, ζ(s) = Σn⁻ˢ = Π(1 − p⁻ˢ)⁻¹ over primes. Each prime contributes a geometric series.

ζ(4)

Euler.

  1. π⁴/90
  2. Check: ✓1.0823

Prime 2 Higher

s = 2.

  1. 1/(1 − 0.25)
  2. Check: ✓1.3333

Primes 2 and 3 Higher

Multiply factors.

  1. 1.3333 × 1.125
  2. Check: ✓1.5

Common mistakes

Product over all integers

n ✗

primes p ✓

Euler product.

Valid for s ≤ 1

any s ✗

s > 1 ✓

Convergence.

Factor (1 − p⁻ˢ)

no inverse ✗

(1 − p⁻ˢ)⁻¹ ✓

Geometric series.

Finite product equals ζ

equal ✗

approximation ✓

All primes needed.

Exam tips

  1. s > 1.
  2. Each factor: geometric series.
  3. Unique factorisation gives the product.
  4. More primes improve the estimate.
  5. ζ(2) = π²/6.

Practice questions

Try each one on paper, then open the answer. Use the solver above to see the full working.

1. Factor p = 5, s = 2, 4 dp Foundation

1.0417

2. Factor p = 2, s = 3, 4 dp Foundation

1.1429

3. ζ(6) = π⁶/945, 4 dp Foundation

1.0173

4. Factor p = 3, s = 2, 4 dp Higher

1.125

5. Product p = 2, 3, 5 at s = 2, 4 dp Higher

1.5625

6. Factor p = 7, s = 2, 4 dp Higher

1.0208

Practice generator

Unlimited fresh questions with instant marking. Choose a level, work it out on paper, then type your answer.

Solve: …

Key terms

Riemann zeta function
Σn⁻ˢ.
Euler product
Product over primes.
Prime
2, 3, 5, …
Unique factorisation
Basis of the product.
Geometric series
Each factor.
Basel problem
ζ(2).

Frequently asked questions

What is the Euler product?

ζ(s) = Π(1 − p⁻ˢ)⁻¹.

Why does it hold?

Unique factorisation of integers into primes.

For which s is it valid?

s > 1.

What is ζ(2)?

π²/6.

Which page covers p-series?

p-series.

Which page covers the prime number theorem?

prime number theorem.

More in Analysis, algebra and topology and the formula sheets.