As you start getting larger and larger numbers, primes show up less and less. The Riemann hypothesis is that there is some pattern, some formula to the distribution of prime numbers.
The Wikipedia page lists various consequences. Mostly things that will not mean anything at all to a layman. The other thing is that claims that “all of modern mathematics” hinges on the Riemann hypothesis are extremely overblown; it’s mostly consequential to number theory, which is something many modern mathematicians work on/intersect, but there’s also many who never touch it and for whom the Riemann hypothesis being true or false changes nothing.
That’s some black magic math that lets you take a pair of big primes. Keep one for yourself, give the other to the world. You can then encrypt or sign things with your number, and everyone with the public prime can decrypt or verify that you signed it. And vice versa, people can encrypt things that only you can decode.
As I recall, it all relies on the fact that it’s a lot of work trying to find suitable primes for this. Knowing the pattern to how often primes occur can make it easier to break. This proof only predicts how many primes we’ll find, so it’s the basis for it.
Best guess, I can say that a lot of mathematical profs work by looking for the simplest description, then building up from there. Primes are as mathematically simple as it gets, so its kinda important to keep in mind there’s “simple” numbers hiding out there in the unthinkably large digits.
So there are prime numbers, that are only divisible by 1 and themselves. Here’s a set of all the prime numbers bellow 100:
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
As you start getting larger and larger numbers, primes show up less and less. The Riemann hypothesis is that there is some pattern, some formula to the distribution of prime numbers.
So if there is a pattern and you had the formula, you could predict which arbitrarily large number is going to be prime. Otherwise, you just have to find a big number and check if its divisible.
The other poster said a ton of math is built upon that idea? Like what and why?
Sorry I know asking this is alot, im just curious.
The Wikipedia page lists various consequences. Mostly things that will not mean anything at all to a layman. The other thing is that claims that “all of modern mathematics” hinges on the Riemann hypothesis are extremely overblown; it’s mostly consequential to number theory, which is something many modern mathematicians work on/intersect, but there’s also many who never touch it and for whom the Riemann hypothesis being true or false changes nothing.
We love using big primes for public key cryptography.
That’s some black magic math that lets you take a pair of big primes. Keep one for yourself, give the other to the world. You can then encrypt or sign things with your number, and everyone with the public prime can decrypt or verify that you signed it. And vice versa, people can encrypt things that only you can decode.
As I recall, it all relies on the fact that it’s a lot of work trying to find suitable primes for this. Knowing the pattern to how often primes occur can make it easier to break. This proof only predicts how many primes we’ll find, so it’s the basis for it.
I wish I knew for sure, but I don’t.
Best guess, I can say that a lot of mathematical profs work by looking for the simplest description, then building up from there. Primes are as mathematically simple as it gets, so its kinda important to keep in mind there’s “simple” numbers hiding out there in the unthinkably large digits.