Home Creators Posts Import Register Favorites Logout
haven't archived this post yet. have a subscription? use the importer!

Content

Hey everyone,

The third in a little sequence I did with Numberphile about patterns which eventually break is now published. This one is about racing prime numbers in different residue classes, with an intuition for why some of these classes seem to have a systematic advantage.

For those curious about this topic, I highly recommend this expository paper by Andrew Granville and Greg Martin: https://arxiv.org/abs/math/0408319

Grant

Files

Previews only

The Prime Number Race (with 3Blue1Brown) - Numberphile

Grant Sanderson discusses a race between two types of prime numbers - and an unexpected result. More links & stuff in full description below ↓↓↓ See all three videos in this series - Grant's Prime Pattern Trilogy: https://bit.ly/PrimePatternTrilogy Grant's own false pattern video: https://youtu.be/851U557j6HE Grant's channel is 3Blue1Brown: https://www.youtube.com/c/3blue1brown More Grant on Numberphile: https://bit.ly/Grant_Numberphile Grant on the Numberphile Podcast: https://youtu.be/A0RH93XvSyU Numberphile is supported by the Simons Laufer Mathematical Sciences Institute (formerly MSRI): http://bit.ly/MSRINumberphile We are also supported by Science Sandbox, a Simons Foundation initiative dedicated to engaging everyone with the process of science. https://www.simonsfoundation.org/outreach/science-sandbox/ And support from The Akamai Foundation - dedicated to encouraging the next generation of technology innovators and equitable access to STEM education - https://www.akamai.com/company/corporate-responsibility/akamai-foundation NUMBERPHILE Website: http://www.numberphile.com/ Numberphile on Facebook: http://www.facebook.com/numberphile Numberphile tweets: https://twitter.com/numberphile Subscribe: http://bit.ly/Numberphile_Sub Videos by Brady Haran Patreon: http://www.patreon.com/numberphile Numberphile T-Shirts and Merch: https://teespring.com/stores/numberphile Brady's videos subreddit: http://www.reddit.com/r/BradyHaran/ With thanks to our patrons, including: Juan Benet Jeff Straathof Ben Delo Andy B Ken Baron Michael Dunworth Kannan Stanz Heather Liu Gnare John Zelinka Ubiquity Ventures Ron Hochsprung Jeremy Buchanan Nat Tyce Matthew Schuster RAD Donato Andrei M Burke Ben White Yana Chernobilsky Steve Crutchfield James Bissonette Jubal John John Loach Doug Hoffman Mirik Gogri Alex Khein Bernd Sing Alfred Wallace Valentin Arnas Tracy Parry Ian George Walker Thanks C.J Smith for helping with error spotting.

Comments

Aman Karunakaran

Does the "number theorist's favorite way to take a logarithm" have an official name? I tried looking it up in various ways to no avail, and I skimmed the paper you reference to see if anything was there but I didn't see anything that looked similar (although I could have missed it, the paper was long and I skimmed kind of quickly!) I'm very curious about the proof sketch for such a theorem, it seems so out of left field.

Richard Kalhöfer

I think, you expand the series using the Euler product and if the condition that was mentioned in the video holds, then the factors resemble a geometric series, and so you can replace them by the corresponding fractions. The logarithm of that product is then equal to the sum of the logarithms of the individual factors and if you replace those with the Mercator series, you should be done.

Mike Jarvis

Fascinating. This seems worth turning into a more canonical 3B1B video with all the nice graphics working for you. Some of which are presented here, but not coupled cleanly to your voice over.

Anonymous

What are the points where it drops to zero? Some number in this region must be special in some sense. To be fair this is just an instant reaction I will go an look at the referenced paper. Thanks as always for an nteresting video.

David Terr

Fascinating video! I've known for some time about this bias, which is called the Chebyshev bias, and in fact holds for other modular classes of primes as well, such as primes congruent to 1 and 2 modulo 3, the latter of which has an edge. But ever since I first learned about this bias, I've been mystified as to why it holds. You explain it quite well in this video! I wonder how one my go about proving this fact, or other related ones.

David Terr

Another fact about primes that may be related to the Chebyshev bias is the Littlewood bias (I don't know if it's called that, by the way!), namely the bias of the prime counting function π(x) being usually smaller that li(x). In fact, I understand that π(x) exceeds li(x) infinitely many times, much like π₁(x) exceeding π₃(x) infinitely often. Are these facts related, and is there a known fraction of the time in which π(x) exceeds li(x)?

Anonymous

I feel like the Number Theory graphics person missed something when they didn't present each number as inset in a circle. 371119 run together in a confusing mess, whereas ③⑦⑪⑬ are relatively legible.