100Mdigit n/k pairs
If you had a program that could complete a primalitytest for a 100Mdigit candidate of the form k*2^n+/1 in ~6 months on a 3.2Ghz quadcore machine, which k and n would you choose?
EDIT: There is a bonus if k has a 2^24th root (mod 2^642^32+1)
Last fiddled with by __HRB__ on 20100522 at 01:24
