Quote:
Originally Posted by Digital Concepts
Nice try Ron.
It would be nice to win $100K so keep at it.

It appears by a limiting technique on an algorithm of finding a kp=2^(p1)1,
(try finding k of kp=2^(p1)1, with 5,7,11,13,...by a method of accumulating a continuous sum of powers of two for the product, and step by step, filling in the powers of two for k. The limit involves p.)
ie fermat test , that 10,001,631 is prime, unless pseudo prime:
Anyone wish to find a witness,etc., or show (10001630)!/(10001631) is even,
if no witness occurs(tough) or the above division is not even, then the number IS prime.