Check out an academics assignments in which the reader must prove that the numbers 29,341, 172,081, and 278,545 are Carmichael numbers.

Have a look at this academics resource which provides a summary of known searches for primes in the form n!/k+-1 (with k>1), n!/k!+-1 (k>3), and n!/n#+-1.

Chapter headings for this essay include "Finding Very Small Primes," "N-1 Tests," "Neoclassical Tests," and "Using Elliptic Curves."

Check out this resource which provides an extensive graph of Woodall primes and equations. Author includes selected recommended reading materials.

Author provides an extensive essay which shows the smallest base required to prove a number is prime. Includes references and a list of selected resources.

Mathematics expert offers an explanation of the mathematics behind the N-1 primality testing algorithm.

Author provides papers discussing subjects like recent developments in primality testing, Frobenius pseudoprimes, and Carmichael numbers.

Author offers a graph of multifactorial primes, suggested glossary resources, and a list of the top primorial and factorial primes.