Primality test - Wikipedia
https://en.wikipedia.org/wiki/Primality_testThe simplest primality test is trial division: given an input number, n, check whether it is evenly divisible by any prime number between 2 and √n (i.e. that the division leaves no remainder). If so, then n is composite. Otherwise, it is prime. For example, consider the number 100, which is evenly divisible by these numbers: 2, 4, 5, 10, 20, 25, 50
Prime Curios! A Primality Test
https://primes.utm.edu/curios/includes/primetest.phpA Primality Test. Do you have an integer you would like to test for primality? If it is small (say less than 9007199254740991 = 2 53 - 1), then try this script: For larger numbers try Dario Alpern's exceptional on-line routine to factor and prove primality . Other useful links include. The Prime Glossary's definition: Probable-Prime.