Primality Testing: Pseudoprimes
Given an integer n, it is easy enough to construct a test that will certify the primality of n. If n is not prime then it must be a prime factor no larger than √ n so that the test of primality of n is to see if n is divisible by any prime smaller than √ n. This is completely impractical as soon as n becomes large.