hi,

This study presents a new primer number finding algorithm,a prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.A natural number greater than 1 that is not a prime number is called a composite number,in this study we’ll build an algorithmthat can find all the consecutive prime numbers in a given interval, we’ll se testing examples , in the second part of this study we’ll prove the twin prime numbers conjecture and give an equation that can find percentage of prime numbers in given intervalthe file contains 13 pages in PDF format , it can be downloaded below.

the second file presents a prove of GoldBach conjecture which is one of the oldest and best-known unsolved problems in number theory and in all of mathematics.It states:Every even integer greater than 2 can be expressed as the sum of two primes.In this study I’ll prove that this conjecture is true.

twin-prime-conjecture-Resolved

goldbach-conjecture-resolution

### Like this:

Like Loading...