1966/01/01 by Joseph B. Muskat · 12 citations
Mathematics · #Advanced Mathematical Theories #Analytic Number Theory Research #Combinatorics #Discrete mathematics #Divisor (algebraic geometry) #Divisor function #Integer (computer science) #Mathematics #Mathematics and Applications #Perfect number #Perfect power
paper · pdf · doi:10.1090/s0025-5718-1966-0186617-9
published in Mathematics of Computation 20(93), 141-144 (American Mathematical Society)
crossref issued 1966/01/01 · crossref published 1966/01/01 · crossref published-print 1966/01/01 · openalex publication_date 1966/01/01 · crossref created 2010/06/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/03/11 · crossref deposited 2026/04/20 · crossref indexed 2026/04/21
A perfect number is a positive integer the sum of whose divisors is equal to twice the number itself. Twenty-three even perfect numbers have been discovered to date [2]. No odd perfect number has yet been found, but various restrictions which an odd perfect number must satisfy have been established. For a summary, see [7]. For a perfect number n, a(n) = 2n, where a(n) denotes the sum of the divisors of n. Let