Erdős Problem #470 — An integer nn has been called weird [Ben-Er (74)] if σ(n)n⩾2\frac{\sigma(n)}{n} \geqslant 2 and n≠d1+...+dkn \neq d_1 + ... + d_k where the did_i are distinct proper divisors of nn.

About 46 years old · traced to

An integer nn has been called weird [Ben-Er (74)] if σ(n)n⩾2\frac{\sigma(n)}{n} \geqslant 2 and n≠d1+...+dkn \neq d_1 + ... + d_k where the did_i are distinct proper divisors of nn. Are there any odd weird numbers? Are there infinitely many primitive weird numbers, i.e., so that no proper divisor of nn is weird?

References

Additional 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

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.