Buy Me a Coffee at ko-fi.com

Seventeen or bust

volunteer computing project to find the smallest number k for which k2^n+1 is always composite

Pronunciation
/ˈsɛvənˌtin ɔr bəst/
/sɛvənˈtiːn ɔː bʌst/
Categories
project