Erdős problem 479 · problems.science

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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/479.lean

Formal Conjectures

FormalConjectures/ErdosProblems/479.leanErdos479.erdos_4791 lineExact file

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

OpenStatement only, no proof