Testing Primality and Integer Factorization
There are various methods to determine whether a given number n is prime. The most basic routine, trial division is of little practical use because of its slowness. One group of modern primality tests is applicable to arbitrary numbers, while more efficient tests are available for particular numbers. Most such methods only tell whether n is prime or not. Routines also yielding one (or all) prime factors of n are called factorization algorithms.
Read more about this topic: Prime Number
Famous quotes containing the word testing:
“No testing has overtaken you that is not common to everyone. God is faithful, and he will not let you be tested beyond your strength, but with the testing he will also provide the way out so that you may be able to endure it.”
—Bible: New Testament, 1 Corinthians 10:13.