Primeshard
0:00.0

Find the smallest prime p such that p | 2^(p-1) - 1 is false (i.e., a Wieferich prime).