Erdős problem 479

Is it true that, for all $k\neq 1$ , there are infinitely many $n$ such that $2^n\equiv k\pmod{n}$ ?

Sources

The source's own material, retained exactly.

1 retained statement36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

479.lean

Retained formal statement1 of 1

Is it true that, for all $k\neq 1$ , there are infinitely many $n$ such that $2^n\equiv k\pmod{n}$ ?

FormalConjectures/ErdosProblems/479.leanErdos479.erdos_4791 lineExact file

1sorry ↔ ∀ k > 1, {n | 2 ^ n ≡ k [MOD n]}.Infinite

OpenStatement only, no proof