On Odd Perfect, Quasiperfect, and Odd Almost Perfect Numbers

DOI10.2307/2007662zbMath0472.10007OpenAlexW4254467539WikidataQ56226107 ScholiaQ56226107MaRDI QIDQ3926665

Masao Kishore

Publication date: 1981

Full work available at URL: https://doi.org/10.2307/2007662

zbMATH Keywords

odd perfect numberquasiperfect numbersodd almost perfect numbersupper bounds for smallest prime factors

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25)

Related Items (7)

Sieve methods for odd perfect numbers ⋮ On the number of distinct prime factors of an odd perfect number ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On quasi-imperfect numbers with at most four distinct prime divisors ⋮ Odd perfect numbers have at least nine distinct prime factors

Cites Work

• Unnamed Item
• Multiply perfect numbers, Mersenne primes, and effective computability
• Über ungerade vollkommene Zahlen
• On the Largest Prime Divisor of an Odd Perfect Number. II
• Odd Integers N with Five Distinct Prime Factors for which 2 - 10 -12 < σ(N)/N < 2 + 10 -12

This page was built for publication: On Odd Perfect, Quasiperfect, and Odd Almost Perfect Numbers