|
|
|
Curios:
Curios Search:
Participate:
|
Proving the Riemann Hypothesis is equivalent to showing
floor(H(n)+eH(n))*log(H(n)) > σ(n),where H(n) = 1 + 1/2 + 1/3 + ... + 1/n, and σ(n) is the sum of the divisors of n. For example, when n = 17, the two sides differ by 23. [Caldwell]
1 7
9 6 3 6
5 7 5 1
2 8 4 3 8 2 4 9
[Beedassy]
To link to this page use http://primes.utm.edu/curios/page.php?number_id=7953
Prime Curios! © 1999-2009 (all rights
reserved)
|