This program verify if a given integer is a prime number or not. If the integer is not a prime number then its a composite number (a number that has factors other than 1 and itself).
Direct search factorization is the method employed here due to its straitghtforwardness for small numbers search. This method systematically divides the number until a factor is found or the search ceiling limit is reached.
The search stops when the algorithm finds a factor.
The following numbers are not evaluated.