2009/12/30 by Yu Tsumura, Tsumura, Yu
Computer Science · Mathematics · #11A25 #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Overview (math.HO) #Mathematical and Theoretical Analysis #Number Theory (math.NT) #math.HO #math.NT #msc:11A25
paper · pdf · doi:10.48550/arxiv.0912.5504
3 pages
arxiv created 2009/12/30 · openalex publication_date 2009/12/30 · arxiv updated 2010/01/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A positive integer n is said to be perfect if sigma(n)=2n, where sigma denotes the sum of the divisors of n. In this article, we show that if n is an even perfect number, then any integer m<=n is expressed as a sum of some of divisors of n.