View Single Post
Old 2016-04-02, 01:30   #2
Batalov's Avatar
Mar 2008

31·317 Posts

This is easy to make with a modified NewPgen.
There is a sieve mode for triple sets, but you need to change the multiplier to 6 in the code (then use mode).
It is likely that you can easily find a p with at least 10,000 or 20,000 digits.

The proof of course will not be a problem, because p will be a helper for 6p-1 and 6p+1 regardless of their form.
Batalov is offline   Reply With Quote