Download presentation

Presentation is loading. Please wait.

Published byKelly Todd Modified about 1 year ago

1

2
Prime Time

3
A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and itself. A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and itself. positive integerdivisors positive integerdivisors

4
The number 1 is a special case which is considered neither prime nor composite. Although the number 1 used to be considered a prime, it requires special treatment in so many definitions and applications involving primes greater than or equal to 2 that it is usually placed into a class of its own. The number 1 is a special case which is considered neither prime nor composite. Although the number 1 used to be considered a prime, it requires special treatment in so many definitions and applications involving primes greater than or equal to 2 that it is usually placed into a class of its own.

5
With 1 excluded, the smallest prime is therefore 2. However, since 2 is the only even prime (which, ironically, in some sense makes it the "oddest" prime), it is also somewhat special, and the set of all primes excluding 2 is therefore called the "odd primes." With 1 excluded, the smallest prime is therefore 2. However, since 2 is the only even prime (which, ironically, in some sense makes it the "oddest" prime), it is also somewhat special, and the set of all primes excluding 2 is therefore called the "odd primes." even primeodd primes even primeodd primes

6
The n th prime number is commonly denoted p n, so p 1 = 2, p 2 = 3, and so on, and may be computed in Mathematica as Prime[n]. The n th prime number is commonly denoted p n, so p 1 = 2, p 2 = 3, and so on, and may be computed in Mathematica as Prime[n].Mathematica PrimeMathematica Prime The set of primes is sometimes denoted P. The set of primes is sometimes denoted P.set

7
Euler commented "Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the mind will never penetrate." Euler commented "Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the mind will never penetrate."

8
In a 1975 lecture, D. Zagier commented "There are two facts about the distribution of prime numbers of which I hope to convince you so overwhelmingly that they will be permanently engraved in your hearts. The first is that, despite their simple definition and role as the building blocks of the natural numbers, the prime numbers grow like weeds among the natural numbers, seeming to obey no other law than that of chance, and nobody can predict where the next one will sprout. The second fact is even more astonishing, for it states just the opposite: that the prime numbers exhibit stunning regularity, that there are laws governing their behavior, and that they obey these laws with almost military precision"

9
The fundamental theorem of arithmetic states that any positive integer (greater than 1) can be represented in exactly one way as a product of primes. The fundamental theorem of arithmetic states that any positive integer (greater than 1) can be represented in exactly one way as a product of primes.fundamental theorem of arithmeticpositive integerexactly oneproductfundamental theorem of arithmeticpositive integerexactly oneproduct 12 = 2 2 ·3 12 = 2 2 ·3 96= 96= 299 = 299 =

10
The simplest method of finding factors is so-called "direct search factorization" (a.k.a. trial division). In this method, all possible factors are systematically tested using trial division to see if they actually divide the given number. It is practical only for very small numbers. More general (and complicated) methods include the elliptic curve factorization method and number field sieve factorization method. The simplest method of finding factors is so-called "direct search factorization" (a.k.a. trial division). In this method, all possible factors are systematically tested using trial division to see if they actually divide the given number. It is practical only for very small numbers. More general (and complicated) methods include the elliptic curve factorization method and number field sieve factorization method.direct search factorizationtrial division divide elliptic curve factorization method number field sievedirect search factorizationtrial division divide elliptic curve factorization method number field sieve

11
Sieve of Eratosthenes (who also calculated the circumference of the (round) earth). (who also calculated the circumference of the (round) earth). Pick the first prime. Pick the first prime. –Cross off every multiple of that prime. Pick the next prime (the next number not crossed off). Pick the next prime (the next number not crossed off). –Cross off every multiple thereof Continue ad infinitum Continue ad infinitum Wolfram Demonstration Wolfram Demonstration Wolfram Demonstration Wolfram Demonstration

12
Infinitude of Primes Proved by Euclid, Book IX, proposition 20: Prime numbers are more than any assigned multitude of prime numbers. Proved by Euclid, Book IX, proposition 20: Prime numbers are more than any assigned multitude of prime numbers. Prove by contradiction: Prove by contradiction: Assume P is the largest prime… then multiply: Assume P is the largest prime… then multiply: 2x3x5x7x11x…P. Add 1. 2x3x5x7x11x…P. Add 1. Any divisor will leave a remainder of 1, therefore there is no largest prime P. Any divisor will leave a remainder of 1, therefore there is no largest prime P.

13
Euclid’s Proof Euclid’s Proof Theorem. Theorem. –There are more primes than found in any finite list of primes. Proof. Proof. –Call the primes in our finite list p 1, p 2,..., p r. Let P be any common multiple of these primes plus one (for example, P = p 1 p 2...p r +1). Now P is either prime or it is not. If it is prime, then P is a prime that was not in our list. If P is not prime, then it is divisible by some prime, call it p. Notice p can not be any of p 1, p 2,..., p r, otherwise p would divide 1, which is impossible. So this prime p is some prime that was not in our original list. Either way, the original list was incomplete.

14
Note that what is found in this proof is another prime--one not in the given initial set. There is no size restriction on this new prime, it may even be smaller than some of those in the initial set. Note that what is found in this proof is another prime--one not in the given initial set. There is no size restriction on this new prime, it may even be smaller than some of those in the initial set.

15
Prime Curiosities With the exception of 2 and 3, all primes are of the form p = 6n ± 1, i.e., p = 1, 5(mod6) With the exception of 2 and 3, all primes are of the form p = 6n ± 1, i.e., p = 1, 5(mod6)

16
The function that gives the number of primes less than or equal to a number n is denoted (n) and is called the prime counting function. The theorem giving an asymptotic form for (n) is called the prime number theorem. The function that gives the number of primes less than or equal to a number n is denoted (n) and is called the prime counting function. The theorem giving an asymptotic form for (n) is called the prime number theorem.prime counting function prime number theoremprime counting function prime number theorem

17
(n) and p n are inverse functions, so (p n ) = n for all positive integers and p (n) = n iff n is a prime number. (n) and p n are inverse functions, so (p n ) = n for all positive integers and p (n) = n iff n is a prime number. iff

18
Mersenne Prime A Mersenne prime is a Mersenne number, i.e., a number of the form M n = 2 n – 1 that is prime. A Mersenne prime is a Mersenne number, i.e., a number of the form M n = 2 n – 1 that is prime.Mersenne numberprimeMersenne numberprime In order for M n to be prime, n must itself be prime. This is true since for composite n with factors r and s, n=rs. Therefore, 2 n - 1 can be written as 2 rs - 1, which is a binomial number that always has a factor (2 r – 1). In order for M n to be prime, n must itself be prime. This is true since for composite n with factors r and s, n=rs. Therefore, 2 n - 1 can be written as 2 rs - 1, which is a binomial number that always has a factor (2 r – 1).prime compositebinomial numberprime compositebinomial number The first few Mersenne primes are 3, 7, 31, 127, 8191, corresponding to indices 2, 3, 5, 7, 13, 17, 19, 31, 61, 89,... The first few Mersenne primes are 3, 7, 31, 127, 8191, corresponding to indices 2, 3, 5, 7, 13, 17, 19, 31, 61, 89,...

19
Twin Primes While Hardy and Wright note that "the evidence, when examined in detail, appears to justify the conjecture," and Shanks states even more strongly, "the evidence is overwhelming," Hardy and Wright also note that the proof or disproof of conjectures of this type "is at present beyond the resources of mathematics." While Hardy and Wright note that "the evidence, when examined in detail, appears to justify the conjecture," and Shanks states even more strongly, "the evidence is overwhelming," Hardy and Wright also note that the proof or disproof of conjectures of this type "is at present beyond the resources of mathematics." Arenstorf (2004) published a purported proof of the conjecture. Unfortunately, a serious error was found in the proof. As a result, the paper was retracted and the twin prime conjecture remains fully open. Arenstorf (2004) published a purported proof of the conjecture. Unfortunately, a serious error was found in the proof. As a result, the paper was retracted and the twin prime conjecture remains fully open.

20
Twin Prime Conjecture There are an infinite number of twin primes p, p+2 There are an infinite number of twin primes p, p+2 Sophie Germain primes (p & 2p+1) are closely related. Sophie Germain primes (p & 2p+1) are closely related. The Hardy-Littlewood conjecture states that the number of twin primes x approaches… The Hardy-Littlewood conjecture states that the number of twin primes x approaches… Where 2 is the twin prime constant, ~ Where 2 is the twin prime constant, ~

21
Bertrand’s Postulate For n > 1, there is always one prime p such that n 1, there is always one prime p such that n < p < 2n. Proved independently by Proved independently by –Pafnuty Chebychev –Srinivasa Ramanujan –Paul Erdös

22
The Prime Number Theorem The prime number theorem gives an asymptotic form for the prime counting function (n), which counts the number of primes less than some integer n. The prime number theorem gives an asymptotic form for the prime counting function (n), which counts the number of primes less than some integer n.prime counting functionprimesintegerprime counting functionprimesinteger

23
Gauss ( Gauß ) At age 15 had access to a table (by Lambert) of primes up to a million. Also had a table of logs. Looking at the pair, he said… At age 15 had access to a table (by Lambert) of primes up to a million. Also had a table of logs. Looking at the pair, he said… Primzahlen unter a(=∞) a/la Or, “the number of primes under a (as a approaches infinity) is approximately Or, “the number of primes under a (as a approaches infinity) is approximately

24
Legendre’s Improvement Brought Gauss’s approximation up towards the true number of primes. Brought Gauss’s approximation up towards the true number of primes.

25

26
Logarithmic Integral Gauss later refined his result to Gauss later refined his result to Calculate Li(100) and Li(10,000) Calculate Li(100) and Li(10,000)

27
For small n, it had been checked and always found that (n) < Li(n). As a result, many prominent mathematicians, including no less than both Gauss and Riemann, conjectured that the inequality was strict. To everyone's surprise, this conjecture was refuted when Littlewood (1914) proved that the inequality reverses infinitely often for sufficiently large n. For small n, it had been checked and always found that (n) < Li(n). As a result, many prominent mathematicians, including no less than both Gauss and Riemann, conjectured that the inequality was strict. To everyone's surprise, this conjecture was refuted when Littlewood (1914) proved that the inequality reverses infinitely often for sufficiently large n.inequality

28
Chebyshev put limits on the ratio Chebyshev put limits on the ratioratio

29
Hadamard's proof of the prime number theorem depends on the simple trigonometric inequality Hadamard's proof of the prime number theorem depends on the simple trigonometric inequality

30

31
Distribution of primes Wolfram Demonstration Project: Wolfram Demonstration Project: Distribution of Primes Distribution of Primes Distribution of Primes Distribution of Primes Note that Gauss’ approximation overestimates (n) for small values of n. Note that Gauss’ approximation overestimates (n) for small values of n. Note also the “pattern” of primes in the numeric array at the left. Note also the “pattern” of primes in the numeric array at the left.

32

33
The function (x), the prime-counting function, gives the number of primes less than or equal to x. The plots shown are of the differences between (x) and the approximations to (x) due to Gauss, Legendre, and Riemann.

34
Zeta ( ) Function “The zeta function is probably the most challenging and mysterious object of modern mathematics, in spite of its utter simplicity…The main interest comes from trying to improve the Prime Number Theorem, i.e. getting better estimates for the distribution of the prime numbers.” “The zeta function is probably the most challenging and mysterious object of modern mathematics, in spite of its utter simplicity…The main interest comes from trying to improve the Prime Number Theorem, i.e. getting better estimates for the distribution of the prime numbers.”

35
Zeta ( ) Function (Summation form)

36
Product Form of Zeta Function k p is the p th prime.

37
Riemann Hypothesis Prove the Riemann Hypothesis and win a million bucks! Prove the Riemann Hypothesis and win a million bucks! mann_Hypothesis/ mann_Hypothesis/ mann_Hypothesis/ mann_Hypothesis/ Peter Sarnak’s description Peter Sarnak’s description Peter Sarnak’s description Peter Sarnak’s description

38
Riemann Hypothesis Essentially, the Riemann Hypothesis says that every zero of (s) lies on the line x = ½. Essentially, the Riemann Hypothesis says that every zero of (s) lies on the line x = ½. Song Song Song Another variation says that (1/2 + it)=0 Another variation says that (1/2 + it)=0

39

40
Möbius Function (n) The Zeta function is connected to the Möbius function by the following equation: The Zeta function is connected to the Möbius function by the following equation:

41

42
Quantum Physics & Riemann Zeros In a chance meeting over tea at Princeton, physicist Freeman Dyson and number theorist Hugh Montgomery happened to talk about what they were each working on. Dyson was looking at the energy levels of electrons in heavy atoms, Montgomery was looking at the zeros of the zeta function. The patterns were the same. In a chance meeting over tea at Princeton, physicist Freeman Dyson and number theorist Hugh Montgomery happened to talk about what they were each working on. Dyson was looking at the energy levels of electrons in heavy atoms, Montgomery was looking at the zeros of the zeta function. The patterns were the same.

43
Moments of on the critical line At the RHI conference in Seattle in 1995, some mathematicians and physicists said that there is a factor, g k in a formula for moments of z that match eigenvalues of atoms. At the RHI conference in Seattle in 1995, some mathematicians and physicists said that there is a factor, g k in a formula for moments of z that match eigenvalues of atoms. They knew the first two factors, and after some work found the third. They knew the first two factors, and after some work found the third. The fourth (and formula) were found by The fourth (and formula) were found by 1998.

44
Moments of on the critical line g 1 =1 g 1 =1 g 2 =2 g 2 =2 g 3 =42 g 3 =42 g 4 =24,024 g 4 =24,024

45

Similar presentations

© 2016 SlidePlayer.com Inc.

All rights reserved.

Ads by Google