Can Riemann's Function Prove an Equation for Prime Numbers?

  • Context: Graduate 
  • Thread starter Thread starter jostpuur
  • Start date Start date
  • Tags Tags
    Paper
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 2K views
jostpuur
Messages
2,112
Reaction score
19
Assuming that I understood correctly one claim from the Riemann's On the Number of Prime Numbers less than a Given Quantity, then if we define a function

[tex] \psi:]0,\infty[\to\mathbb{R},\quad \psi(x) = \sum_{n=1}^{\infty} e^{-n^2\pi x},[/tex]

it satisfies an equation

[tex] 2\psi(x) + 1 = x^{-\frac{1}{2}}\Big(2\psi\big(\frac{1}{x}\big) + 1\Big).[/tex]

Anyone knowing how to prove that?
 
Last edited:
Physics news on Phys.org
well just glancing at it, doubling that function and adding one would appear to result from just summing over all integers n. see if that helps.
doesn't seem to.

or read harold edwards book studying this paper in detail.