|
Hi,
My name is Diogo. I live in Brazil. I maid an
algorithm in C/C++ that:
1) Verifies if a number 'n' is or isn't prime. If
YES, ok, there's the prime. However, if NOT
2)Verifies the same from 'n + 1' until discover the
next prime after 'n'.
Inserting some conditions, as verifying the
divisibility by 3, 4, (other than 2), and computing products between primes,
isn't this algorithm will discover some prime with 10 million digits in
approximately 1 year?
Answer me if possible.
Thank's,
Diogo Chadud Milagres
skype me: chadud
|
_______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
