| CARVIEW |
Select Language
HTTP/2 200
date: Wed, 31 Dec 2025 00:25:31 GMT
content-type: text/html; charset=utf-8
nel: {"report_to":"cf-nel","success_fraction":0.0,"max_age":604800}
vary: Accept-Encoding
cache-control: no-store, max-age=0
pragma: no-cache
expires: 0
x-clacks-overhead: GNU Terry Pratchett
report-to: {"group":"cf-nel","max_age":604800,"endpoints":[{"url":"https://a.nel.cloudflare.com/report/v4?s=VL0s%2FSDu43B4TcjmT%2B0YT1aubIs48sgew%2FD%2Fs1L%2BzpTHVO8oTMxHxBT%2F0UuzcEIJUeWk4ZCPUinG2qKvD%2BURg5IB3gHpldYZUfuYTm0GEHVe%2BnXAUQ%3D%3D"}]}
server: cloudflare
cf-cache-status: DYNAMIC
content-encoding: gzip
cf-ray: 9b65a3e18e9d85cf-BOM
alt-svc: h3=":443"; ma=86400
Erdős Problem #418
PROVED (LEAN)
This has been solved in the affirmative and the proof verified in Lean.
Are there infinitely many positive integers not of the form $n-\phi(n)$?
Asked by Erdős and Sierpiński. Numbers not of the form we call non-cototients. It follows from the Goldbach conjecture that every odd number can be written as $n-\phi(n)$. What happens for even numbers?
Browkin and Schinzel [BrSc95] provided an affirmative answer to this question, proving that any integer of the shape $2^{k}\cdot 509203$ for $k\geq 1$ is a non-cototient. It is open whether the set of non-cototients has positive density.
Erdős [Er73b] has shown that a positive density set of natural numbers cannot be written as $\sigma(n)-n$ (numbers not of this form are called nonaliquot, or sometimes untouchable). Banks and Luca [BaLu05] have proved that the set of nonaliquots has lower density $\geq 1/48$. This bound was improved to $0.06$ by Chen and Zhao [ChZh11]. Pollack and Pomerance [PoPo16] give a heuristic that predicts the density exactly (with a value of $\approx 0.17$).
This is discussed in problem B36 of Guy's collection [Gu04].
Browkin and Schinzel [BrSc95] provided an affirmative answer to this question, proving that any integer of the shape $2^{k}\cdot 509203$ for $k\geq 1$ is a non-cototient. It is open whether the set of non-cototients has positive density.
Erdős [Er73b] has shown that a positive density set of natural numbers cannot be written as $\sigma(n)-n$ (numbers not of this form are called nonaliquot, or sometimes untouchable). Banks and Luca [BaLu05] have proved that the set of nonaliquots has lower density $\geq 1/48$. This bound was improved to $0.06$ by Chen and Zhao [ChZh11]. Pollack and Pomerance [PoPo16] give a heuristic that predicts the density exactly (with a value of $\approx 0.17$).
This is discussed in problem B36 of Guy's collection [Gu04].
This page was last edited 08 December 2025.
External data from the database - you can help update this
Formalised statement? Yes
Related OEIS sequences: A005278 A263958
Formalised statement? Yes
Related OEIS sequences: A005278 A263958
9 comments on this problem
| Likes this problem | None |
| Interested in collaborating | None |
| Currently working on this problem | None |
| This problem looks difficult | None |
| This problem looks tractable | None |
Additional thanks to: Stefan Steinerberger and Wouter van Doorn
When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:
T. F. Bloom, Erdős Problem #418, https://www.erdosproblems.com/418, accessed 2025-12-31
When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:
T. F. Bloom, Erdős Problem #418, https://www.erdosproblems.com/418, accessed 2025-12-31
