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. We also bound the abundancy indices of Nrad(N) and N/rad(N) and the functions σ±, φ+ and ψ+ of S\'andor and Atanassov at N, and we bound the number k of distinct prime factors of N from below in terms of its least prime factor. If p1<⋯<pk are the prime factors of N and mi is the part of N composed of p1,…,pi−1, then pi<2+2(k−i+1)I(mi)2/(4−I(mi)2), where I(n)=σ(n)/n; in particular p1<2k/3+2. For a quasiperfect number N we prove that ∑p∣N1/p<logI(N), that p4∣N for every prime factor p≡3(mod8) and p6∣N for every prime factor p≡5(mod8), that rad(N)≤N1/2, with rad(N)≤N1/2/3 if 3∣N, and that two quasiperfect numbers differ by more than 4⋅1035/2. Assuming the ABC conjecture, rad(σ(N))≥cεN1/2−ε, only finitely many pairs of an even perfect number and a quasiperfect number lie at a given distance, and no three perfect or quasiperfect numbers lie in an interval of fixed length infinitely often. 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 or quasiperfect number N.
Primarily AI-generated textHuman understanding: all partsEuler totient functionabc conjectureabundancy indexdivisor sum functionodd perfect numbersprime factorizationquasiperfect numbersradical