Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_05_04_turturean: A manuscript posted to the thread proves that the least prime 1 mod n equals the least m with n | phi(m) on a set of positive lower density, answering the first two questions no; pending.
2026_09_23_turturean: A forum claim asserts that the least prime 1 mod n equals the least m with n | phi(m) on a set of positive lower density, refuting the first two questions, and that uniqueness primes number >> X/(log X)^55; pending.
Linked from (1)
Graph