# Explicit formulas: primes ↔ zeros

“Explicit formulas” are identities that connect prime counting (typically via Chebyshev functions like \(\psi(x)\)) to sums over zeros of ζ(s) (or more general L-functions). Conceptually, they are a precise form of the slogan:

> **Primes are controlled by zeros.**

A prototypical form expresses \(\psi(x)\) as a main term \(x\) plus oscillatory corrections coming from nontrivial zeros.

## Key ideas

- **From Euler product to primes:** differentiating \(\log\zeta(s)\) connects ζ(s) to the von Mangoldt function \(\Lambda(n)\).
- **Zeros drive oscillations:** sums over \(\rho\) (zeros) produce fluctuating terms that explain biases and sign changes seen in finite ranges.
- **Numerical truncation:** in experiments, one typically truncates zero sums and studies stability vs cutoff parameters.

## Why it matters in this project

This is the bridge between the “Dirichlet character / L-function” block and the “prime race / bias” phenomena: you can literally watch zero contributions modulate prime-counting curves.

## Experiments in this repository

- **E119** — ψ(x) − x oscillations and “explicit-formula intuition” (visual).

## References

See {doc}`../references`.

{cite:p}`titchmarsh1986,ivic1985,schoenfeld1976sharperboundschebyshev,iwanieckowalski2004analyticnumbertheory,WikipediaContributors2025RiemannZetaFunction`