Robin's inequality for 11-free integers
Broughan, K. A., & Trudgian, T. (2015). Robin’s inequality for 11-free integers. Integers : Electronic Journal of Combinatorial Number Theory, 15.
Permanent Research Commons link: https://hdl.handle.net/10289/11397
Let σ(n) denote the sum of divisors function, and let ϒ be Euler’s constant. We prove that if there is an n≥5041 for which σ(n)≥eϒn log log n, then n must be divisible by the eleventh power of some prime.
State University of West Georgia, Charles University, and DIMATIA
© 2015 copyright with the authors.