This is funny. I love watchin boogerchevy cut-n-paste from 4x4 forums and post questions here like he knows what he's talking about.
On a related note....Has anyone come up with any good input for finding the smallest Riesel number?
------
The Riesel Problem: Definition and Status
In 1956 Hans Riesel proved the following interesting result.
Theorem:
There exist infinitely many odd integers k such that k.2n - 1 is composite for every n > 1.
Actually, Riesel showed that k0 = 509203 has this property, and also the multipliers kr = k0 + 11184810r for r = 1, 2, 3, . . . Such numbers are now called Riesel numbers because of their similarity with the Sierpinski numbers. The Riesel problem consists in determining the smallest Riesel number.
Conjecture:
The integer k = 509203 is the smallest Riesel number.
To prove the conjecture, it suffices to exhibit a prime k.2n - 1 for each k < 509203. A reasonable approach to the problem is to determine the first exponent n giving a prime k.2n - 1 in each case. So we can observe the exact rate at which the 254601 multipliers k < 509203 are successively eliminated, which may enable us to predict their further decrease by extrapolation.
__________________
<({O})>
Fishing Again.
|