Spoof odd perfect numbers

DOI10.1090/S0025-5718-2013-02793-7zbMath1370.11005OpenAlexW2077348170WikidataQ114093829 ScholiaQ114093829MaRDI QIDQ3189439

Samuel J. Dittmer

Publication date: 10 September 2014

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2013-02793-7

zbMATH Keywords

abundantperfect numberdeficientspoof

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Diophantine equations in many variables (11D72) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Other number representations (11A67) Generalized primes and integers (11N80)

Related Items (3)

Perfect and Deficient Perfect Numbers ⋮ Odd, spoof perfect factorizations ⋮ Odd perfect numbers, Diophantine equations, and upper bounds

Cites Work

• Odd perfect numbers have at least nine distinct prime factors
• Odd perfect numbers
• Odd perfect numbers, Diophantine equations, and upper bounds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spoof odd perfect numbers