Trial division is 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.
Trial Division
See also
Direct Search Factorization, Division, Prime FactorizationExplore with Wolfram|Alpha
References
Flannery, S. and Flannery, D. In Code: A Mathematical Journey. London, England: Profile Books, pp. 36-37, 2000.Referenced on Wolfram|Alpha
Trial DivisionCite this as:
Weisstein, Eric W. "Trial Division." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TrialDivision.html