Erdős Problem #470 — Odd and primitive weird numbers
For a positive integer , let and let be its set of positive proper divisors. Call weird if its divisor sum is at least twice , but no subset of its proper divisors sums to :
A weird number is primitive if none of its proper divisors is weird. Erdős Problem #470
The questions are: (1) does there exist an odd weird positive integer? (2) are there infinitely many primitive weird positive integers? Erdős Problem #470
Background
The divisor-sum condition is the abundance threshold: the sum of all divisors is at least . Weirdness adds a subset-sum obstruction—no selection of proper divisors attains —so abundant numbers need not be weird. The smallest weird number is . Benkoski introduced the notion, and Benkoski and Erdős studied weird and pseudoperfect numbers; they proved that weird numbers have positive density. Fang (2022 preprint) Benkoski and Erdős (1974)
A useful construction behind the primitive-number question is that if is weird and is prime with , then is also weird. This produces further weird numbers from a given one, but does not by itself show that infinitely many of them have no weird proper divisor; that minimality requirement is the additional issue in the second question. Fang (2022 preprint)
References
Erdős, P. and Graham, R., Old and new problems and results in combinatorial number theory. Monographies de L'Enseignement Mathématique 28 (1980).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.