Prevent this user from interacting with your repositories and sending you notifications.
Learn more about blocking users.
You must be logged in to block users.
Contact GitHub support about this user’s behavior.
Learn more about reporting abuse.
Fast codes to find Wilson primes (p prime for that (p-1)!==-1 mod p^2). With current pw13.c code we have found that up to 2e13 there is no new Wilson prime, only the known 5, 13, 563.
Make a menu using many restrictions. The built (integer) linear optimization program is solved with Glpk.
See https://en.wikipedia.org/wiki/Euler%27s_sum_of_powers_conjecture .
Seeing something unexpected? Take a look at the
GitHub profile guide.