Prime-Sign Series for π
Summary: §285–§296. Applying the sieve-based Euler product derivation to the Leibniz series and its higher analogues from Chapter 10 produces a vast catalogue of identities in which (or , , , etc.) is expressed as a sum or product over primes, with signs determined by the residue class of each prime mod 4, mod 6, or mod 8. These are the simplest non-trivial Dirichlet -series in their Euler-product form — although Euler computes them a century before Dirichlet names them.
Sources: chapter15
Last updated: 2026-05-11
The mechanism
The starting point is the §284 generalisation of the §283 sieve applied to a series with a sign pattern on the natural numbers, where is completely multiplicative:
When the factor is ; when the factor is ; when the prime is excluded entirely from the product. Euler does not articulate this general framework, but he applies it to four different character-like patterns from Chapters 8 and 10.
At — primes mod 4 (§285–§289)
From Leibniz: uses the sign pattern :
(extended multiplicatively to composites). The sieve gives (§285):
i.e. Numerator is the odd prime, denominator is whichever of is divisible by 4.
Combined with the Basel-problem product expression for , §285 derives:
where the denominators are the oddly-even neighbours ( chosen so as to be ).
§286 compares these to Wallis:
(the latter has only non-prime odd numbers in the numerators — a curious complement to the prime-only versions).
Multiplying the §285 product by factors for selected primes converts an odd-prime-only product into one over all primes, with composite signs given multiplicatively (§288–§289). The resulting series:
with the sign of each composite determined by the product of the signs of its prime factors.
§290–§291 push this further: by including or excluding finitely many primes from the “negative” pile one can make the series sum to , , , or any number from a related family. Euler observes (source: chapter15, §291):
“If all but a finite collection of primes have positive signs, then the sum of the series will be infinitely large. … [If] all prime numbers, except for a finite collection, have negative signs, then the sum of the series will be equal to zero.”
At — primes mod 4 again (§287)
The same machinery applied to the §174 series gives
Numerically (§287): , and the comparison with produces the analogous cubic Wallis-style identities.
At — primes mod 6 (§292–§294)
From §176: (an alternating sum over numbers coprime to 6, signed by vs ). The sieve gives
i.e. — denominators divisible by 6.
§293 combines this with the product (with the factors stripped out) to get analogues of the §285 ratios with denominators not divisible by 6:
Multiplying by individual factors gives (§293, §294) full-prime series for , , etc.:
At — primes mod 8 (§295)
From §179: , with sign on and on . Sieving yields
so
The numerator/denominator of each fraction differs from the odd prime by 1; whether the smaller (matching ) or larger (matching ) is in the denominator depends on .
Closing remark (§296)
Euler signals (source: chapter15, §296):
“In a like manner the other series, which express circular arcs, found in sections 179 and following, could be expressed as products dependent on the prime numbers. In this way we could develop important properties of both infinite series and infinite products, but since we have discussed the principal results, we will not delay any longer to develop more.”
He leaves the analogues for higher moduli, mod 12, mod 16, etc. — which would come to be classified by Dirichlet (1837) as the characters mod , with each non-trivial giving an -function .
Modern dictionary
| Euler’s series | Modern -function | Value at |
|---|---|---|
| §284, : | ||
| §287, : | ||
| §292, mod 6: | ||
| §295, mod 8: |
Each is the Dirichlet -function of a (real, primitive) character of small conductor; each is associated to an imaginary or real quadratic field via the Dirichlet class number formula. Euler had every example one would meet in an introductory analytic number theory course — without the unifying vocabulary.
Worked example: §285 derivation in detail
Start with . To sieve out primes:
- Add to remove the term and (with sign-tracking) all multiples of 3:
- Subtract to remove multiples of 5:
- Add to remove multiples of 7:
Continue: at each prime, add if and subtract if . At the end only 1 remains, giving
At this is the §285 identity for .