Some Results on Fermat's Theorem and Trial Division Method

Abstract

Abstract
An integer n>1 is called "Prime" if it has no other positive divisors than 1 and itself
(within the set of integers), other wise n is said to be a” composite".
Prime numbers are very important in today's society. The methods that determine,
if a particular integer is prime or composite, are called primarily testing. This paper discusses
and writes the algorithms for primarily testing. Also, new theorems has been obtained for
primarily tests, and been used as a test as in the "trial division" method and "Fermat's
theorem". A computer program has been built, and been operating using (" MATLAB 7").