math.NT — Number Theory
Contributed by Frank Vega
Let N be an odd perfect number or a quasiperfect number, and let B(N)=∏p∣N(1+1/p). We prove that 2<N/φ(N)<2.17372 and that 105∤N, and we obtain explicit two-sided bounds for B(N) according to the value of gcd(15,N). For an odd perfect number N, they give B(N)>1.90281, 1.70584, 1.83233 and 1.67856 when gcd(15,N)=1, 3, 5 and 15, respectively, and B(N)<1.84348, 1.93549 and 1.84125 when gcd(15,N)=3, 5 and 15. These follow from general bounds for B(n) in terms of n/φ(n), of the abundancy index I(n)=σ(n)/n, and of ∑p∣n1/p. We also bound the abundancy indices of Nrad(N) and N/rad(N) and the functions σ±, φ+ and ψ+ of S\'andor and Atanassov at N, give an explicit lower bound for the number of distinct prime factors of N in terms of its least prime factor, and show that the sum of the reciprocals of the prime factors of a quasiperfect number N is less than logI(N). Finally, for the shifted abundancy indices I+(n)=1+∑d∣n,d>11/(d+1) and I−(n)=1+∑d∣n,d>11/(d−1), we determine the optimal constants in the comparisons of I+, I and I− on the odd integers and on the odd integers with at most one odd exponent, and we deduce 1.8471<I+(N)<2<I−(N)<2.2722 and I−(N)−I+(N)<0.42493 for every odd perfect number N.
Primarily AI-generated textHuman understanding: all partsEuler totient functionabundancy indexdivisor sum functionodd perfect numbersprime factorizationquasiperfect numbers