**13.1 Brute force algorithms**

Brute force algorithms enable enumeration of all integers from 1 to n and establish whether each number is divisible by n to obtain a whole number. With this type of algorithm, direct computation is performed based on a problem statement to be resolved and the corresponding concepts [7]. The search phase for the text can be done randomly. It is an algorithm that is commonly used in the solution of problems such as sorting, searching, and binomial expansion.
