- Better performance in `is_super_psp(n)` and `is_over_psp(n)` for large `n`.
- Better performance in `is_super_psp(n)` and `is_over_psp(n)` for large `n`.

When `n` is a Fermat psp, it can be efficiently factorized using our `_miller_factor(n)` method.

- Code simplifications in Number `is_imprimitive_carmichael(n)`.

trizen/sidef,trizen/sidef,trizen/sidef,trizen/sidef