A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. 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.

direct search factorization | division | prime factorization