← All problems

Erdős Problem #470 — Odd and primitive weird numbers

46 years old · traced to

For a positive integer nn, let σ(n)=∑d∣nd\sigma(n)=\sum_{d\mid n}d and let D(n)={d∈Z>0:d∣n, d<n}D(n)=\{d\in\mathbb Z_{>0}:d\mid n,\ d<n\} be its set of positive proper divisors. Call nn weird if its divisor sum is at least twice nn, but no subset of its proper divisors sums to nn:

σ(n)≥2nand∀E⊆D(n), ∑d∈Ed≠n.\sigma(n)\ge 2n \quad\text{and}\quad \forall E\subseteq D(n),\ \sum_{d\in E}d\ne n.

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 2n2n. Weirdness adds a subset-sum obstruction—no selection of proper divisors attains nn—so abundant numbers need not be weird. The smallest weird number is 70=2⋅5⋅770=2\cdot5\cdot7. 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 NN is weird and pp is prime with p>σ(N)p>\sigma(N), then pNpN 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).

Source: 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

Never refreshed

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.