![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() |
A brute-force method of finding a Divisor of an Integer by simply plugging in one or a set of
Integers and seeing if they Divide
. Repeated application of trial division to obtain the
complete Prime Factorization of a number is called Direct Search Factorization. An individual integer being
tested is called a Trial Divisor.
See also Direct Search Factorization, Division, Prime Factorization