Quote:
Originally Posted by R. Gerbicz
That is just painful. I mean the ecpp proof for the hard number when you have a much cheaper way, searching a better form.
Don't need to run two variables, fix u, then run v in arithmetic progression. Use sieving.

Exactly! This new thingy completely misses the precious beauty of
Ken Davis' construction.
Surely now, 10 years later, one can repeat Ken's trick to find a couple 40,000digit sexy primes.
I added a little
friendly competition thread. Have some fun!