How they found the World's Biggest Prime Number - Numberphile
HTML-код
- Опубликовано: 30 сен 2024
- Featuring Matt Parker...
More links & stuff in full description below ↓↓↓
See part one at: • New World's Biggest Pr...
Part three on Numberphile2: • More details about the...
Matt's interview with Curtis Cooper: • New World-Record Large...
The previous record: • New Largest Known Prim...
Mersenne Numbers and Mersenne Primes: • 31 and Mersenne Primes...
More on Mersenne Primes: • Perfect Numbers and Me...
GIMPS: www.mersenne.org
Prime Playlist: bit.ly/primevids
Support us on Patreon: / numberphile
NUMBERPHILE
Website: www.numberphile...
Numberphile on Facebook: / numberphile
Numberphile tweets: / numberphile
Subscribe: bit.ly/Numberph...
Numberphile is supported by the Mathematical Sciences Research Institute (MSRI): bit.ly/MSRINumb...
Videos by Brady Haran
Brady's videos subreddit: / bradyharan
Brady's latest videos across all channels: www.bradyharanb...
Sign up for (occasional) emails: eepurl.com/YdjL9
Numberphile T-Shirts: teespring.com/...
Other merchandise: store.dftba.co... 
Наука
2 forests where destroyed to make that book
+mrkarlhey not really unless you're really into that stuff and can compare it to other values for random activities
+Wabadabadoe It's only a ream and a half per copy
+mrkarlhey It wasn't found with extremely advanced computers rather 800ish very average computers months.
+mrkarlhey It wasn't found with extremely advanced computers rather 800ish very average computers months.
+mrkarlhey It wasn't found with extremely advanced computers rather 800ish very average computers months.
this number is fabulous in binary
+Harry Tsang Like all Mersenne numbers
+Harry Tsang Yeah, I am so smart that I learned it by heart!
+TheJman0205
00110000 00110001 00110001 00110000 00110001 00110001 00110001 00110001 00100000 00110000 00110001 00110001 00110000 00110001 00110001 00110001 00110000 00100000 00110000 00110001 00110001 00110000 00110000 00110001 00110000 00110001 00100000 00110000 00110000 00110001 00110000 00110000 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110001 00110000 00110001 00110000 00110000 00100000 00110000 00110001 00110001 00110000 00110001 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110000 00110000 00110000 00110000 00110001 00100000 00110000 00110001 00110001 00110001 00110000 00110001 00110000 00110000 00100000 00110000 00110000 00110001 00110000 00110000 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110001 00110000 00110001 00110001 00110001 00100000 00110000 00110001 00110001 00110000 00110001 00110001 00110001 00110001 00100000 00110000 00110001 00110001 00110001 00110000 00110000 00110001 00110000 00100000 00110000 00110001 00110001 00110000 00110001 00110000 00110001 00110001 00100000 00110000 00110001 00110001 00110001 00110000 00110000 00110001 00110001 00100000 00110000 00110000 00110001 00110000 00110000 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110000 00110000 00110000 00110001 00110000 00100000 00110000 00110001 00110001 00110000 00110001 00110001 00110001 00110001 00100000 00110000 00110001 00110001 00110001 00110000 00110001 00110000 00110000 00100000 00110000 00110001 00110001 00110000 00110001 00110000 00110000 00110000 00100000 00110000 00110000 00110001 00110000 00110000 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110001 00110000 00110001 00110001 00110001 00100000 00110000 00110001 00110001 00110000 00110000 00110000 00110000 00110001 00100000 00110000 00110001 00110001 00110001 00110001 00110000 00110000 00110001 00100000 00110000 00110001 00110001 00110001 00110000 00110000 00110001 00110001 00100000 00110000 00110000 00110001 00110000 00110000 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110001 00110000 00110001 00110001 00110001 00100000 00110000 00110001 00110001 00110000 00110001 00110000 00110000 00110001 00100000 00110000 00110001 00110001 00110001 00110000 00110001 00110000 00110000 00100000 00110000 00110001 00110001 00110000 00110001 00110000 00110000 00110000 00100000 00110000 00110000 00110001 00110000 00110000 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110000 00110000 00110000 00110001 00110001 00100000 00110000 00110001 00110001 00110000 00110001 00110001 00110001 00110001 00100000 00110000 00110001 00110001 00110001 00110000 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110001 00110001 00110000 00110000 00110001 00100000 00110000 00110000 00110001 00110000 00110000 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110000 00110000 00110000 00110000 00110001 00100000 00110000 00110001 00110001 00110000 00110001 00110001 00110001 00110000 00100000 00110000 00110001 00110001 00110000 00110000 00110001 00110000 00110000 00100000 00110000 00110000 00110001 00110000 00110000 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110001 00110000 00110000 00110000 00110000 00100000 00110000 00110001 00110001 00110000 00110000 00110000 00110000 00110001 00100000 00110000 00110001 00110001 00110001 00110000 00110000 00110001 00110001 00100000 00110000 00110001 00110001 00110001 00110000 00110001 00110000 00110000 00100000 00110000 00110001 00110001 00110000 00110000 00110001 00110000 00110001
01001101 01000100 01000101 01110111 01001101 01010100 01000001 01111000 01001101 01010100 01000101 01100111 01001101 01000100 01000101 01110111 01001101 01000100 01000101 01111000 01001101 01010100 01000101 01100111 01001101 01000100 01000101 01110111 01001101 01000100 01000101 01111000 01001101 01010100 01000101 01100111 01001101 01000100 01000001 01111000 01001101 01000100 01000001 01110111 01001101 01000100 01000101 01100111 01001101 01000100 01000001 01111000 01001101 01000100 01000001 01110111 01001101 01000100 01000001 01100111 01001101 01000100 01000101 01110111 01001101 01000100 01000001 01110111 01001101 01010100 01000001 01100111 01001101 01000100 01000101 01111000 01001101 01000100 01000101 01110111 01001101 01000100 01000101 01100111 01001101 01000100 01000101 01111000 01001101 01000100 01000101 01111000 01001101 01010100 01000001 01100111 01001101 01000100 01000101 01111000 01001101 01000100 01000001 01110111 01001101 01000100 01000101 01100111 01001101 01000100 01000101 01111000 01001101 01010100 01000001 01110111 01001101 01010100 01000001 01100111 01001101 01000100 01000101 01111000 01001101 01010100 01000101 01110111 01001101 01000100 01000101 01100111 01001101 01000100 01000001 01111000 01001101 01000100 01000001 01110111 01001101 01000100 01000001 01100111 01001101 01000100 01000101 01111000 01001101 01010100 01000001 01111000 01001101 01000100 01000001 01100111 01001101 01000100 01000101 01111000 01001101 01000100 01000101 01110111 01001101 01000100 01000001 01100111 01001101 01000100 01000101 01111000 01001101 01010100 01000001 01110111 01001101 01010100 01000001 01100111 01001101 01000100 01000101 01111000 01001101 01000100 01000001 01111000 01001101 01000100 01000101 01100111 01001101 01000100 01000101 01111000 01001101 01000100 01000001 01110111 01001101 01000100 01000101 01100111 01001101 01000100 01000101 01111000 01001101 01000100 01000001 01111000 01001101 01000100 01000001 01100111 01001101 01000100 01000001 01111000 01001101 01000100 01000001 01110111 01001101 01000100 01000101 01100111 01001101 01000100 01000001 01111000 01001101 01000100 01000001 01110111 01001101 01000100 01000001 01100111 01001101 01000100 01000001 01111000 01001101 01010100 01000101 01110111 01001101 01010100 01000001 01100111 01001101 01000100 01000101 01110111 01001101 01000100 01000001 01111000 01001101 01000100 01000001 01100111
+Abandoned Void 01000010 01101001 01101110 01100001 01110010 01111001 00101100 00100000 01110100 01101000 01100101 01101110 00100000 01000010 01100001 01110011 01100101 00110110 00110100 00101100 00100000 01110100 01101000 01100101 01101110 00100000 01100010 01101001 01101110 01100001 01110010 01111001 00100000 01100001 01100111 01100001 01101001 01101110 00101100 00100000 01100101 01101000 00111111 00001101 00001010 00001101 00001010 01010000 01101111 01101001 01101110 01110100 01101100 01100101 01110011 01110011 00101110 00101110 00101110 00100000 01000010 01110101 01110100 00100000 01101001 01110100 00100111 01110011 00100000 01100110 01110101 01101110 00101100 00100000 01001001 00100000 01100111 01110101 01100101 01110011 01110011 00101110
instead of searching for the biggest prime number, I went searching for the smallest. After two years of calculating, my computer finally found it: 2
try hunting for more even primes
Isn’t one also a prime or is it not considered a prime because it’s also a square
@@gatlinggun511 1 is not a prime due to the fact that it only has 1 factor. a prime number has 2 factors, 1 and itself
@@gatlinggun511 1 isn't considered prime because it would break the fundamental theorem of arithmetic, as they would then have infinite prime factorizations due to being able to have an arbitrary number of ones in the factorization, so we decided to just not include it as prime (among other reasons, but this is a big reason why)
It’s infinity right?
Finding the 2^127-1 Lucas number... by hand. Imagine messing up just one freaking number.
eZ
+donbasuradenuevo Use binomial expansion.
3,848,889,888 3,848,889,890
3,848,888,897
whoops gotta start over
I predict you just tested 2^7-1 already..
Didn't u??
@@monicarosas264 The mathematician William Shanks took 15 years to calculate 707 decimal digits of pi, but he made a mistake at the 528th position.
Matt: ... I know 5 is a prime number.
Brady: What??
Matt: Probably.....
What a classic Parker Square moment.
1:59
Stop making Parker squares a thing!
-Matt Parker
@computer hi matt
What's a Parker square?
@@createyourownfuture5410 "parker square" refers to an infamous mistake by mathematician Matt Parker
Any chance we'll get an explanation of why that method works?
It’s in the video
Interesting seeing you here 4 years later
@@eboone why is this video suddenly recommended
@@_wetmath_ might be my fault... I was binge watching numberphile a couple weeks ago, found this one and made a few comments on it. From what I could tell, the last reply was a year before my comments. Just a guess though.
Wait *what?!*
What's my favorite music theorist doing here?!
Ps. I'm on the spectrum too
I found one! 11 is a prime number!
+t0f0b0 and in binary too^^
...and quaternary
...and senary
Cool, works in 4 distinct bases :D
...But it's not a Mersenne prime >:(
+Benjamin Philipp Wouldn't it be prime in an infinite number of distinct bases as 11 would simply whatever base you choose plus 1?
Jordan Lynch
Of course... :D
Somehow I was focused on decimal so much that I thought "well, the 'value' of 11 won't change in higher bases" as if it was a distinct digit, making higher bases irrelevant. That's what I meant by "distinct bases": "Eleven is still going to be eleven in bases higher than 10 and will always be a prime" - neglecting the fact that eleven would look like "Ɛ" for example.
I can count to potato!
11 has four factors:
1, 2, 5.5, 11
Trololoollooll jk jk jk jk
J U S T K I D D I N G
J US T A B R A N K. P R O
If you'd figure out a pattern, would you get more money for publishing a prime every month or for publishing the pattern?
Like pharmaceutical companies. They make less from curing disease than by treating it.
Are you the guy who believes the thing that they're withholding cancer cures too?
Lucas Ng yes and no. "Yes" is Companies wont produce any product they think unprofitable. if they could, the process would be secret and the ingredients be partly secret too, so we dont know if there was any better way possible. "No" is hardly found a company invest in such researches, investing in cancer research is super risky, so public laboratories run by the goverment will do this job, and yes, they will publish everything.
publish a prime every month. there will be many more pages each time so it will cost more and more. do not publish the pattern if you're able to find a prime each month or anyone will do it
A company that had the cure for cancer would make an untold fortune from it and would never withhold it. It wouldn't be relevant to them that other companies would no longer profit from treating the disease. Government agencies are run by people who have a vested interest in keeping their funding going on and on forever. There is much mere accountability in private concerns because you only get paid for what you actually accomplish an what you can market. Public (government) concerns exist to milk more and more research money, which would end as soon as they were to find a cure.
03:43
they grow up so fast ;-;
E
They do.
He'll grow.
My brain just threw an exception.
I hope you caught it
You have an exceptional mind.
Don't see how it could've thrown an exception, integer overflow maybe
Oh is that what that sound was?
All even numbers can't be primes expect 2
I betcha
2^(2^74207281 - 1)-1 would work
Why?
+Alan Douglas do you have an idea of how big that number is? It's like trillions of digits long (maybe even bigger).
+Alan Douglas do you have an idea of how big that number is? It's like trillions of digits long (maybe even bigger).
+DavidRussell323 was just thinking that, I wonder if the chances of a 2^Mersenne Prime - 1 are more likely the answer is a prime.
+VivaFeverFifa 2^74207281-1 contains 22,338,618 digits. 2^10^22,338,618 would be something like 10^22,338,617 digits long.
fun fact, Prime95, which is the prime finder tool made by GIMPS, is also used as a stress test for CPUs for overclocking
Can confirm, I saw a technician test my PC with it.
Here is a joke.
The number 5 was a champion at boxing. He lost when he turned into a 6. The reason he started losing was because he wasn't in his prime.
But he was back at it again when he turned 7.
Zed dash. silly joke when he. was. 6 he was perfect.
Jayden Tan
It wasn’t a 5-year old 5
Zed dash. This entire thread delivers.
Why is 6 afraid of 7? Because 7 8 9.
This cant be true! The Google Calculator says this number is Infinity!
Then it's wrong
+Clowen00 TIL Infinity fits in three volumes.
+Belleren savage
That's only because the number is too big for the calculator to calculate
Epic Wolf Oh really? That sounds actually plausible, didn't thought about that! ;-)
Could somebody write this prime in base 26 and print it using English alphabet? Would it reveal interesting words? What would be the longest?
+scozio Gotta make it base 36.
Thou has forgotten the numbers.
+Keroia Just encoding
+scozio it says 'illuminati'
scozio it would say "youhaveallbeenfooledforsolongtherealenemyisthemartians7902g4h8kkkkkk1" somewhere in there
scozio base 26?!?!?
this is beyond my imagination how they come up with say something like lucas series and check if a number is prime or not from that series...
props to the legends like these..
lol "the world's". Because it's prime here but on Mars it's actually divisible by 17 and on Neptune it's an even number.
+Sam Harper ?
+Albert Chan
You are so clueless about how jokes work
I dont unsfdder4y3wfhwhy5
XD
Maybe "the world's" because an alien species couldve found a bigger one already.
4:05 He fast forwarded those numbers because he started by saying “2 billion”, not “2 quintillion. Ripparoni
David -
Yea prop lol. But saying a quintillion is better
@@blue9139 lol
if I'm at a restaurant and order a cut of meat, can I use this formula to see if the ribs are prime?
Gopher it.
Or at the bank, to ascertain the ruling prime rate?
If they don't give you a prime number of ribs, send it back
@@bananya6020 lol
Side splitting humor 😐
You should mass produce those books. I would legitimately buy them.
+TehDragonGuy Why?
+David Greydanus because
+TehDragonGuy What are you going to do when the next largest prime is discovered?
+allyourcode Chop down even more trees.
I want to know how many tons of coal need to be burned for GIMPS to find the next largest prime.
1:35, gives away the answer, THEN says "spoiler". That's not the way a spoiler alert works dang you!
Ok but why does this Lucas number prime test work?
The real question remains unanswered
The proof is beyond the scope of this video
Just math. You could ask that question about the simplest algebra and end up in a massive loophole of confusing proofs
The one that can answer that is 3blue1brown..
@@050138 The proof is left as an exercise to the viewer.
Can we have another calculator unboxing?
2024 I just found out from Veritasium that some Japanese publisher stole Matt's idea and printed out the next two Mersenne Primes as paperback books!😮
Holy shit that's fucking big
+ytYAEeLxmEYb As compared to infinite...
Draevon May Well thanks for info but i already know that... :P
Draevon May XD
Devon Langbein guess it does now...
Where can i get a copy and how much?
+A V Sandi Nack $2^74,207,281 -1 USD
+josiah O'Neill smart aleck :)
+YipYapYoup I thought your dollars were bimetal. :)
+A V Sandi Nack commenting for captain
+A V Sandi Nack mathsgear, maybe
Next largest prime: 2^74207281+1. The proof is left as an exercise to the reader.
Neel Modi I know for a fact 2^74207281+1 is not prime. It is divisible by 3
If 2^74207281-1 is prime, and 2^74207281 is an even number with no factor of 2 - then 2^74207281 must divide by 3.
@@daleftuprightatsoldierfield Ohh man u spoiled his attempt for a joke😂😂😂🤣🤣🤣 Anyway that was perfect ....
Jajja, two year ago discovered other Mersenne prime with more than 24 millons of digit. The gigant Merssenes primes numbers discovered in the last 20 years was a distributed work of millons of personal and server comouter around the world using the Primes95 application conected in the GIMP project.
Wrong. The Lucas numbers go 4, 5, 6, 1, 2, 3.
+Thingsandstuff Now it's 4, 5, 6, 1, 2, 3, 7 xD
+Thingsandstuff thanks
+Thingsandstuff No they go: 2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2207, 3571, 5778, 9349, 15127, 24476, 39603, 64079, 103682, 167761, 271443, 439204, 710647, 1149851, 1860498, 3010349, 4870847, 7881196, 12752043, 20633239, 33385282
Was there a joke here I missed?
+E.B. White George Lucas
I was doing some math and found that (2n)+(n^2)-1 created primes very well if n is even. Example: (2 x 99922222222220)+(99922222222220^2)-1 is prime. I also saw that up to 200 being n (leaving out odd numbers) it spit out a prime 42% of the time.
So basically he wants us all to use G.I.M.P.S. so that he can find the really big numbers using PrimeGrid. Well, I won't fall for that trap! :)
On an unrelated note, was anybody else watching him wave the marker around, and waiting for the moment when he accidentally marked up his new prime number books and lost it on camera?
What is the biggest prime for which we know all the previous primes?
Rik Schaaf 356787 42157899865323466755443278887765556789000009887665433457788839387474738289254333564215789986532346675544323585858696969699988665323567898531245685652413131453645
@@janeemmanuel8885 I mean, if you are gona smack your head on the keyboard in order to guess an answer to his question, at least make sure it does not end with digit 5 lol
Sergej - That's hilarious! I love it.
@@sergejkeser7270 😂😂
@@sergejkeser7270 dont forget about the random space 7 digits through
Spoiler: 5 is prime! 😂
Poor computers
They just found a new one
(2^77232917)-1
:P
Don't know if the third video will cover this, but - Matt mentions here that we only need look for Mersenne primes (2^p)-1 where p is prime, and we're working our way up through prime values of p to check things. However, we know that Mersenne primes (and the other categories we're hunting for) are only a subset of all primes, so don't we eventually reach a point where we're not certain that the next exponent to check is indeed the next prime?
For example, if you started only knowing that 2 is prime and that Mersenne primes exist, you'd immediately find that 3, 7 and 127 are prime, but you've already missed 5 and 11 because they're not Mersenne primes, which in turn means you didn't find 31 which is a Mersenne prime.
I mean, we presumably know the primality of all numbers up to a point a lot greater than 74million, so I may be worrying about a far-future problem here!
+Oddtwang of Dork Testing the primality of smaller numbers will take a few seconds at most (probably not even a tenth of a second for a number of the order of a few billion.)
The fact that people are so nerdy they do this, and then print it out like it was a book, it makes me ridiculously happy.
And btw, thank you guys for making videos! I haven't done very advanced math, but through your videos I have been able to at least kind of grasp the idea of some of these amazing things!
Actual title: "The Biggest Number Anyone's Bothered Proving is Prime"
that's a lot of numbers!
The biggest number SO FAR that anyone's bothered proving is prime. As shown by the fact that this number is nowadays nowhere near the biggest any more
Please provide a reference for your statement “2^127 - 1 is the biggest prime founded by hand”
I am working as maths teacher.. And I really appreciate your efforts..
10:45 0.5 X speed, the way he says computers kills me
10:46
this is hilarious, he sounds absolutely drunk XDDD
“for a dAay wE g- gAt sAmthing tOo dOo with oUr côMpüÜtèrs”
I'm so conflicted: on one hand, this is so mathematically beautiful; on the other, it's witchcraft!!
how long until this number is used in encryption?
+aednil Considering banks use 2048 bit numbers now and modern computing would take thousands of years to break the discrete logarithm problems, it could be a while!
+James Purcell I'm not 100% certain of how encryption works, but iirc, this number is even useless for encryption, because it is so well known. It doesn't sound completely right, but I heard it from various sources.
levolta The most basic variation is RSA, so in RSA I'd tell you (n,e) = (65,7), e is your encryption component, and n is the product of 2 primes p and q. Obvious with a number this small you can see, p = 13 q = 5.
Now if you want to find the decryption component, you do e * d = 1 mod (p-1)(q-1) , so 7 * d = 1mod 48. Again as it's a simple example you can spot if d = 7, then 7*7 = 49mod 48 = 1mod 48.
So if I give you a message say M = 3. 3^e mod n = C your ciphertext. So 3^7 = 2187 = (33*65) + 42 mod 65 = 42mod 65. So after encryption of a message M = 3, we get a ciphertext C = 42.
If you want to decrypt this, you can do C^d mod n, so 42^7 mod 65 = 3mod 65.
So a message raised to the power of the encryption component becomes ciphertext. a ciphertext raised to the power of the decryption component is your original message.
If your primes become huge (Banks use 1024 bit primes), these numbers are crazy big, and it is computationally infeasible to find the primes P and Q if given the product N. If they can't find P and Q they can't find the decryption component and you're messages and bank details ect are safe.
Because this prime is so large it isn't really an issue, and won't be for a large amount of time. Banks at the moment use two 1024 bit prime numbers, to make a 2048 bit product N, this takes current generation computers millions of years of constant computation to brute force. I doubt banks will ever use a prime this large in security based systems such as RSA.
+James Purcell what levolta meant is that if you did decide to use this specific prime, people would already know one of the components, so you already have the job done for you, you successfully decrypted an RSA key
the strength of RSA comes from not being able to find the components in useful time, but if you know one of them, the job is already one, it's a linear operation to find out the other one and you can guess the private key.
Pedro Gusmão While that is true, banks don't tell you what either of the primes are, if they started using a 44million bit prime people would get suspicious sure, but as more primes are discovered and none mersenne primes are discovered through things like prime grid theoretically a well known prime could be used, but it would be dangerous as you've said
Reading that 2^74207281 book would be much more entertaning than reading Twilight.
-1 (_ _)
I mean that's a really low bar to set though.
they found a new one yesterday
Could you explain a proof of the test you used?
So, is 2 ^"THAT monster prime" -1 also a prime ? XD
+Plasma Phi My calculator says "ERROR" so it might be
+Plasma Phi Can I get back to you on that? ;)
Maybe. 2^n - 1 is prime if n is prime, but if n is prime, 2^n - 1 may be composite
+Plasma Phi It would need to be checked.
+Plasma Phi I was wondering the exact same
Joined the GIMPS project today, 1.7% done on two exponents!!! I'm feeling lucky :o
Wonder what the biggest prime is where all the numbers below it have been checked.
they've checked up to around 10^18. I think they've gone a bit further but haven't gotten to 10^19 yet.
+Cruzer Since doing so is easiest based on a sieve, once you know the list up to that point, the next is easy to find. Too hard to define a specific point for that reason, and thus little reason to even search.
+xunile1 But remember they (Gimps) are only checking one type of prime - there may be other types which haven't been checked up to that range yet.
+Gordon Taylor the numbers that GIMPS is searching for are way larger than 10^18, all primes up to 10^18 have been found.
Cruzer i can check the largest ones conceivable factors
2=no
3=no
6972=no
We know it is a prime, so we know all of its potential factors aren't it's factors
What really impresses me is the fact that he decided to print it.
As of the end of 2018, the largest prime number is 2^82,589,933-1
Any chance of a video on Germain primes?
yes
+Sean M would be fun just to hear them struggle with pronunciation
Excellent video. So engaging, so informing, so entertaining ! The faces Matt pulls are so funny. In fact, I would put them in the "Flippin' hilarious !" category. And him printing the out the largest prime on 745 pages of paper (double sided) is just such a Matt thing to do. And it is not a waste of paper, he will take these volumes to talks, lectures, meetings, and people will look at them and wonder ... On a quiet Sunday afternoon, he will probably put his favorite math's journal aside and flick through these volumes and smile. (Don't worry, I would as well).
Can you guys make a video about the other competing software? Like the types of primes it finds and how it does it? Sounds interesting!
Brady's reaction at 2:01 though
why dont we run an program for 10 years wihile he is trying all the numbers and see what is the biggest number of prime numbers
2^2 - 1 = 3 (prime)
number in first position = 4 (not divisible by 3)
what am I doing wrong?
Marsenne prime: 2^p - 1 where p is prime.
@@sieevansetiawan4792 I can barely remember this, but not sure this answers where I went wrong.
Sie, Evan Setiawan. 2 is prime.
@@sieevansetiawan4792 mersenne*
Known to human kind
But not the actual biggest because there are an infinite amount of primes
Matt is so brilliant, gotta love his enthusiasm
He's so brilliant 18 + 29 is fiftyyyyishhh.... ahh 47 !😂😂
I must ask, what is the application of such a large prime? Could it become useful for encryption/decryption on quantum computers?
On quantum, probably not. But for classical, yes, because RSA
a very interesting video...something i didn't know...but something i always wondered how they did it...
i have 2 questions
1. what is the mathematical proof that lucas-lehmer sequence filters out prime numbers
2. what is the use of finding bigger and bigger prime numbers?
thankyou :-)
not exactly my field, but maths is always mindblowing and interesting, thanks for the great video Numberphile.
So 7 = 2^3 - 1, so the exponent is 3, so subtract 1 to get to the 2nd position for 14. 14 is a multiple of 7, so 7 is definitely prime. I got that. Therefore, 3 = 2^2 - 1, so we go to the 1st position for 4. 4 is not a multiple of 3. So 3 is definitely not prime. What did I do wrong?
Qermaq they are different types of primes.
3 and 7 are different types of primes? They're both Mersenne, no?
Plus if they are different, this video did not explain this in the least. It remains that something fishy is going on.
they mentioned in the end that it's a certain type of prime but they didn't talk about it in length. and yeah 3 is a Mersenne prime but i don't know how to explain it really. anyway it's not fishy lol the worst that happend was a mistake in one place
According to Wikipedia, the proof of the test assumes the power is an ODD prime.
Forgive me, for I am a physicist (impure, impure! the power of christ compels me etc etc). But what is the application for knowing such incredibly large prime numbers. Although I still think it is very, very cool in terms of human knowledge that we know of such large prime numbers...but do they have an real world or theoretical applications?
Impress the aliens.
+Michael Roberts Thumbs up for your introduction :)
(Not because I would condemn you, I'm not a mathematician, but because I appreciate the humor... Which I've probably completely deflated by elaborating on the sentiment, thus robbing it of its elegance. Please forgive me)
+Michael Roberts As said in the video, "It's all in the hunt." We don't currently have a use, but perhaps someday, the math behind it looking, a greater undertanding of primes or numbers in general, computational advances, etc. will all have benefited.
Jordan Lynch I think that massive prime numbers have a few uses already.
Mathematics always does this...it does crazy stuff and no one thinks it has any application, and voíla, 40 years later it's the key to success in an incredibly important theory for physics.
The multiple of 8191 that mod 8191 equaled 0 (not very amazing, as this works for any multiple of 8191, I mean the one in the video) is 16382 in case anybody was wondering.
This was the first Y-T video i ever watched, just about in its first week after being posted. Good to see it again in my recommendations 😊
...
...
but sadly the thumbnail is no longer accurate 😢
Takes world biggest prime number .
Divides it in 3 nearly equal parts🥺🥺
I know its not three equal parts still thats funny to me
Indeed
Dear Mr. Parker, please allow me to ask you, what is the biggest prime number up to which all previous prime numbers have been found. I assume that the hunt for big primes is leaving huge gaps of undiscovered primes. Thank you very much and best regards, Markus
Correct:
We know all the previous primes of various types. For example, whatever the current biggest Mersenne prime is at any time, we likely know all the smaller ones in that series of primes.
Ditto for any other family of primes (Sophie Germain, etc...)
What we don't necessarily know is all the primes in between those in the various series of easy-ish primes. We know approximately how many there are in any gap, but without testing exhaustively we never can be sure if we have them all.
So your question amounts to asking how far has anyone got doing an exhaustive search for primes starting from 2.
Apols if you already figured that out
How about 2^2-1? It does not fit the sequence...
1 is a special number
Frank Nelson Cole was the guy who factored (2^67 - 1) as 193,707,721 × 761,838,257,287. It only took him 3 years of Sundays.
I discovered the world's largest number, it's called Matt's Number or MN*
MN* is defined as the largest number found by anyone on earth other than me, plus 1...
Hi Matt
Musical Prime
if you list from 1 to 24 in colums in ms excel, then cary on counting from 25 on the next row down althe way to 48, then continue this patten in rows and columns, all the primes line up, and make interesting patterns. Then is you make every 5 rows a music staff then you can play the prime numbers on a piano keyboard. you can chose how long or short the note is and the tempo of course, It makes your brain hurt but an interesting tune!!!!!!!
have fun regards
Brian the novis (just out to have fun)
Great video! Prime numbers are so fascinating, I actually made a video proof about how there was no largest. We'll be looking for the next biggest one forever :D
Ryan Lochte explaining prime numbers
Now I've seen everything
update: the largest prime was raised, to 2^(82,589,933 − 1), actually this year interestingly enough
I love this topic. Please make more videos about prime numbers.
The primes of the form (3^p)-4:
5, 23, 239, etc.
The interesting thing about 239 is that it's the only prime number divisible by 239.
So what, you say?
Well then, why does everyone keep taking me that 2 is the only prime number: all they mean is that it's the only prime number divisions by 2. But you can say an exactly similar thing about EVERY prime. So what?
@@trueriver1950 There are some other primes of the form x^y-z
Right, so WHY does the Lucas-Lehmer test work?
I don't know.
Search it on RUclips u would probably find why.
Every prime number satisfy:. ******[(n-2)!-1]÷n=whole number****
Where:
n is prime number
Every prime number satisfy:. ******[(n-2)!-1]÷n=whole number****
Where:
n is prime number
Does the computer need gigabits just to store the single number, then, given its massive power of 2?
+IceMetalPunk Well, since in binary the number is just a series of ones (being a power of 2 minus 1), you could also just store the number of ones, which is 74,207,281. That way it takes a lot less space on disk, and when you need to do calculations with it you can simply write that amount of ones to memory (or possibly a slightly more complicated pattern, I don't know how memory handles numbers this large)
+IceMetalPunk If you download the prime number as a decimal digit as a .txt format, the file is about 21.7 MB.
*****
When written in Word, it's not the same as storing it as an integer. As a string, it takes 1 byte per character. That's not true as an integer. Consider the number 255, which takes 3 bytes as a string ("written in Word"), but only 1 byte as an unsigned integer (or "unsigned char", as it's called when it's only one byte).
J. van der Linden So then yes, it would need 74,207,281 bits (or 1 less? Numbers this big get my head confused :P ) to actually work with it. So representing the number in isolation would only take 27 bits (log2(74,207,281) ), but in order to do any calculations with it, which is necessary to check its primality, suddenly it takes about 74 gigabits of RAM XD Gotta love maths and great hardware. My laptop has 8GB of RAM, which (if we simplify and assume all of it is available for this number) means it only has 64Gbits...10Gbits less than I'd need for this to work. Of course, a laptop has never been suitable for high-end number crunching anyway...which is why my laptop slows to a crawl when I try to preview Adobe After Effects videos I'm editing...but that's getting onto a tangent :P
+IceMetalPunk actually TF can be done with the exponent, and the largest result before shrinking that you would need is 2p bits of LL + what other than the result is needed.
I understand that there are these algorithms to figure out if a number is prime, but how do you know that the algorithm will always tell you a number is prime or not?
+Derrick Wade yeah, this is just a proven to always be true like many things in maths. You don't have to check every single thing up to infinity, just prove it. And then computers don't make mistakes so it just can roll forever untill they find a better algorythym :)
I'm sure there are proofs out there that show exactly how the algorithms work. It would be interesting to see the work behind them.
+TheGrundigg actually they do.
+Derrick Wade First you prove the math, i.e. that it is a correct way to decide primes. That's the hard part. When you turn it into code you also prove that the code obeys the mathematics you proved before. This is not all that hard since the actual algorithm will be fairly simple and the optimizations are usually transparant (--> they only make things run faster, they don't change the behavior of the system or the outcomes)
+Derrick Wade I guess it has been proved somehow.
You guys apparently waste a lot of paper.
+Peter Andrews so any kind of mathematics is wasting of paper
+Peter Andrews Anything that requires paper wastes a lot of paper.
+physi ra I think you're getting me wrong. I study the sciences and maths at a rather intensive level and I also prefer to use paper. Now that's out of the way, understand that what I mean as wastage of paper is the lot of stuff they write on it in each video. They can provide cuts with Khan Academy style digital derivations and explanations. Explaining stuff like this is wastage of paper.
+Peter Andrews Any kind of resources used on enjoyment can be considered "wasted" according to your definition.
smonk hard no, unless you try to mistake my definition. What I'm saying is that they should use digital methods to explain stuff, and not waste so much paper writing stuff so sparsely. The recreational aspect of mathematics still exists that way, without the apparent wastage of so much paper. I said apparent because I really hope that these guys recycle the paper at the very least.
*Matt:* ”Well, it’s a computer. It’s got no
emotions.”
*Bender:* ”That’s discrimination 😡!”
As of May 2023, the largest prime number now is 2^82,589,933 - 1
Lol, this prime-search mission actually sounds an awful lot like bitcoin mining :D
12:12 Creeper says hi!
I mean I made a C program but it only goes for like 100000 after that my computer starts making noises... xd
He managed to find 126th term of that sequence? What guy Lucas was.....
They found the biggest prime number
What's that oh ok
The biggest prime number known to humans
I love watching these videos... Even at school the people which are concentrated in maths tend to not actually care about, or get excited by math. It just makes me happy to see someone else smile because of a property of a sequence of numbers...
not first
not impressed. next time jump on the video quicker and paste the word FIRST so you can shave off some more time. I don't think your dad will leave you money in the WILL.
givememore4free
Oh, my heartfelt apologies, Sir. And maybe my dad WON'T have to ;-)
My math expertise is limited to high school algebra. I was always pretty bad at math. And yet I find your videos so interesting! I could watch them for hours!
I love how the books are printed on brown paper
So much wasted resources and money. The computers could have contributed to medicine.
I think It's 47 instead of 46....?
How do you go from '5 x 2 = 10' to 'therefore 5 is prime'?
Okay y'all. I already posted this in the other video. I think if we all volunteer our computers to run this program, a few thousand of us working together can get Matt his record. All Matt needs to do is provide a link to get the software to run the prime number search program.
Come on numberphile fans, we can do this!
9:04 play in 0.5 X speed
Bruh
That number has got a carbon footprint thanks to Matt.
You should do Pascal's triangle and then highlight the multiples of any whole number. Four is my personal favorite, but I only tested 1-5 and with limit space.
I get cringes and feel extremely uncomfortable hearing the scratching sound marker makes with paper. Please can you use a small whiteboard and an ink sponge wipe/eraser. I love your videos but cant concentrate with that scratching sound every time you write something.
Wat
They do their best to avoid markers that make annoying sounds on the paper, but it can't always be avoided. The brown paper is the icon of their channel - they're not going to just get rid of it.
Tanbir Sohail the sensation you feel ic caused by the trigger mechanisim of ASMR when you hear a certain sound (for everybody its different) your ASMR
(Autonomous Sensory Meridian Response)
Me too, i get goosebumps