3 ms·
> I don't understand the particulars of the spectrum of this operator that they have constructed, but I have heard others describe this approach as a simple ref
by tzs 10y ago
> I don't understand the particulars of the spectrum of this operator that they have constructed, but I have heard others describe this approach as a simple reformulation of one hard problem in terms of another equally hard problem.
I don't know if it is something inherent in the RH, or just because it has received so much attention, but it seems to have a propensity for having equivalent formations in areas that do not have any obvious connection to it.
A couple examples:
• RH is equivalent to the assertion that for integers n >= 3, |log lcm(1,2,...,n) - n| < sqrt(n) log^2(n).
• For integers n >= 1, let s(n) = sum of divisors of n. E.g., s(6) = 1 + 2 + 3 + 6 = 12. Let H(n) = 1 + 1/2 + 1/3 + ... + 1/n. Then RH is equivalent to the assertion that s(n) <= H(n) + exp(H(n)) log(H(n)), with equality only at n = 1.
More at: http://mathoverflow.net/questions/39944/collection-of-equivalent-forms-of-riemann-hypothesis http://mathoverflow.net/questions/39944/collection-of-equiva...