Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2025_12_02_tang: Tang's note proves that for every i at least 1 there are infinitely many n with 2^n congruent to 2^i modulo n, settling the cases k = 2^i.
Linked from (1)
Graph