Math Help Forum: Fermat pseudoprime

For the 1st one, its easy to see that so its definitely not prime.

Also (from observation)

You can also construct a new pseudoprime N using the proposition:

Let b >= 2 (where b is the base of this pseudoprime) and p an odd prime where p does not divide b(b-1)(b+1) then



If someone could review this and check for correctness, that would be great!
Edit: it works fine.