Your expression simplifies to k.n.n!+1. Why not ditch the extra n and search for k.n!+1? Anyways...
Are you doing any sieving?
I am not aware of anything faster than regular PRP tests (PFGW can do that). PFGW can also prove the primality with a -tm argument.
|