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:
“Traditional scientific method has always been at the very best 20-20 hindsight. Its good for seeing where youve been. Its good for testing the truth of what you think you know, but it cant tell you where you ought to go.”
—Robert M. Pirsig (b. 1928)