In 1984, Robin showed that the Riemann Hypothesis is equivalent to proving a particular upper bound on the sum of divisors function. This code calculates a lower bound in terms of the primorial numbers, above which Robin's inequality holds for t-free integers, that is, integers not divisible by the t-th power of any prime number.
-
Notifications
You must be signed in to change notification settings - Fork 0
Calculate a lower bound for the success of Robin's inequality on t-th power free integers
License
tsmorrill/t-free-Robin-s-inequality
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Calculate a lower bound for the success of Robin's inequality on t-th power free integers
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published