1. Opracowały: Małgorzata Macior Martyna Owoc

2. What is a prime number ? DEFINITION: A natural number p ≥2 is called prime if and only if the only natural numbers which divide p are 1 and p. A natural number n>1 which is not prime is called composite. Thus, n>1 is composite if n=ab where a and b are natural numbers with 1<a,b<n.

3. Some first prime numbers : 2, 3, 5, 7, 11, 13, 17, 19, … Euklides, about 365-300 B.C. Euklides proved, that the set of prime numbers is infinite. He used a proof by contradiction.

4. To find all the prime numbers less than or equal to a given natural number n, Continue until all numbers less than or equal to √n have been circled or crossed out. list all the integers from 2 to n, Circle 2 and then cross out all multiples of 2 in the list, Circle 3, the first number not yet crossed out or circled, and then cross out all multiples of 3, Circle 5, the first number not yet crossed out or circled, and then cross out all multiples of 5, At the general stage, circle the first number which is neither crossed out nor circled and cross out its multiples,

6. Properties of Prime Numbers THE N 2 + 1 CONJECTURE There are infinitely many primes of the form N 2 +1. INFINITELY MANY PRIMES THEOREM There are infinitely many prime numbers. THE TWIN PRIMES CONJECTURE There are infinitely many prime numbers p such that p+2 is also prime.

7. GOLDBACH’S CONJECTURE Every even number n≥4 is a sum of two primes. Given any natural number n>1, there exists prime p such that p|n. If a natural number n>1 is not prime, then n is divisible by some prime number p≤√n.

8. TYPES OF PRIMES Mersenne Primes Twin Primes Quadruple Primes Isolated Primes Mirror Primes Sophie Germain Primes Fermat Primes

9. TYPES OF PRIMES Mersenne Primes If a n -1 is prime for some numbers a≥2 and n≥2, then a must equal 2 and n must be a prime. Primes of the form 2 p -1 are called Mersenne primes. The first few Mersenne primes are: 2 2 -1 =3, 2 3 -1=7, 2 5 -1=31.

10. Twin Primes Two prime numbers the difference of which is two, are called twin primes. Examples of pairs of twin primes: (3, 5) (5, 7) (59, 61)

11. Prime quadruplet A prime quadruplet is a set of four primes of the form {p, p+2, p+6, p+8}. For instance: 5, 7, 11, 13 821, 823, 827, 829

12. Isolated Primes A prime number is called isolated when the nearest prime number differentiates by at leat 4.

13. Mirror Primes Two prime numbers are called mirror primes if one is obtained from the other by reversing its digits. Examples: 13 and 31 17 and 71

14. Sophie Germain Primes A prime number p is a Sophie Germain prime if 2p + 1 is also prime. The number 2p + 1 associated with a Sophie Germain prime is called a safe prime. For example, 29 is a Sophie Germain prime and 2 × 29 + 1 = 59 is its associated safe prime.

15. Fermat primes Another interesting class of prime numbers is the set of so- called Fermat primes, this being prime numbers of the form 2 2 n + 1. For n=0,1,2,3,4, indeed 2 2 n + 1 is prime. F 0 = 2 1 + 1 = 3 F 1 = 2 2 + 1 = 5 F 2 = 2 4 + 1 = 17 F 3 = 2 8 + 1 = 257

16. Counting Primes The Prime Number Theorem When x is large, the number of primes less than x is approximately equal to x/ln(x). In other words, Where π(x)=#{primes p with p≤x}

17. Curosity 1 In 1914, American mathematician, Derrick Norman Lehmer published for the first time a list of all 664,579 primes less than 10 million. He created this list using the sieve of Eratosthenes. Curosity 2 11111111111111111111111- number consisting of 23 ones is a prime number.

18. Curosity 3 The number 31415926535897932384626433832795028841 formed from the first 38 digits of the decimal expansion of the number ∏ is prime.

19. Bibliography Edgar G. Goodaire, Michael M. Parmenter, Discrete Mathematics with graph Theory, Memorial University of Newfoundland Prentice Hall, Upper Saddle River Joseph H. Silverman, A Friendly Introduction to Number Theory, Brown University, Prentice Hall, Upper Saddle River http://www.liczbypierwsze.com/ https://www.wikipedia.org/