I note that checking for Fermat pseudoprime(base 2) from Mod(2,n)^n takes long time and is almost two times than checking for strong pseudoprime test using BPSW test by ispseudoprime() function . Can it be commented and some function to test Fermat pseudoprime (base 2) if not faster than atleast equal to ispseudoprime() function which checks for strong pseudoprime test using BPSW test is required in GP pari package.