Trial division is the most laborious but easiest to understand of the integer factorization algorithms. The essential idea is to test whether the integer to be factored can be divided evenly by each number in turn that is less than or equal to its square root. As an example, to find the prime factors of 70 one divides by successive primes: 70 divided by 2 gives 35, neither 2 nor 3 divides 35 evenly, and 35 divided by 5 gives 7, which is itself prime, so 70 equals 2 times 5 times 7. Trial division was first described by Fibonacci in his book Liber Abaci, written in 1202.
Connections
In Field
Source Trial division (Wikipedia)
Uses Design Technique
Source Trial division (Wikipedia)
Sources
Trial division (Wikipedia)
Lead section
Trial division is the most laborious but easiest to understand of the integer factorization algorithms.
Uses Design Technique: Recursion, Article body
When a trial division is successful, the process is applied recursively to the resulting quotient.
In Field: Algorithms and Complexity Theory, Lead
Trial division is the most laborious but easiest to understand of the integer factorization algorithms.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.