An Elementary Problem Equivalent to the Riemann Hypothesis

en · official · sha256:a785fa37d5123ef074701e734c45fa8d529f0d7c6ce8ee543dcd28cb16140a14EN

M. Kaneko notes that these results together with a small computation can be used to show that the Riemann hypothesis is equivalent to the assertion that sigma(n) < exp(H_n) log(H_n) for n > 60.

en · official · sha256:d922015722abff8e6bbbd0ac74baec27c270e43fb8e6fbbe90b48e3eabf99784EN

Lemma 3.1. For n >= 3, exp(H_n) log(H_n) >= e^gamma n log log n . (3.3)

en · official · sha256:9f79513e1b67b021c0f96909bdbaf865bd4a572a5a38da93dc6fc1ba5e7cb478EN

Lemma 3.2. For n >= 3, H_n + exp(H_n) log(H_n) <= e^gamma n log log n + (4n)/(log n) . (3.7)

en · official · sha256:0d5a4d4f41c2b0fc3280c69797cc1cfc493fa549a94a8e9226cc4b344241e517EN

Problem E. Let H_n = sum_{j=1}^n 1/j. Show that, for each n >= 1, sum_{d|n} d <= H_n + exp(H_n) log(H_n), (1.1) with equality only for n = 1.

Ссылаются нормы: ProblemEEqualityCaseNEqualsOne, ProblemEHoldsForInstance, ProblemEUniversalClaim, ProblemEViolatedForInstance, harmonic-1-is-one, harmonic_number_is_one, lagarias-asserts-problem-e, problem_e_holds_for, problem_e_rhs_lower_bound, problem_e_rhs_upper_bound, problem_e_violated_for, rhs-hi-5040, rhs-hi-5041, rhs-hi-55440, rhs-hi-6, rhs-hi-60, rhs-lo-5040, rhs-lo-5041, rhs-lo-55440, rhs-lo-6, rhs-lo-60, sigma-1, sigma-5040, sigma-5041, sigma-55440, sigma-6, sigma-60, sigma_of_n

en · official · sha256:a84c8b18b7eab63dd402d3096e166d7e59550194234f1d07f2fb79676c5e3dcfEN

Proof of Theorem 1.1. (<=) Suppose the Riemann hypothesis is true. Then Theorem 3.1 and Lemma 3.1 together give, for n >= 5041, sum_{d|n} d <= e^gamma n log log n < H_n + exp(H_n) log H_n. For 1 <= n <= 5040 one verifies (1.1) directly by computer, the only case of equality being n = 1. (=>) Suppose (1.1) holds for all n. We argue by contradiction, assuming that the Riemann hypothesis is false. Then Theorem 3.2 applies. However its lower bound (which is valid for infinitely many n) contradicts the upper bound of Lemma 3.2 (which holds for all sufficiently large n). We conclude that the Riemann hypothesis must be true.

Ссылаются нормы: verified-direct-1, verified-direct-5040, verified-direct-6, verified-direct-60, verified_by_direct_computation

en · official · sha256:108e905a65c9305a91ca1f6946018d7b304f252d840021f73774bb5882979da3EN

The Riemann hypothesis, stated by Riemann [21] in 1859, concerns the complex zeros of the Riemann zeta function. The Riemann zeta function zeta(s) is defined in the half-plane Re(s) > 1 by the convergent Dirichlet series zeta(s) = sum_{n=1}^infinity n^(-s) and is extended by analytic continuation to the complex plane, where it has one singularity; namely, a simple pole with residue 1 at s = 1. The Riemann hypothesis states that the nonreal zeros of the Riemann zeta function zeta(s) all lie on the line Re(s) = 1/2.

en · official · sha256:b83c8996f75c7ff2ce0429d8ef812fc03ed2871bb1d06473810d291da22b4589EN

Robin's criterion states that the Riemann hypothesis is true if and only if sigma(n) < e^gamma n log log n for all n >= 5041, (1.2) where gamma ~ 0.57721 is Euler's constant. This criterion is related to the density of primes, as explained in Section 2.

Ссылаются нормы: RobinCriterionAsPresentedByLagarias, attributed_to, lagarias-presents-robin, robin-attribution, robin-iff-rh

en · official · sha256:44e32d8d03ab5cd1bc564ed53830bcd1e34bf2410c2b98bdbfe2c388868d89a5EN

Theorem 1.1 Problem E is equivalent to the Riemann hypothesis.

Ссылаются нормы: problem-e-iff-rh

en · official · sha256:bc96541d5b627fd1a986842b089147f24a2faacd6ca34d039ec718d951447e48EN

Theorem 3.1 (Robin). If the Riemann hypothesis is true, then for each n >= 5041, sum_{d|n} d <= e^gamma n log log n , (3.1) where gamma is Euler's constant.

en · official · sha256:ad3e04d483216de72922668546cd970619d7006d68f4772c636ce616845ca1ebEN

Theorem 3.2 (Robin). If the Riemann hypothesis is false, then there exist constants 0 < beta < 1/2 and C > 0 such that sum_{d|n} d >= e^gamma n log log n + (C n log log n)/((log n)^beta) (3.2) holds for infinitely many n.

en · official · sha256:0f4b985846f0fc3c9a024277e58d4c315d623b54976b6e255c5fca3bde673e35EN

An Elementary Problem Equivalent to the Riemann Hypothesis Jeffrey C. Lagarias (July 29, 2001 version)

Ссылаются нормы: LagariasSource