The almost mystical regard for perfect numbers is as old as the mathematics concerning them (Hoffman, 2000; 1998). Indeed Pythagoras saw perfection in any integer that equaled the sum of all the other integers that divided evenly into it (Hoffman, 2000; 1998). More precisely, a perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. The first perfect number is 6. Indeed 6 has divisors 1,2 and 3 (excluding itself), and , so 6 is a perfect number [note 28 and 496 and 33550336 are also perfect numbers (Dickson, 1919; Annouk, 2012a; 2012b; 2013; 2014; Hoffman, 2000; 1998; Yamada, 2019). Perfect numbers are known for some integers > 33550336 and the perfect numbers problem states that there are infinitely many perfect numbers. In this paper, we state a simple conjecture whose validity immediately implies the short proof of the perfect numbers problem via the reasoning by reduction to absurd on perfect numbers.
Ikorong Annouk (Wed,) studied this question.