On the representation of the prime numbers

In this thesis, to comprehend better the prime numbers which have been an attraction for the mathematicians in every era, the dissertation and thesis archives are scanned and formulas and demonstrations of prime numbers are thoroughly mentioned. Primeness tests and discovery of prime numbers is of great importance in terms of cryptology and cryptoanalysis. Numerous demonstrations of prime numbers have been mentioned in this thesis. With the help of these demonstrations it is possible to discover new prime numbers. As is known, in line with the fundamental theorem of arithmetics, all numbers can be demonstrated as the force multipliers of prime numbers. In this thesis, formulas depicting each p prime number either as the force multiplication sum or difference of every prime number smaller than √P in two groups used 〖19〗^2 =361 all prime numbers are calculated. Key words: Number Theory, Cryptology, Prime Numbers, Prime Number Formulas