An elementary problem equivalent to the Riemann hypothesis

[benorin]

Let H_{n}=\sum_{k=1}^{n}\frac{1}{k} be the n^th harmonic number, then the Riemann hypothesis is equivalent to proving that for each n\geq 1,

\sum_{d|n}d\leq H_{n}+\mbox{exp}(H_{n})\log H_{n}​

where equality holds iff n=1. The paper that this came from is here: An Elementary Problem Equivalent to the Riemann Hypothesis by Jeffrey C. Lagarias.

No questions, just thought it would be appreciated.

 

[cracker]

I don't understand... explain! This thread made my haed hurt!

 

[rpenner]

This is based on \sigma(n) = \sum_{d|n}d < e^{\gamma} n \log \log n for all n >= 5041 being logically equivalent to the Riemann Hypothesis as shown in
Guy Robin, Grandes valeurs de la fonction somme des diviseurs et hypoth`ese de Riemann,J. Math. Pures Appl. (9) 63 (1984), 187–213.
See also: http://arxiv.org/abs/math.NT/0604314

 

[HallsofIvy]

H_{n}=\sum{k=1}^{n}\frac{1}{k}
should be
H_n= \sum_{k=1}^{n}\frac{1}{k}

 

[eljose]

-Beatiful problem..but completely useless... the problem itself is even more problematic than RH..since you can calculate every Harmonic Number (approximately) the problem is to calculate:

\sum_{d|n} d for every n even for n big.

 

[shmoe]

There are other equivalences that can be considered 'elementary', the error term in prime number theorem, bounds for the sum of the moebius function..

This one is nice quite nice though. I wonder if there's any connection between the height of the first zero off the line and the smallest counterexample to this criterea (assuming false of course).

I don't understand... explain! This thread made my haed hurt!

It's hard to know where to start on such an open question. There are lots of threads on the Riemann Hypothesis, try doing a search for them. What specific things are bothering you?