Just a short post here to note that the cover story of this month’s Notices of the AMS, by John Friedlander, is about the recent work on bounded gaps between primes by Zhang, Maynard, our own Polymath project, and others.

I may as well take this opportunity to upload some slides of my own talks on this subject: here are my slides on small and large gaps between the primes that I gave at the “Latinos in the Mathematical Sciences” back in April, and here are my slides on the Polymath project for the Schock Prize symposium last October. (I also gave an abridged version of the latter talk at an AAAS Symposium in February, as well as the Breakthrough Symposium from last November.)

### Like this:

Like Loading...

*Related*

## 13 comments

Comments feed for this article

6 July, 2015 at 12:25 pm

OliverHas anybody noticed the rhythm of primes has been uncovered? http://www.pateo.nl/PDF/PrimeRhythm.pdf

7 July, 2015 at 6:11 am

dong hongyuI am a chinese student.I know that mathmatic is a very beautiful subject.But unfortunately,my teacher does not have much knowledge of this beautiful subject.Can you recommend me for some book about calculus and probability theory？Thank you very much。

7 July, 2015 at 9:02 am

sylvainjulienSylvain JULIENIf you’re interested in applications of analysis and propability theory to number theory, I recommend Gérald Tenenbaum’s book “Introduction to analytic and probabilistic theory”.

7 July, 2015 at 8:38 pm

dong hongyuthank you very much.In china, it is very hard for us to know about these.

12 July, 2015 at 1:16 am

Neelabh DekaSir,my name is Neelabh Deka and I’m a 12 grader,I’ve found a nice prime related result while playing with prime numbers. Unfortunately I cant prove it,so I would like to share it.

Conjecture-Let P_n denote the n-th prime number.If we choose n consecutive natural numbers from the interval [2,P_n^2] such that they are divisible by P_1,P_2,…,P_n not necessarily in order, then the next set of n consecutive natural numbers would contain at least one prime number.

For example ,if n=3,then p_n=5 then we choose three consecutive natural numbers between 2 and 25,say 8,9 and 10.Here 2 divides 8,3 divides 9,5 divides 10,then next set of three consecutive natural numbers we get 11 which is a prime.

A related conjecture would be to guess that the previous set of n consecutive natural numbers before our choice would also contain at least one prime number.

If this conjecture true then we may hope to apply it to other conjectures like brocard,grimms’s conjecture.

Email-neelabhdeka1997@gmail.com

28 July, 2015 at 1:30 am

C. Ruiz-PiñateDear Professor Tao,

I was wondering if, when you are considering the gaps between consecutive primes, you are taking into account that this phenomen is due to the overlaping of minimum two different odd number rows where roots and gaps don’t touch each other. They only become consecutive ( n and n+2) when both rows are overlaped.

One row starts at 3 and grows +4 and the other starts at 5 and grows +4.

What seems to be f.i. a prime succesion with consecutive primes of 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, is in reality comprised of overlaping the gaps resulting from the substraction of the odd and even squares ( and viceversa). You will notice that the factors resulting from odd^2 minus even^2 compared with even^2 minus odd^2 have no common numbers. Repetitions happen only within a sub-set.

So, one set of primes (gaps) resulting from substracting odd from even squares is 3, 7, 11, 19, 23, 31, 43, 47, 59, 67, 71, 79, 83, and the other even from odd squares 5, 13, 17, 29, 37, 41, 53, 61, 73, 89, 97, 101.

The Prime number theorem applies but we have to use it for minimum two different subsets. Since each row has it’s “own” primes you will notice that the approximation of x/ln x is closer to the real ammount of primes when you make 2*((x/2)/ln(x/2)).

approx of primes with x, 2* x/2 and (pi)

for 10^4, 1,085 vs 1,174 (1,229)

for 10^5, 8.685 vs 9.242 (9,592)

for 10^6, 72.382 vs 76.205 (78,498)

for 10^7, 620,421vs 648,300 (664,579)

One of the odd number sub-sets can be also subdivided in two groups of non touching number and gap rows which when the PNT is used yields further a much better approximation of the ammount of primes by adding (x/2)/ln(x/2) + 2((x/4)/ln(x/4))

for 10^4, 1,085 vs 1,226 (1,229)

for 10^5, 8.685 vs 9.559 (9,592)

for 10^6, 72.382 vs 78,331 (78,498)

for 10^7, 620,421vs 663,552 (664,579)

In addition I have found that the parables resulting in this analysis will give you in further comparisson an exact primality proof which at the same time yields the prime factors (in case of a composite number) through a discovered hyperbola function. I will be glad to discuss these lay findings in more detail should anybody in the forum consider these interesting.

28 July, 2015 at 1:38 am

Ollev Verhoevendear professor Tao,

would you please pay attention to the link in my email? It provides a very simple explanation on the rhythm of prime numbers. The order of sequence actually has been solved in 2010 by a Dutchman.

http://www.pateo.nl/PDF/PrimeRhythm.pdf

30 July, 2015 at 4:27 pm

FredIf the probability a number is prime is greater than 0, and the probability another number is prime is also greater than 0, then the joint probability they are both prime is greater than 0.

When we use 4 number lines representing the sequences of 1’s, 3’s, 7’s and 9’s, we can visualize how frequently these numbers with a probability of being prime greater than 0 are aligned next to each other (+2) and at every other conceivable positive spacing. Furthermore, each sequence is infinitely long, implying infinitely many twin primes and primes pairs of all even sized gaps. I have notes / visualization available here:

31 July, 2015 at 4:08 pm

April Jashmer AntingDear Prof Terry Tao,

May I just ask whether everyone is aware of this:

I am considering any number N=2k+1 and a function W(n)=k! (mod N).

Then, N is composite if and only if W(n)=0 otherwise N is prime.

Furthermore, if k is even and N is prime then there would always be a number a such that a²+1 (mod N)=0 in fact a=W(n).

If k is odd, N is prime then W(n)=1 or -1 .

Thanks!

31 July, 2015 at 7:56 pm

Terence TaoThis is one of the standard applications of Wilson’s theorem: see https://en.wikipedia.org/wiki/Wilson%27s_theorem#Quadratic_residues . But if you discovered it independently, congratulations :).

6 August, 2015 at 6:01 pm

April Jashmer AntingI am very grateful for your quick response sir. I am working to stretch out the implication of this result. Among those results are as follows (just let me know if they are interesting):

1. 2^(2^n + 2) + 1 can never be prime it is always divisible by 5.

2. Fermat number greater than 5 is not always divisible by 3 nor 5

3. 2^(2^n – 2) + 1 can never be prime it is always divisible by 5.

4. 2^{2^(n+1) + 4} + 1 n>1 is always divisible by 17.

5. Fermat number is of the form 15k+2.

There are lot of result coming in but its hard to choose a path that could lead into a more sound result. Thus, I would really appreciate your feedback.

PS: I greatly love your effort and conviction in pursuing a collaborative approach in mathematical research and using the internet (the only accessible tool that I have) to encourage people in doing math. You just open the whole mathematical ideas to the ends of the earth. May the rest follow.

Thanks!

6 August, 2015 at 6:37 pm

April Jashmer Antingno. 5 means fermat number more than 5

7 August, 2015 at 11:00 am

Anonymousdo u really think he would bother with your trivial statements lol