Pharoah
Wise One
 
Offline
Posts: 166
Illinois, USA.
|
The Riemann Hypothesis is about prime numbers. I am intrigued by it because it's so logicistally (sp.) simple.
The Riemann algorithm is I believe this (although I'm sure it's on the internet somewhere):
divide the previous prime number by the recipricol of the logarithm of it
That should get you to the next prime number, but I'm not sure. Gauss and Legendre did a lot of work with it, they're mathematicians.
Hm, maybe you can make a C++ program to attempt that?
(Just in case you don't know, a prime number is a number that can only be divided by that number and one, such as... 5, 7, 11, 17, 29, 37, ect., the opposite of a prime number is a composite, which is a number that can be divided by another number, such as 2, 4, 6, 8, 25, 49, ect.)
There's a dispute in mathematics about whether or not 2 is considered a prime or composite number.
|