If somebody want to test that k,n value is an octoproth ( not just the numbers are 3prp numbers ). Then here it is a PARI program:
f(k,n)=a=[1,1,2,2,k,k,2*k,2*k];b=[k,k,k,k,1,1,1,1];test=1;for(i=1,8,if(isprime(a[i]*2^n+b[i]),,test=0;break));\
print1("This is");if(test==0,print1(" not"));print1(" an octoproth.")
Try it for example: f(2482746958136235,183) This will give you :
This is an octoproth.
How it looks like my new avatar?
ps.This octoproth has been found by Robert44444uk
You can also find on page2 an openpfgw program for this.
Last fiddled with by R. Gerbicz on 20060112 at 20:31
