this method or algorithm takes too long to find very large prime numbers. however, it is less complicated than methods used for very large primes, such as fermat's primality test (a test to see whether a number is prime or not) and the miller-rabin primality test.