Spoof odd perfect numbers

DOI10.1090/S0025-5718-2013-02793-7MaRDI QIDQ3189439zbMATH OpenOpenAlexWikidataFDO

Authors 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

abundantdeficientperfect numberspoof

Mathematics Subject Classification ID

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

Recommendations

• Odd, spoof perfect factorizations
• Descartes numbers.
• Perfect and Deficient Perfect Numbers
• On the number of distinct prime factors of an odd perfect number

Cites work

• scientific article; zbMATH DE number 5903090 (Why is no real title available?)
• scientific article; zbMATH DE number 1303171 (Why is no real title available?)
• scientific article; zbMATH DE number 2124064 (Why is no real title available?)
• Odd perfect numbers
• Odd perfect numbers have at least nine distinct prime factors
• Odd perfect numbers, Diophantine equations, and upper bounds
• Relevant astronomical studies of the theory of perturbation. Part 2. Edited by Andreas Verdun

Cited in

(5)

• Odd, spoof perfect factorizations
• Descartes numbers.
• Odd perfect numbers, Diophantine equations, and upper bounds
• Perfect and Deficient Perfect Numbers
• Spoof Lehmer factorizations

This page was built for publication: Spoof odd perfect numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189439)