Complete characterization of 2-near perfect numbers with exactly 2 prime factors
Abstract
Let σ(n) be the sum of the positive divisors of n. A positive integer n is said to be 2-near perfect when σ(n)=2n+d1+d2, where d1 and d2 are distinct positive divisors of n. We show that there are no odd 2-near perfect numbers with exactly two prime factors, and that all even 2-near perfect numbers (i.e. those of the form 2kpm, where p is an odd prime) belong to a specific family, provided that m is at least 3. In combination with prior work, these results produce a complete characterization of 2-near perfect numbers with exactly 2 prime factors.
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.