Skip to content

Erdős problem 418

Are there infinitely many integers not of the form n−ϕ(n)n - \phi(n)?

Sources

The source's own material, retained exactly.

5 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

418.lean

Retained formal statement1 of 5

Are there infinitely many integers not of the form n−ϕ(n)n - \phi(n)?

Asked by Erdős and Sierpiński. Numbers not of the form we call non-cototients.

Browkin and Schinzel [BrSc95] provided an affirmative answer to this question, proving that any integer of the shape 2k⋅5092032^{k}\cdot 509203 for k≥1k\geq 1 is a non-cototient.

This is discussed in problem B36 of Guy's collection [Gu04].

This was formalized in Lean by Alexeev using Aristotle.

FormalConjectures/ErdosProblems/418.leanErdos418.erdos_4181 lineExact file
True ↔ {x | ∃ n, n - n.totient = x}ᶜ.Infinite
SolvedProof has a holelean4external proof

The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.