New largest prime number found! See all 41,024,320 digits.
Вставка
- Опубліковано 8 лют 2025
- 2^136,279,841 - 1 has 41,024,320 digits and is prime! Read all about the new largest prime number ever found: www.mersenne.o...
Huge thanks to Luke Durant, George Woltman and everyone at the Great Internet Mersenne Prime Search.
Get involve in the search for large primes! www.mersenne.org/
This is the breakdown of the maths methods used by the Great Internet Mersenne Prime Search: www.mersenne.o...
Here are the details of the test completed on M52 (the 52nd Mersenne prime). www.mersenne.o...
The old computer photo was of Alice Betsy and Donald Gillies in front of the ILLIAC I computer which found three record-breaking primes in 1963. en.wikipedia.o...
In 2016 I printed the then-biggest prime: • New World's Biggest Pr...
And I talked about the Lucas-Lehmer test to prove it is prime: • New World's Biggest Pr...
This is my Pi By Hand video which Daniel B also features in. • The biggest hand calcu...
Yes, pieces of Skylab (spacecraft, not dog) are in Esperance, Western Australia. www.esperance....
Keep an eye on A Problem Squared to see why I was recording somewhere between Perth and Esperance. podcasters.spo...
Huge thanks to my Patreon supporters. I bought Lucie and Steve pizza at Lucky Bay Brewing. Support me and I'll buy more beer for my family. Think of my family! / standupmaths
CORRECTIONS
None yet, let me know if you spot anything!
Filming by Lucie Green
Timing and moral support by Steve Parker
Editing by Alex Genn-Bash
Written and performed by Matt Parker
Produced by Nicole Jacobus
Music by Howard Carter
Design by Simon Wright and Adam Robinson
MATT PARKER: Stand-up Mathematician
Website: standupmaths.com/
What's that? You want the first 1,000 and the last 1,000 digits? Ok then.
88169432750383326555393910037811735897120735450906604106715637641242263069475684144172599034772328310883750973995977687416411861067989576855334864723995205060798449228721358061244076525539478775000439534750170154974576283410295848102383525535219220018019849855213682289354421233731941048436851937365086094936028711317471018571432064708199837306148628782571243013388625206173910274307646954181724489815008305937259728175843471969304505016010624205115241396117063758595818539722355781328791512832801883905761320993838905658296650552409138343183552227657748911779669750031093294093386744231619348351202551513084271500976680524602998030484860484032028378812274042189370786146986225083833180256124082952929091707884436572049502580821237700560065034341723563299580864533178881894890817148581725172201276201796923763182586106207328500056407876479535665919678190450758160463293878836864796419780569458825516434971724519669668448902003364676649856436358572985441582849317833496323027747555507286203346254829408
...
379917800074819834879174805544034190986430521374206285055121736821172730439885890696160696738793999689882023176568153106746504313606250642598076140813828315717419942537662944964306217371556136368352752973759780217936883138877627248808662700396663095279153973893902666086461616485583762677066904293427343455290492166513799179605246624655355275099116671949790439962847921294301305427953128314765939127728218346554896221997074614829104667188434513710908760262441958100654871778292588483687836525477866623456759406568413274257016253600215416101593545336364864016927856588259167176083248724260943143895526709760397223040669769164386169801147177769071911797791558053414248681988242398764524051454517822994048288203377834666172715887058758075640360627674534014864896061019562846339719171054887748917152381772467028804688715061941073872049488371255679127735992935698305082529421587975486852806517931459412567957568284228288124096109707961148305849349766085764170715060409404509622104665555076706219486871551
i was using that prime as my password, time to change it now, thanks luke
meh, we just take 8 first characters anyway... xD
too late, i already entered it🤣🤣🤣🤣
I was using it for my RSA-136279841 implementation (when an RSA bit number is so high it gives away the key) i gues that's why you shouldn't use mersenne primes for RSA they are way to easy to guess.
I was using it as one of the keys in RCA-encyption with my mum. I'll have to find a new one :(
ah, only digits! no letters or symbols? such amateur!
In base "2^136,279,841 - 1", this number would be written out as "10".
Is X in base X always 10?
@@ujocdod 2 in base 2 is 10, 10 in base 10 is 10
@@ujocdodYes
@ValidatingUsername Ok, thought so :)
imagine memorizing that many symbols
This prime was discovered the day after my number theory lecturer told us the previous largest known prime and had to correct himself with this new prime in the next lecture lol
That's actually great! I mean the fact that your lecturer is that updated with their knowledge!
Admittedly we’ve only discovered 52 Mersenne primes in the entirety of human history so it’s not like new ones are found every other week.
@@Xanthe_Cat
You were right just a few days ago I was thinking
Well, it’s been several years now … it’s about time they discovered a new Mersinne prime.
@@Jamineyam I mean after almost 6 years he was onto a good bet!
That's so exciting!!
If you were to write the latest Mersenne prime in hexadecimal, it would be a 1 followed by 34,069,960 F’s.
That's a lot of respects paid...
We should nickname it the "big effing prime number".
That's an F'ing huge number.
@@gcewingMersenne Primes are all big F’ing numbers. This one should be known as the Biggest F’ing Prime Number
@@NonFatMead … for now.
From hand to institutes with supercomputers to hobbyists with home computers to a hobbyist with a supercomputer
Next a supercomputer with a home?
Run time of 10:13, 613 seconds. Both 1013 and 613 are prime.
Edit: Can we call this 'prime time'?
That's honestly great
Dating primes? Meeting at the right time maybe?
@@honorarymancunian7433 Not so surprising, though. People tend to underestimate how many primes there are. Between 1 and 100 one in four numbers is prime. Between 1 and 1000 one in six is prime.
For instance, near 613, the numbers 607 and 617 are also prime.
@@porof5ercan
One must meet in the prime of their life.
@@stevenvanhulle7242 This one is weird: 127 and 113 are the first prime numbers with a difference of 14, from each other. I mean there are no other primes between them.
Casually doxing hundreds of thousands of phone numbers.
And passwords, bank PINs, vault keys, user IDs and account numbers. Matt should be more careful with what he puts online.
Lol that was funny, thanks for the laugh. Maybe even entire words that were used by shakespear.
bee movie script is probably in there somewhere
The list of who wasn't doxed is probably shorter.
@@abigailcooling6604 and SSNs
I did it. I watched it all the way through! Whenever I blinked I went back several seconds and kept going. I expect several awards going forward
I went back to when the numbers started scrolling, then started watching again but alternating which eye was closed, with a full open between each individual eye closing.
@@kierangrasby5728 efficient. Clearly you have outdone me!
@@kierangrasby5728speedrunner strats. Now get a 120Hz screen and watch it at 2x speed
How about the "69 likes" award?
I set the playback speed down to the lowest it would go - 0.25, so I would miss a digit. Took quite a while that way, and the guy's voice was very deep.
Soooo glad the last few digits didn’t end in “2”.
2:30 I don't think it's such a big deal to have seen every single digit of the biggest known prime number, there's only ten of them.
Reading a library isn’t impressive either, we learned everything on the wall in primary school
Luke Durant now suddenly has a meeting scheduled tomorrow to explain the electricity usage for the last 12 months in the data centers he manages 😂
Yeah, my question: who paid for all the computing time?
Luke Durant is (was?) the principal engineer of CUDA Software, NVIDIA.
Luke used publicly available cloud GPU time, spot pricing. Pretty impressive really. Sometimes the spot prices are very affordable and he took great advantage of that. Along with scripting to coordinate work distribution, starting new instances when the prices were "just right", and so on. GIMPS is very happy to have his contributions. His efforts progressed the search for the next prime YEARS ahead of where we would have been otherwise.
@@ytmadpooThat's incredible, thank you for sharing.
I'm glad people are thinking more about the cost of computation. Green Computing definitely needs to be a topic covered more frequently in computer education
Fully appreciating how precise the timing of the start/stop was
We already knew that Matt is good at waffling, but to be able to waffle for exactly 6:50 and hit all the key points in that time is next level.
Rats, I blinked and missed some of the digits.
You just need to watch it a few times and hope you blinks happen at different times
I'm pretty sure I saw the silhouette of a weeping angel in those digits.
You can just pause the video when you need to blink 😂
i read this comment and missed some digits
@@lazykbysEvery time a Mersenne prime is found, an Angel is made to clean out the Elysian Stables. There are many hyperhorses, and very much hyperhorse poop. This is the reason for their tears...😢
0:11 yeah I thought it was, glad to know someone was on the same page as me
i laughed way too hard at this
i mean, if someone showed me that and asked me if it was prime, i'd probably say "sure, why not"
I'm taking a number theory course at uni this year, and on Saturday 12th our professor brought up the largest known Mersenne prime during discussion in a lecture, only to rock up on Tuesday 15th and tell us they'd found this new one! So that's quite fun
are you at the same uni as @bengolden870 ? he said almost exactly the same thing!
The worst thing is that there are infinitely many primes bigger than this number
I was thinking of asking a snarky question of "Now is this the last one?".
Obviously it isn't. As you noted, there will always be infinitely more prime numbers left for us to discover.
Its more important that it is a Mersenne prime, so it leads to a Perfect number , and there is no proof that there are infinitely many perfect numbers ;)
@@TymexComputing if there are infinitely many Mersenne primes, then there are infinitely many perfect numbers too
@@amits4744 Dont think we know if there are infinite many Mersenne primes though... Believe mathmaticians think there is, but there is no proof.
@@amits4744 But there is no proof of there being infinitely many Mersenne primes. The Lenstra-Pomerance-Wagstaff conjecture posits that there are, but it's not proven.
I kept thinking: he must have a timer behind the camera, right? And yay, it was revealed! It's still so impressive how you can talk in one take, manage the timing, and envision how the visuals will be displayed, quickly enough to do it on the beach on vacation. Maths UA-cam legend 🙇♂️
He could manipulate the speed slightly. Easy Peasy
@@fantasia55assuming he was telling the truth about 1 bunch of digits per frame, it’s not the type of thing that can be sped up without losing information
@@strengthman600 someone should go in frame by frame to verify if there are, in fact 10,000 digits in each frame and if they are, in fact, the correct digits.
I would volunteer, but I am scheduled to cease existing sometime in the next 1000 years, so I'm not sure I'll have the time, sadly.
@@fantasia55a lot easier to pre-calculate the time and adjust the script accordingly (if scripted, which it probably is)
@@strengthman600probably adjusting his own speed slightly (most often by shortening gaps or more rarely lengthening them)
Cycling through the digits on screen is SO bad for the compression/bitrate on your face lol
My face!
Beard.
Looks fine in 4k :)
luckily switching to 4k fixes that problem - even if you don't have a 4k screen lol
I wonder if the compression will "steal" digits or frames or change/alter digits and introduce artifacts, in effect altering the theoretical number of digits displayed.
Thanks for taking time during your vacation to inform us!
Loving this prime content. Always of a high quality. Have a nice holiday, I was very excited to bump into Matt by chance at the TMBG concert and have since put the picture I took with him on my ClassPad such that it will comfort me during my upcoming Yr 12 Exams. Hope he enjoy his time back over here in the land of Aus
Luke really put finding the next prime number over mining bitcoin with all those GPUs, i respect that
mining bitcoin, or placing your name worldwide forever in the history books.... I'd do the same if I was smart enough.
The cost of the GPU time probably is more than the bitcoin he'd be able to mine.
People who are already rich do not need to mine btc
You respect what? It is objectively and undeniably the better choice.
Why not establish a blockchain where the challenges to solve are not hash functions, but prime numbers?
1:11 “UA-cam Compression Hates This One Trick!”
Increase your resolution if it happens to bother you. UA-cam automatically lowers resolution (on mobile at least) to compensate for high bitrate images which makes it worse but you can up the resolution and it's usually much better. Learnt that from watching the slomo bros channel.
If you pause a video in UA-cam on desktop, you can then use the '.' and ',' keys (period and comma) to advance one frame forwards or backwards in the video. That way you won't miss any of the digits!
oh damn, didn't know this works on youtube too. thanks
Didn't know that, so thank you! Will need to make use of that for this video tomorrow! 😎
I rather watch it in binary or hex ;-)
I'll bring an extra keyboard.
Can't wait to spend the next few months reading every single digit.
Beautiful!! Thanks for taking time away from your vacation to inform us of this important discovery!
Hope you enjoyed your vacation. Listened to this video on while in Dominican Republic. Always enjoy your math videos... please keep them coming.
Hi Matt! I’m doing my undergraduate senior thesis on Mersenne numbers and related topics, mainly because I’ve been a fan of math UA-cam for many years so obviously this is huge news to me. I’ll have to go and update my presentation I’m giving in about an hour!
It’s been an hour, so I assume you’re either giving it or just finished. How’d the presentation go?
how'd it go?
We are all curious
Also wanting to hear the update, I can only imagine the stress of updating with such big news so last minute.
Would love to say there was much fanfare but I guess not everyone is as excited by prime numbers as we are lol. Advisor agreed that it’s always cool to see new developments in your field of research.
If this number was read aloud at 4 digits per second, it would take about 17 weeks.
There's a corresponding perfect number right, any idea how long that would take? (wikipeda says it has 82,048,640 digits)
@@hens0w It would take exactly twice as long so 34 weeks
@@deathschi_ ????? It’s an 82 million digit number, so it’s twice as long, therefore it will take twice as long to read. How long it takes to read depends on how long the number is, not the value of the number itself.
no its not@@randomcoder5
@@randomcoder5 good point
Actually I’m pretty sure that’s divisible by 17
You can disprove your own statement with the information taught in this video!
Fermat's little theorem states that a^(p-1)≡1 (mod p), which means that 2^16≡1 (mod 17).
It follows that 2^136,279,841=2 * 2^(16*8,517,490)=2 * (2^16)^8,517,490≡2 * 1^8,517,490≡2 (mod 17)
So our prime, 2^136,279,841-1≡2-1≡1 (mod 17).
The remainder is nonzero, so the number is not divisible by 17.
And this is why we love Fermat's little theorem.
Ok this is nicer than my proof
but here's a question: is 2 a primitive root for infinitely many primes?
@@thisnamewastakentoo_ 💯 but not e…… obviously
@@davidli719 I know, I was making a joke
@@samreid6010 Be aware that all jokes on this channel have to be mathematically accurate, or within a Parker approximation of accurate.
The compression algorithm must love this video
Happy for Luke! The sheer, raw compute power that Luke brought on the table for the project is hard to describe, but beautiful to see while it happened during the last year.
Congratulations, well deserved!
I like the idea of using this number in this way to make static noise.
Except it isn't random noise. It's predictable.
@@scottgriz It needn't be random - its just visual noise. I like it specifically because it's not random, because it is specific and particular.
I love how it visibly affects the video quality when you start streaming the digits due to the video compression being negatively impacted by the randomness that is all those digits rapidly changing.
Wake up babe, new prime number just dropped!
69th like
That is how I would wake up any potential partner. X3
Hurrah, Mr. Parker -- thanks for this! A genuine reason to celebrate!
Yoooo Matt I ordered your books and I love them. Thank you!!!
THATS PRETTY BIG
THAT'S A LOTTA NUTS
for you.
I tried putting it into my calculator to try dividing it by 3, but it was too big.
It's average.
@@CKyIeWas creating a heuristic for finding prime numbers part of your plan?
Honestly that is the perfect location to talk about this in
A few times a year I check in to see if a new prime was found at GIMPS. A few times in the past I did my own searches for much smaller unknown primes and found 3 different ones that were temporarily on the top 5000 primes list.
The YT compression algo went nutty when you started showing the numbers
Thanks Lucy and Steve!
UA-cam's compression is STRUGGLING with the number display!
First human to see all of the digits!
(Probably- randomly happened to go to UA-cam the moment the video dropped and have been pausing each time I need to blink)
Now, do you remember them? :D
The compression algorithm really struggles when the number starts scrolling by
Bitrate is king.
Great video. Thanks for your coverage during a vacation.
The bitrate makes this look cool when the number is scrolling.
Congrats! This is huge news! We now also have a new perfect number as a result of this!
Edit: First ever Mersenne prime exponent with 9 digits
Current goals for PrimeGrid-related programs: Find the first ever Wall-Sun-Sun prime, third Wieferich prime, third Wolstenholme prime, fourth Wilson prime, and the sixth Fermat prime
Other current goals: Find the first ever composite Fortunate number
Current goal for 196: Be the first ever Lychrel number in base 10
I'd be happy if someone found the 1st Fleischer prime!
Is there anyone searching for an even perfect number?
@insouciantFox 6,28,496,8128 ... I think you mean odd. The consensus is that there are none, but this had not been proved. This annoys as Pure Mathemations like things to be pure.
@@robertpearce8394 I don't think there will be any odd perfect numbers. The first to prove that there is at least one of quasiperfect, odd perfect, or odd weird number will win a million dollars, which is a prize. To access to them, you must be a mathematician
@@insouciantFox
I think not . but if you find an odd one do let us know
Imagine you and your husband - after much hard work for the last few months - take a flight down to Australia for a few weeks with some close family/friends to have a small break away from work and life in general. You have a wonderful time exploring the local area, the beaches are beautiful, and you greatly enjoy going around this new area with your loved ones.
Then - randomly one day - while sitting around doing nothing of note back at your hotel room, you see your husband check his phone; his eyes light up as he starts speed-reading a news article. He silently and immediately gets up, sits down at his laptop, and rapidly searches for information on various mathematics-related news sites, before opening a Word document and frantically typing away at what you can only assume is a... script? But you're on holiday, away from all your responsibilities of work.
"Honey, are you okay? What's going on?"
He stops typing and slowly cranks his head around, only stopping once his eyes are perfectly aimed at yours. His expressionless face staring deep into your soul, his jaw loosens, and he says:
"They found it."
(This is my personal headcanon for the origins of this video, I'm totally sure it's 100% accurate description of how it went down lmao)
Where did you leave children for all that time?
How to get divorced in one easy lesson.
I think they’re camping on the beach down there not in a hotel room⛺️🏖️
I just bought the 39th mersenne prime book can’t wait for the 40th
This must be the most energy spent on finding a single number ever.
we got a new largest prime before gta 6
And Winds of Winter.
Tip: put the playback speed at 0.25 so you have 4 times as long to read each set of 4000 digits. Hope this helps!
This video is an interesting lesson on the properties of visual snow, randomness, and UA-cam compression algorithms.
Thanks Matt for taking time out from your vacation for that report. A new largest known prime number is always a noteworthy event.
I sometimes have a recurring nightmare where there’s something so uncontrollably and overwhelmingly big and it’s too much to handle, this video gives the same vibes. Even a single frame in this video is more than I can imagine. Like my heart rate is up just from watching this
Geometric nightmares
@@railroadisolationist5452 yeah I’ve heard them being called that although I’d describe it more as a mountain or planet rather than a shape
8:05 I was kinda hoping the last digit was a 2
yeah. maybe next time
Parker prime
2 raised to the power of any positive, whole number is an even number and all even numbers end in an even digit (0, 2, 4, 6, or 8). Subtracting 1 from an even number will always give a number that ends in 1, 3, 5, 7, or 9 (an odd number). So, it would have been impossible for this number to end in two.
Also, we know that because the number is prime, it cannot end with the digit 2, because prime numbers can not be even (except the for the number 2 itself). If a number is even, it is divisible by 2 and therefore not prime.
So not a prime..
Can somebody check if the digits add up to a multiple of 9?
"ends in 551", would have been fun if the end is "552"
Every Mersenne Prime number >3, can be written as 6x+1, where x is a positive integer.
Yes, but this is not determinative of primality since *any* odd exponent (prime or not) will yield a Mersenne number (prime or not) which is 1 (mod 6).
Props to you for writing and reciting your script to fit the digit clip length so smoothly.
I love that it was discovered by an engineer annoyed by the misuse of GPUs for AI
So he misused GPU's because he was annoyed with people misusing GPU's?
The only valid use of a GPU is to play MY LITTLE PONY: A Maretime Bay Adventure
Oh!!!!! We THOUGHT it looked like Esperance!!!
It's such a beautiful place!!! Enjoy your stay here in Australia hehehe~
Yes! No mistaking it! Beautiful white beaches and rocky islands!
UA-cam's compression algorithm is like: "what the heck?!"
Bitrate: And I took that personally
can we just take a moment to congratulate Matt on that excellent timing announcing the end of the sequence. I was trying not to blink and I don't think I missed any video cuts. Kudos.
Congrats to the GIMPS team! I was a member of the team for five years back in the mid 2000s, and I'm exceedingly proud of the entire team. Of course, congrats to George Woltman and Mihai Preda who wrote the GIMPS software for graphics cards, also kudos and congratulations to the official winner, Mr. Luke Durant, Aaron Blosser, and everyone who contributed computer time, as you all share in this world record. All good wishes, my friends!
But is it numberwang?
The running numbers are crushing the compression
Sorry for the delayed reply, it was difficult to concentrate on the actual numbers whilst you were talking, so I had to replay that whole section, but I blinked too many times, so I kept pausing it before blinking.
This all took a while and I couldn't be sure I'd seen them all so I repeated that entire section, at 0.25 speed, and muted (to eliminate aural distraction), and with a pillow case covering your portion of the screen (to eliminate visual distraction).
I've done as asked, I've seen every digit, and you know what ... I found my date of birth in there - 071171 (November not July) - and this is the 7048th prime. I'm taking a quick break to take some paracetamol and to write this before I start looking for 898409 - the 71171th prime - I'm certain it will be there somewhere.
Enjoy your hols, Nottingham is currently quite cold.
what a time to be alive! and people still think there’s nothing else to be discovered…
Thanks for giving us the news!!
A number so large it ruins your bitrate.
It's like watching someone play Vampire Survivors, but you're fighting a prime number instead of vampires.
Squint at the scrolling digits 'Magic Eye' style and you will see something amazing
5¾ years! 50 million powers of 2 with no Mersenne primes!
Great content, thank you for interrupting your holiday for this. I hope you enjoy your well deserved beer and days at the beach.
I saw from the thumbnail that you were at Twilight Beach in Esperance there. Nice to see the sun out!
Beautiful beach!
That’s quite big.
Question: does the fact that we now have this biggest prime, and previously we had a - smaller, obviously - biggest prime, also mean that we know there are no more primes in between these numbers? Or does the methodology mean you are forced to skip all kinds of (non-Mersenne?) primes in between?
I think it's likely that many non-Mersenne primes were skipped in between.
I think there is always a prime between N and 2N (except for very small N) but I don't remember who proved that.
The Mersenes are primes in base two.-1
And in that base, they can be represented by a series of ones .
In base 10 we found a few such numbers 11, 1111111111111111111, 11111111111111111111111 and a small handful of others repunit primes in base 10
There are a list of generalized rep unit primes in various basis. I’m interested in generalized rep unit primes in prime bases ( other than the Mersenes)
Question :
If you know the rep United primes and say base seven and also know the rep unit primes in base 11 can you use this information to predict the rep units primes in base 77?
@@robertunderwood1011 That's way above my prime-knowledge paygrade 🙂
As close to aleph-null as the former record prime.
I always love finding out you are in WA randomly
Hi Matt, the first link in the description goes to an outdated press release from 2018, just to let you know... thanks for the excellent video!
Even with powerful computers, it's crazy we can verify something this large is prime. That's a very, very large number.
Is the last digit 0,2,4,6 or 8? Nope, ok onto the next check.
@@ianstopher9111 Congratulations! You've narrowed the search from 2^136,279,841-1 numbers to test to 2^136,279,840-1 numbers to test!
Needless to say, it's a bit more complicated than that, heh. Raising 2 to such an incredibly high power is mind bogglingly large.
So they found the new Optimus Prime
Optimus Prime is Optimus's derivative
Or Optimus Double Prime's antiderivative.
what's the largest prime number where we know all the prime numbers up to it? doubling your number every time before checking it misses a lot in between
What do you mean by "know"? Primes have been calculated up to at least 2^64 = 1.8 * 10^20 but storing all those would take exabytes and more of storage, and there is no real point to store them. Those we need to use again are almost always faster to calculate again than retrieving from storage.
If you mean how high do we know the exact number of primes below that limit, then it is: 10^29, there are 1,520,698,109,714,272,166,094,258,063 primes below 10^29.
So this is tiny compared to the new prime, only 30 digits compared to 41,024,320 digits.
@@Einyen I'd never have thought that storage space rather than processing speed would become the limiting factor in enumerating the primes, but yeah, actually that makes perfect sense.
@@alexpotts6520 can't compress a prime number, yeah
@@alexpotts6520 Yeah, exactly. From the prime number theorem there are roughly n / ln n primes below n.
So for example near 10^20: ln (10^20) ~ 46, so roughly every 46th number at that size is prime on average, and there are A LOT of numbers around that size, so even 1/46th of them is still A LOT of primes, far too many to store on any storage media we possess.
@@Einyenstorage media is not that expensive for storing raw numerical values like this. 2^64 ≈ 18.4 quintillion (18.4 x10^18) and if stored in binary representation, you could fit 128 such prime numbers in just a single kilobyte. For those wanting every possible Prime below a certain threshold, particularly those that are not Mersenne primes and are computationally expensive to find and prove, storing them makes a lot of sense.
I don't want to sound strange, but for me, I understand this as: INDETERMINACY Of-All A.I. Measurement ---> To measure the POWER, true potential, of the Artificial Intelligence.
Thank you !
Great videos and great news.
All of the digits in binary are:
1
Or 0.
@@MathewWalls No, it's 1 less than a power of 2, so it's all ones.
Should have printed the binary number instead 😂 a lot easier for the compression algorithm…
The hexadecimal would be even better
@@Dimitri_gdr ffffff …… 🤡
What a coincidence! Today they also found the largest perfect number that is knowm
The YT compression algorithm is having a stroke
Imagine there are twin primes bigger than this number.
Imagine printing this prime number out, only to discover it's the first of a set of twin primes.
The next video should calculate how many times the average human needs to watch this video to see every digit.
It would be a great way to boost views as well as being amusing.
yes
There‘s an error in 3:07 . The leading 4 should be a 7…
🤓
Yes.. and the last digit should be 9 😂😂
Easier to remember the digits when written in binary
Then the jokes switch from "hey that fifth nine in frame 806 should be a one" to "oh jeez i think you missed a one over on page 7375."
it's still quite easy to remember the base10 digits if they're not in order :p
It's only slightly less easy to remember all the digits in base 16
oh god the bitrate
Thanks MAtt, helps a lot!
Sorry to be that guy but i spotted a misprint at 6:06. There should be 6 instead of 9 in row 16. You're welcome!
there's no way that actually happened, matt should have double checked the number before uploading!
it's a parker prime
It wouldn’t be so bad if it was only a single case of "sorry to be that guy" but there’s easily a dozen of you in these comments who've *all* tried the same unfunny joke…
@@Xanthe_Cat dang let people have some fun!
If you're trying to find the largest prime number would it not be easier to count backwards from the end instead of keep counting upwards to find more?
Now, How long of a continuous PI sequence can you find inside that?
The decimal expansion contains 3141592, but not 31415926
Well, the whole thing is a sequence of the digits of pi, just not starting at the beginning.
There exists a base where all of the numbers are pi.
@@TymexComputing now this I like!
Almost certainly that sequence of digits appears somewhere in the decimal expansion of pi. Moreover, the binary expansion of pi should have a sequence of at least 136,279,841 1s, but good luck finding the first occurrence.
2^136,279,841 - 1 is the small prime factor of TREE(3) - 1
"smallest"
It's actually 10 if you use my new base
You should display it in base 2.
Then the video would have to be more than 22 minutes, 42 seconds... 😅
This would solve the compression bit rate problem.
Display it in hex, like a normal person would use.
"Write a Mersenne prime in hexadecimal to pay respects."
@@ianstopher9111 1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...