Paterson Primes (with 3Blue1Brown) - Numberphile

Video quality	The size	Download

Информация о Paterson Primes (with 3Blue1Brown) - Numberphile

Название	:	Paterson Primes (with 3Blue1Brown) - Numberphile
Продолжительность	:	10.35
Дата публикации	:
Просмотров	:	239 rb

Part 2 is at: youtube/NsjsLwYRW8o --- And Grant's own false pattern video at: youtube/851U557j6HE
Comment from : Numberphile

A real Parker Square of a system if you ask me
Comment from : willo chan

how they fool ya
Comment from : maricaomaricon x

I come after using chatgpt 😊😊
Comment from : Prakash Ved

1:15 bERROR!/b They left the 17 there without even changing it to a 5💀
Comment from : Scrolte

So some of the numberphile videos with Ben are shot at Brady's place But these seem to be over at Grants
Comment from : MrVipitis

🤧
Comment from : Nge Htwe

Fascinating and now I'm wondering about the relationships between other bases Is there any base for which this holds? Or a base for which the list of eliminated factors goes much higher?brbrMight have to go write some code
Comment from : Thomas Rosebrough

🙏
Comment from : Nge Htwe

So there are two possibilities for the result: either it's a Paterson Prime, or it's a Parker Prime 😆
Comment from : Lucas Cardoso

Patternsome Paterson
Comment from : Minor Edit

Dam, Grant held a grudge on Patrick for so long that he made a math video to make fun of him
Comment from : bighammer

Does anyone know how long the longest string of paterson primes might be? in other words how many primes can you possibly generate using some prime number as a seed using this method?
Comment from : Ferdinand Grünenwald

Paterson or Patterson
Comment from : Dupermirrors342

1:17
Comment from : paper paper

A reasonable conjecture would be: given any m>n positive, there exists a prime p such that the n-ary expression of p interpreted as m-ary, is not a prime
Comment from : namus

So much editing for part 3 I bet it's going to be amazing!
Comment from : the box

By the way, you said it doesn't have the immunity from 11, but the divisibility test for 11 implies that having the larger number divisible by 11 requires either at least 9011 (with the larger number equal to 2030303) or for the larger number to be divisible by 5 (If you can't see why, remember that 5 is 11 base 4)
Comment from : BTF_Flotsam

1613?
Comment from : Kaset Bajakan

60 of products are used ones
Comment from : Venky Babu

Parker moment
Comment from : SammyB

HEY I’m waiting for the 52th Mersenne prime😂
Comment from : Gardener

There’s a mistake at 1:17 in the video It says 17 is “11” in base 4, but you were converting 5 to base 4 at the time
Comment from : Joshua Lehrer

This is more personal I like it
Comment from : zaco 2121

Why do both PPs and composite numbers appear in such significantly strong waves, even at very high input values?brAt lower input values, waves of successive composite outputs seem significantbrAnd at higher input values, waves of successive PPs still keep coming surprisingly frequently
Comment from : pepe briguglio

Refreshing Video to watch A wealth of numbers , fluently if not lyrically narrated and keyboard soundtrack From what your saying, increase the base and you increase the number of primes ?
Comment from : tom bufford

I highlight one mistake at 1:19 You write 17 base 4 equals 11 But you mean 5 base 4 equals 11
Comment from : Αλέξανδρος Απειρωτάν

This begs these questions though: What is the longest string of Patterson Primes? (A string being a prime number goes in, and a prime number comes out as the seed for the next Patterson Prime) Does it happen in the low numbers? Does it exist in the 'big' numbers? Is there an infinitely long string of them? are there an arbitrarily infinite number of infinite Patterson Prime strings?
Comment from : Lynk _

I don't know if anybody has pointed that out already, but there's a mistake @1:16, they are talking about "5", but the video is still showing "17" from the previous example
Comment from : Gias S

I'm guessing Paterson as a child didn't come up with this on his own I wonder how long the idea had been around
Comment from : UpAndOut

as the non-math paterson of the family, i understand none of this but love that my brother and grant do
Comment from : Katherine Tucker

Loved that outro music on there to the Paterson Primes scrolling by :D
Comment from : Charles Van Noland

I feel like we have definitely observed an increase in Grady’s mathematical abilities/confidence over the years of him conducting all these wonderful interviews Love to see it!
Comment from : Russell Schwartz

I'm jealous of Grant for having had friends like that in high school, who could just talk about nerdy math stuff That's the coolest kind of kid
Comment from : Vigilant Cosmic Penguin

I wonder if Mr Patterson will end up watching this video
Comment from : Daniel Bickford

This guy is like the Leonardo DiCaprio of geeks
Comment from : ugiswrong

Are there infinite Paterson Primes?
Comment from : VigEuth

1:40 Seeing the scrolling stop just before 31 was pretty funny
Comment from : Lapis Carrot

A Patent for Math, is that UK only?
Comment from : NatNiks

I do have one question about thisbrwould it be possible to find a base that improves this method so it excludes 2,3,5 and 7?brI doubt it but I had to ask since there's a chance that it exists
Comment from : WilliamWizer

When are we going to get a video featuring a shirtless Grant?
Comment from : Paper Waves

How about plotting the currently biggest primes, into this rule? Will we be lucky? Do even bigger primes pop out?
Comment from : Jóhann Ingi Ólafsson

❤❤
Comment from : Shane Spencer

The Patrick Paterson Patented Prime Producing Process
Comment from : Jackson Starky

Just because this is an imperfect prime number predictor, does that mean it is a bad one? For example, could you try this process on the 10 largest prime numbers known to man and see if it finds a new, larger one?
Comment from : Christopher Boyd

what is elegance in maths anyway
Comment from : That Should Work

Pity he didn't do it with base 6, he would have avoided the factor 7 as well
Comment from : JavSusLar

I love that as an aside Grant explained the rule for finding if a number is divisible by 3 or 9 I've been using that fact for almost two decades and had never thought to ask why it was true
Comment from : Edward Berryman

Grant's eloquence and conveyance of mathematical principles is near unmatched
Comment from : Caleb Voisine-Addis

Grant had a major glowup haha
Comment from : Ethan Buttimer

Not only is Grant one of the greatest math educators out there today, but he's also getting hella swole
Comment from : theantonlulz

Converting from base 24 to base 5634 works for the first 17 primes (4 to 10 only for the first 10) and produces some pretty large primes, like:br277 to 61987 to 715685960827 to 6093125672235600646607486318497
Comment from : Fejfo

I did this for decimal to binary a few years ago and discovered a primality test Turns out it Fermat had already found it
Comment from : Steve Spivey

Are there any larger primes that will never appear as prime factors of a numbers that this method produces?
Comment from : Thousandemon

Waited for this collab for ages
Comment from : Rajeev K

Grant 🥰🥰
Comment from : Amy Caspit

Okay, we need Neil Sloane to get to work finding the longest string of Patterson Primes he can The rule is: start with a seed prime, do the Patterson Conversion, and if it's prime, convert that, and so on until you run into a composite What's the largest number you can find that can be reached this way?
Comment from : sephalon1

Hi brother I will send 1chart to you plz tell me next what will come sir
Comment from : prasad Indla

Can we talk to the now famous Patrick Paterson? Would like to know more to see if this inquisitive young man is doing well
Comment from : Roger Carl

Missed opportunity with the alliteration Should have called it "Patrick Paterson's Patented Process for Picking Primes"
Comment from : Ryan Lowe

What is the music in the end? Shazam seems to think it is Anton Ishutin - All I Can See But I'd love to have the exact version that in this video
Comment from : d4slaimless

That was a really fun video Very relatable
Comment from : Bentation Funkiloglio

Sanderson-Krieger collab when
Comment from : glum hippo

It makes me wonder if there are some number that used in the please of four in this algorithm you get more prime numbers?🤔
Comment from : Skytalez

As soon as I see a video with the love of my lif- I mean 3blue1brown I have to click immediately
Comment from : Richard

Finally, a worthy opponent for the venerable Parker Square!
Comment from : Lucas Treffenstädt

1:30brHas to be a limit
Comment from : Mike

"slightly more subtle"
Comment from : Alex Port

endgame: We had the best crossover ever! brNumperphile and 3Brown1Blue: Hold my brown sheet, please!
Comment from : Jafar M

So which prime starts the longest”Paterson Prime Path”
Comment from : Rhoddry Ice

Can one make a Parker square with Paterson primes? 🤔
Comment from : Mirador

Even if it were foolproof, it still wouldn't be a very useful test of primality for the number you started with because you'll have to know if the larger, more "difficult" number is prime or not As a way to generate primes from a known prime though, it would be pretty great
Comment from : Josh LZK

This guy's super cute
Comment from : Brian Brecker

I love 3Blue1Brown ❤
Comment from : 15october91

5:18 shouldn't it be 1 is 10 mod 3?
Comment from : Richard Kok

People: bInvents numbers/bbrAlso people: Bah gawd, the numbers
Comment from : TheMADGUY50

me when my favourite numbers (607 and 67) for reasons unrelated to math happen to be both prime numbers
Comment from : Xcyiterr

0:22 nobrbrThe brPatrickbrPatersonbrPatentedbrProdigious brPrimebrProducingbrProcess
Comment from : Janek

How do the lengths of unbroken Paterson prime chains behave as the value of the initial term increases? What is the limsup thereof?
Comment from : Curtis Franks

Brady and Grant collaborating again: great! 👏🏻
Comment from : Peter Andersson

😎😎😎😎
Comment from : Riemanns Last Theorem

1:17 17 in base 10 -> 11 No They wanted to write 5 -> 11
Comment from : Matthias Koschi Koschnitzke

It's good how the modern nerd hits the gym now
Comment from : tbird81

Would be interesting to see whats the longest recursive chain of paterson primes you can generate
Comment from : Nadir Reuter

I am sure Marsenne got one Paterson in his conduct:)
Comment from : TymexComputing

This is absolutely astounding! I have been working on a very similar version of this for several weeks now Except it's much bigger in scope I am fairly certain I know why 31 fails brI have been studying what I call zones of Naomi A YouTube comment is a touch too small to go into detailbrMy current record prime found is over 12k digits in length and it looks very cool indeedbrI suppose it's about time for me to start making videos
Comment from : gpercent