Abstract

Robin’s criterion states that the Riemann hypothesis is true if and only if the inequality (\sigma (n) < e^{\gamma } \times n \times \log \log n) holds for all natural numbers (n > 5040), where (\sigma (n)) is the sum-of-divisors function of n and (\gamma \approx 0.57721) is the Euler–Mascheroni constant. We show that the Robin inequality is true for all natural numbers (n > 5040) that are not divisible by some prime between 2 and 1771559. We prove that the Robin inequality holds when (\frac{\pi {2}}{6} \times \log \log n’ \le \log \log n) for some (n>5040) where (n’) is the square free kernel of the natural number n. The possible smallest counterexample (n > 5040) of the Robin inequality implies that (q_{m} > e{31.018189471...

Similar Posts

Loading similar posts...

Keyboard Shortcuts

Navigation
Next / previous item
j/k
Open post
oorEnter
Preview post
v
Post Actions
Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Recommendations
Add interest / feed
Enter
Not interested
x
Go to
Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Browse
gb
Search
/
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help