Gaps between Primes (extra footage) - Numberphile

[@andrewxc1335]

Prof. Zhang was my basic proofs teacher. I ended up missing a lot of classes due to mono. I regret not working with him more. Very unsurprising, though, that his paper is "crystal clear."

[@solderbuff]

What is mono?

[@rngwrldngnr]

@@solderbuff it's a disease people often get in high school and college. It's usually unpleasant but not threatening, though it can be quite a bit more serious if you're unlucky.

[@valor36az]

Infectious mononucleosis

[@sillysausage4549]

@@solderbuff in most of the English speaking world it is known as glandular fever. Americans, of course, have their own way of doing things.

[@grandexandi]

Damn, Brady. I'm translating the subtitles into Portuguese, but the word for 'prime' is the same word for 'cousin', so I get to this 'cousin prime' thing and I'm like "os primos primos"... LOL

[@raybroomall8383]

Prime cousin translates to primo nobre. Cousin prime translates to primo primo. I don't know which would be grammatically correct.

[@rogeriojunior9459]

6 years later

[@josegarci3533]

In Spanish it’s the same 🤣

[@branominal]

Massive props to the editor for realising it was a paper worth reviewing quickly

[@tgwnn]

Apparently the limit is now at 246 (down from 70 million).

[@TykoBrian7]

+tgwnn source, plz?

[@tgwnn]

+Tyko Brian I wrote this a while ago but I see Wikipedia lists 246, with possibly 6 or 12! Sorry I can't look into the exact citations now.

[@siekensou77]

i thought numberphile said 16 is the current limit

[@tgwnn]

siekensou77 in this video?

[@jpchevron]

+siekensou77 16 was conjecture as well.

[@gyorgy11]

Eratosthenes not Aristophanes, he was a playwright. The Sieve of Eratosthenes is a miracle of elegance.

[@MoosesValley]

Really appreciate this extra footage. It's astounding to me that even on the edge of infinity the largest gap between primes can be bounded. 70 million seemd such a small gap (in an infinite number system). But as others have reported here, and this quote from inyen1 "Terence Tao and later joined by James Maynard who had found additional new methods, they got the bound down from 70,000,000 to 246 (and if the Elliott-Halberstam conjecture is true down to 16)." For me, 246 is just such an unexpected and insanely small gap between massive primes on the edge of infinity. Incredible work by Dr Yitang "Tom" Zhang and others who have lowered the gap and followed on from his work.

[@nicolageorgiev4350]

The gaps between primes don't have an upper bound. It's just that it's finally been proven that there exist an infinite number of primes that differ by a certain amount (in this case 70 mil). This sort of thing had never been proven before. There still will be primes that differ by more than that, but now we have a proof that for a gap of specifically 70 mil, there are infinitely many.

[@ralphy1054]

@@nicolageorgiev4350 Isn't the proof that there *cannot* be an infinite number of primes with a certain gap that is *over* 70000000? And that it is only *possible* for there to be an infinite number of primes a certain distance apart if that distance is less than 70 million.

[@lPlanetarizado]

@@ralphy1054 technically, they proved that the minimum (thats what the "inf" in the paper accounts for) gap size of 2 consecutive primes that repeats to infinity is less than 7*10^7 , its believed to be equal to 2 (twin numbers)....if by any chance, someone probe the minimum gap size is over 3 for example, that will mean that there arent infinite twin primes there is also a theorem about the maximum gap size, it involves a bunch of log functions, but its not a specific number like 7*10^7 (you will see a "sup" instead of a "inf")

[@Neme112]

@@ralphy1054 I don't think that's what the proof is saying. From what I know, there are an infinite number of prime pairs who are any arbitrarily large distance apart, so larger than 70 million too. It's just that there's an infinite number of pairs with a low distance apart as well.

[@chattyw87]

Should've added 2 seconds to the video to get 19:01 1901 is a prime or added 12 seconds to get 1151 seconds total which is a twin prime with 1153.

[@feliciabarker9210]

This and the Goldbach paper coming out so close together leads me to propose the twin papers conjecture

[@fournya]

As soon as you said "You know that's what I would have done," I looked down to see the length of the video. I love your attention to detail!

[@Maddolis]

I find it hard enough to wrap my head around any number over 10000 being a prime number. This is just mind-blowing.

[@natejc93]

At UNH, I was taught by Zhang, he is a funny dude. No one pronounces his name correctly so he said at the very first day of class that is name is Tom (affectionately). I took multi-d calc with him and it was easy:P I mean its unh ya know?

[@l.z.7320]

Nate Cordova so there are no chinese people there?

[@franzlyonheart4362]

@@l.z.7320 , no, there aren't.

[@NoriMori1992]

I love how this video is a prime number of minutes long.

[@WalterKingstone]

+NoriMori Twin prime number of minutes (17 and 19)

[@NoriMori1992]

Walter Kingstone Oooh!

[@putinstea]

No it's 18:59. Which is 18.9833333333333333 minutes. Not even a whole number.

[@ZeHoSmusician]

18m59s is 18*60+59=1139 seconds and 1139=17*67...so not really prime...

[@xIPatchy]

or 1859, which is divisble by 11 to get my favorite number 169...

[@L0j1k]

Can we get a follow-up? I would *love* to hear how this proof has been evolved by mathematicians!

[@Einyen]

The polymath project with Terence Tao and later joined by James Maynard who had found additional new methods, they got the bound down from 70,000,000 to 246 (and if the Elliott-Halberstam conjecture is true down to 16). This was back in 2014. According to Terence Tao they could not get any further with those methods.

[@PTNLemay]

Thanks for taking the extra time to explain this further. I had to watch the first video a few times before I finally grasped what it was trying to say. And now that I do get it, I agree it's pretty cool.

[@heyandy889]

Brady is really nerding out in the beginning. Usually he lets the talent do the talking, but you can tell he is a worthy candidate for the title of Numberphile.

[@InfamousBLT]

Brady, do you always have this much extra footage? This stuff is fascinating...you should publish extra footage more often. It's great stuff!

[@03doug30]

Thanks for the extra footage Brady

[@Makajezi]

i absolutely loved what he said at the end of the video.

[@mixalakism]

The ancient Greek mathematician which had the sieve idea was Eratoshenis not Aristophanis. Aristophanis was an ancient Greek comic playwright.

[@alahijani]

+Michail Panagopoulos Actually it's Eratosthenes.

[@dimitriscollier9918]

Ali Lahijani Actually Greek people pronounce i as e :)

[@michaelempeigne3519]

+Ali Lahijani That's the right spelling.

[@iSeeJayVee]

Really awesome video. Enjoyed this extended talk quite a bit.

[@rhaegar_ii]

loving these longer videos!

[@kevinohare9216]

Watching this 10 years later, it seems that the proposed proof of the weakened Goldbach Conjecture, which Tony mentions around 14:48, still hasn't been confirmed. Bummer.

[@greg55666]

I haven't read this thread carefully, but from what I see my impression is that I completely agree with you. An apology does not even require the word "sorry." The form of an apology is: (1) I recognize that what I did was wrong; (2) I recognize you were hurt; (3) I feel bad about it; and (4) I will try never to do it again. Saying "sorry" is, as you say, the opposite of saying sorry.

[@ArisKatsaris]

8:03 A guy named Aristophanes? I think you mean Eratosthenes. Aristophanes was an author of comedic theatrical plays.

[@habibaghasafari2237]

thanks Brady, this is a really exciting video about primes which I didn't know before.

[@EmyllSomar]

"I can easily say without a doubt..." Made my damn day. Hahaha. Best response ever. Showing clearly that you're not only a reasonable person, capable of acknowledging your errors/mistakes, but also honest and sincere not to get your undies all in a bunch about trivial things. I am the original 'idiot' and I now accept your apology further. You have become one of my favorite KZbin commenters. LOL. Cheers.

[@unvergebeneid]

This is pretty amazing. When I first read the comment you replied to, I thougth "this can't possibly be true", then I checked the first couple of primes by hand, then the primes between 5 and 10000000000 with a Python script. Pretty amazing.

[@Syzygyyy]

8:59 and 857 are twin primes, well done Brady.

[@EmyllSomar]

The spark can also go into it. It also goes into the first one. Genius!

[@numberphile]

good to hear

[@beeble2003]

GPY was mis-stated in the video. What Goldston, Pintz and Yildirim actually proved is that, for all ε>0, there are primes P>Q with P-Q < ε*log(P). Choosing ε to be very small doesn't guarantee that the difference between P and Q is small in absolute terms; it's just small compared to log(P). So, for example, if you choose ε=0.0001, it might be that the value of P you end up with is something like 10^1000000 and the only guarantee you get then is that P-Q < 100.

[@The_Conspiracy_Analyst]

16:26 What makes him say that?

[@banjogringo]

Brady thanks for this big extra footage, I really enjoyed watching it!

[@DevonParsons697]

Yes it is. Consider that there are 5 numbers between two multiples of six (for instance, 7 8 9 10 11 are the five numbers between 6 and 12). Of those, two are divisible by 2 and one other is divisible by 3. The only possible remaining numbers that have a chance to be prime are the ones bordering the multiples of 6.

[@grandexandi]

And don't even get me started on 'sexy primes'. It's just 'sexy cousin'. I mean, really.

[@anxez]

Something interesting I have noticed noticed: Base six behaves pretty excellently with primes. It can really quickly be shown (and I imagine proved) that all primes end with a 5 or a 1 in base six.

[@wouterinho7]

The video is just 1141 seconds long which is a prime number. Nice work Brady!

[@jacolmes]

Brady, I think you have the most awesome job in the world.

[@MrPooee]

I love these conjecture discussion videos.

[@beeble2003]

Sorry for the confusion -- typo. Both of them should have been "Primes P>Q with (P-Q) < ε*log(Q). Thanks for pointing that out.

[@wreckim]

What appeals to me about a subject like this, like Fermat's Last Theorem etc...is that it is so easy to understand the problem, and even picture how difficult it is to prove it--yet I KNOW I can't keep up with the math, but I imagine I can with proper explanation. It's a lot like watching a chess analysis of a a Carlsen in the World Championships...I imagine I too would make that move. Dreamers...I am one.

[@Ali2045Ali2045]

The length of this video is 1901

[@MrGoDuck]

"So this has applications beyond number theory" as a Physics major those were the magic words I was waiting for.

[@unclvinny]

This video is 18 minutes and 59 seconds, so you got a "59" in there, Brady!

[@thecakeredux]

Seeing people being excited about math is equally great as the matter itself.

[@markmc5379]

Numberphile is COOOOOOL

[@jelowey]

Props to you, that was kind of hilarious.

[@playerthree38]

extra footage is the best part IMHO

[@Knooblet]

For one: very large primes are used in the encryption of valuable information. Math is also very useful for programming, especially for video games (very large matrix multiplications) to determine has light reactions with objects. This channel mostly explains different ideas within Math, but the applications of these ideas are enormous. You seem like a smart individual, so figure some more out!

[@jrhperu]

Harald Andrés Helfgott was born in Peru, he finished high school in Lima, at the Alexander von Humbolt College and is now workigh at the Ecole Normale Supérieure, in France.

[@Psqad]

Those last words explains it all: original vid is lenght 859(twin prime with 857). This vid is also prime and also special: 1901 is a Sophie Germain prime(2p + 1), since 2 x 1901 + 1 = 3803 is also prime. Nice touch.

[@MuffinsAPlenty]

It depends on what your definition of prime is. In many abstract algebra classes, an element p of a ring is prime if whenever p divides ab, then p divides a or p divides b. Under this definition, there are infinitely many negative prime integers. In fact, if p is a positive integer prime, then -p is a prime. But again, it depends on the definition, what branch of math you're working in, and if it even matters concerning the problem you're working on. Most people would say no, though.

[@clarekuehn4372]

Wish you would put this in the prime number playlist. Thanks!

[@MyMustacheBeckons]

I love that the video length (if read as 1901) is prime

[@lnkognitoX]

one guy took a right way.. figuring exceptions, not only acseptions.. worked on primes 2 weeks alredy, and I feel like gone further than any man before..

[@PopeLando]

Just spotted a strange error by Tony at 14:45 - the Goldbach conjecture isn't one of the Millennium Problems. In fact one way you can tell this is that none of the Millennium Problems are something that could be explained to and understood by a child, like Twin Primes, Goldbach, Collatz or even Fermat. Makes me wonder if, if still unsolved in 2000, would Fermat have been included?

[@calohtar]

Around 8:00 there’s a mistake in the captions. It’s supposed to say “sieve of Eratosthenes”. Aristophanes is the playwright

[@Kubko5656]

Yay! I managed to find a working video on youtube!

[@geerin.]

They do! It doesn't show up in subboxes but you can see it via annotation at the end of the video it's usually paired with.

[@AmiduTV]

You should do a video explaining the relationship between number of episodes and bradys %camera time and extrapolate to find the date from which all numberphile videos will just be brady being a boss

[@beeble2003]

At around 7:40, Brady expresses surprise that the bound, 70,000,000 is a nice round number. The video explains where the number came from but not why it's so round. The reason is that, once you know that the actual number isn't very interesting, you tend to just prove that it's smaller than some round number. He presumably knew that the exact bound from his proof was much, much bigger than 2 and did a back-of-the-envelope calculation to say it was less than 70 million.

[@zeru2150]

The property of being prime or not is universal for all bases. You simply factorize a number and than translate those factors into other bases. Example: 15= 3*5 in base 10 F=3*5 in base 16 17 = 3*5 in base 8 1111 = 11*101 in base 2 So if you want to work on prime numbers, you can simply pick your favourite base ;)

[@Urqzen]

*Sees papers *Sees camera *Sees Brady Analizing is entertaining

[@nisbahmumtaz909]

Oh boy. I'm really in for it now.

[@Engloutiee]

Would be really nice to hear about the Goldbach conjecture and Riemann hypothesis, and maybe even the abc conjecture, as well!

[@ArturitoBurrito]

The extra footage is always my favorite

[@beeble2003]

The statement of the Goldston-Pintz-Yildirim theorem given in the video at 6:00 (for any ε>0, there are primes separated by less than ε*log(N) for large enough N) is incorrect. That statement is trivially true: for any ε, just take N=e^(1+1/ε). Now, 2 and 3 are primes separated by less than ε*log(N), since ε*log(N)>1. Goldston, Piltz and Yildirim actually showed that, for all eps, there are primes P>Q with (P-Q) < ε*log(Q).

[@wshun]

According to the video, GPY states that: for any epsilon(e), u can get two numbers smaller than N with a gap in between is smaller than eN, provided that N is large enough. so even if e is very small, u may need N to be very large for GPY to work, but then the gap eN may not be small

[@SamOliver4]

Working in other bases has proven useful for CHECKING primes, on the other hand, because the divisibility rules for numbers are in fact different in different bases. For example, numbers that end in 1 in base 6 tend to be prime because those numbers can't be divisible by 2 or 3. Obviously not all numbers that end in 1 in base 6 are prime, but since most composite numbers are divisible by 2 or 3, this particular check makes it easier to find many primes in quick succession.

[@Okiesmokie]

It's not saying that 70,000,000 is the highest gap between primes, it's only saying that there are an infinite amount of primes where the gap between two primes is

[@gibsonrulezz]

Brady , you should definitely check the Collatz Conjecture ! Easy to present and very interesting !

[@aeroscope]

I love the last bit

[@prime2955]

Happy 2019 year. Prime # year. Excitinggg

[@EebstertheGreat]

This is true for all primes greater than 3, and it is easy to see why. All numbers are either a multiple of six (in which case they are not prime), a multiple of six plus or minus three (in which case they are a multiple of three), a multiple of six plus or minus two (in which case they are a multiple of two), or a multiple of six plus or minus one (in which case they may or may not be prime). 2 and 3 are exceptions because they are the only multiples of 2 and 3, respectively, which are prime.

[@terrattenfanger5571]

ive done this "takin' it back/Im sry thing" twice between december 2009 and may 2010... it is not that unheard of.

[@SpySappingMyKeyboard]

Every number in b6 that ends in 0, 2, or 4 will be a multiple of 2. Every number in b6 that ends in 3 will be a multiple of 3. I can't imagine converting to base 6 and back is the most efficient way of weeding out multiples of 2 and 3.

[@gasdive]

1901 minute,seconds video, a prime. Very clever Brady.

[@Airblader]

Prime numbers are a main ingredient in all modern cryptography, so they're pretty much in anything that uses passwords and stuff. So yes, they are extremely useful.

[@xniquilador]

Very Inspirational!!!

[@Dayumhesgood]

The twin prime conjecture is to do with the idea that primes which differ by only 2 will always pop up, despite the fact that primes tend to be further apart as their value grows.

[@enlongchiou]

use quadratic equation x^2-dx -n=0 as sieve can comb any gap d, have infinity solution for every gap d by induction, add up all of d prove goldbach conjecture, twin prime conjecture is it's special case at d=2, for example : a*b=a*(a-d)=n=5*3=15, (2^2+4*15)^0.5=8, (8+2)/2=5, (8-2)/2=3 two solution, if a or b is composed number have more than two solution and gap d not equal to 2, 7*5=35, (12+2)/2=7, (12-2)/2=5, 11*13=143, ((11+13)+2)/2=13, ((11+13)-2)/2=11, 7*3=21, ((7+3)+4)/2=7, ((7+3)-4)/2=3 for d=4, 13*7=91, ((13+7)+6)/2=13, ((13+7)-6)/2=7 , d=6, for prove Riemann Hypothesis use realization of sieve of Eratosthenes ,mean keep remainder, for example : pi(2^2)=4*(2-1)/2+0/2+1-1=2, pi(3^2)=9*(2-1)*(3-1)/(2*3)+1/2-3/6+0/3+2-1=4, pi(5^2)= 25*(1*2*4/2*3*5)+1/2-1/6-5/10+25/30+1/3-10/15+0/5+3-1=9.

[@hssgsng]

A better explanation: All numbers 6k, 6k + 2, 6k + 4 are even, if k is an integer. 6k and 6k + 3 are multiplies of 3, so all primes must be of the form: 6k + 1 or 6k + 5 = 6(k+1) - 1 = 6k' - 1.

[@Rafaelfl2]

Yes, and they're the same.Remember that the greek (such as Aristotele, who the professor was talking about) didn't use our number system. They did basically all of their math based in geometry.

[@FountainMath]

Brady, can you do a video on how exactly primes are found? I've heard that it isn't done by human work any more, but by super computer computers. If this is true, where are these computers? What algorithm/equation/program do they use? How powerful are they exactly?

[@TessaBain]

All I can think is what's the point. To be honest, thanks to Asperger's I'm technically a genius, Particularly if I care about something, because then I become obsessed and being able to notice patterns like crazy only helps further it. One of the first things I became obsessed with and still am to this day was writing, be it numbers or letters. Math appropriately became my first whiz subjects. I not only learned what was taught but went further, even creating my own rules to do even the...

[@Vulcapyro]

Not 2 and 3, but yes. Say we have a number n>3, and we put it in the form n = 6a + b where 0

[@csatimaci]

Thank you for your answer! Now I understand better, how this system works.

[@danielwilkowski5899]

7:10 he proved the was a finite gap between primes. Well, if there wasn't, would that imply that there can be the last prime, after which there is an infinite long gap between prime numbers?

[@TeddyRoooosevelt]

Great video. Very minor correction at 8:00 : Dr. Padilla says Aristophanes (and so do the captions) when he means Eratosthenes.

[@Kumurajiva]

honly cow, who would have thought of such a thing. I would never have thought myself into that corner

[@JureRatkovic]

Yes there are, and they are the same in all bases. For example 25 hex is a prime, and is not divisible by 5 obviously. Primalty is an intrinsic property of a number, it is not dependent on the way you write it. And number bases are just that, diffirent ways to write numbers :)

[@tyebillion]

Excellent video, very informative.

[@heyandy889]

thanks for the leak into the paper. I want the original text! even though I will probably not understand it, lol

[@MathewIshaq]

Now it's down to 6!!!!! Exciting times!!!!

[@JayCee235]

The universe actually covers up the number 23 as mathematicians search for twin primes, because if they ever realize that 23 isn't a twin prime they'll uncover some very dark secrets.

[@Vulcapyro]

Divisibility is independent of a number's representation. You can show results about how primes look in other bases, but it's more likely that you'll get more information about working in that base, rather than information on the primes.

[@edderiofer]

Edderiofer's Prime Conjecture states that: If n is an element of N (set of natural numbers), then n+1 MAY BE PRIME. Not all such numbers are prime, but we can find primes with this formula as well!

[@eirh]

Wow people seem to really have missed your point. You are actually correct, you can not write 2 as the sum of 2 primes. The Goldbach Conjecture actually states, that every even number GREATER then 2 can be written as the sum of 2 primes, they forgot to mention this in the video.

[@per-axelskogsberg3861]

Bradys comment at the end ☺ Best part of the video.

[@DiaStarvy]

Because prime numbers have an additional clause: they have to be greater than 1. Semi-sarcastic explanations aside, many of earlier theorems involving prime numbers repeatedly found themselves having to state "X is true for all prime numbers excluding 1", so it was easier for everyone if prime numbers excluded 1. One such theorem is no less than the fundamental theorem of arithmetic.