On the Density of Spoof Odd Perfect Numbers
Abstract
We study the set S of odd positive integers n with the property 2n/σ(n) - 1 = 1/x, for positive integer x, i.e., the set that relates to odd perfect and odd "spoof perfect" numbers. As a consequence, we find that if D=pq denotes a spoof odd perfect number other than Descartes' example, with pseudo-prime factor p, then q>1012. Furthermore, we find irregularities in the ending digits of integers n∈S and study aspects of its density, leading us to conjecture that the amount of numbers in S below k is 10 (k).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.