1. On the primality of n! � 1 and 2 � 3 � 5 � � � � � p � 1;C K Caldwell;Math. Comp,2002
2. Beyond Rogers' non-constructively computable function, in: The nature of computation;J Case,2013
3. An upper bound for the number of reachable positions;S Chinchalkar;J. Int. Comput. Games Assoc,1996
4. The twenty-second Fermat number is composite;R Crandall;Math. Comp,1995
5. The twenty-fourth Fermat number is composite;R Crandall;Math. Comp,2003