You wont understand it. It is related to the field of cryptology, and the use of prime numbers. Say I found a prime number with 54 digits, and used that number as a code overlay to my message to encyrpt it. I wouldn't want my enemy to know that secret 54 digit number, nor to be able to find it.
The prime number theorem allows one to figure the probablity to guessing the number, knowing how many digits it has. With the probability, one can figure out how long a super computer can iterate through all numbers around 54 digits, so it puts a limit on how that code can stand against the greatest supercomputer. One would like a time on the order of 3000 years to break the code, that is long enough.
The Reimann Hypothesis allows for the calculation of a "zeta" function value, which with the Prime number theorem, gives a good probability of finding the prime number.
Now if one is in the code breaking business, it has another importance.
What is the Riemann Hypothesis? I've looked it up on Google but don't completely undestand it.
-MC
3 answers
Wow...
-MC
-MC
This hypothesis was used in one of the episodes of the TV show Numb3rs.
http://www.tv.com/numb3rs/episode/383244/summary.html
http://www.tv.com/numb3rs/episode/383244/summary.html
3 answers