Results
2
issues of
Rohan
- The idea is to generate all the divisors of the number `N` and for all divisor check `D` divides `2^D-2`. - If this condition satisfy for all divisors then...
__Super-Poulet__ number is a Poulet number _pseudoprime_ to base 2 if each and every divisor D divides `2^D - 2`