in reply to Finding Primes
Task: to find two prime numbers whose product is a 400 digit number.
This
is the product of a very well known 386 digit prime, 2**1279-1, and a somewhat less famous 14 digit prime, 98264582985493, one of the known 14 digit prime divisors of Googolplex + 10.1022731116849984128382970140461725893199 2883532546140280576806704317960648119367 2377124699979471607606314465365589539394 1805302550414778332749072722843441732197 4205545703859751798082548809071278533442 1766932914859818046781739244057376689689 2255723329228491768773454858783052995068 4787708109345332331133139141202295689475 2588959029409151843111542915460444247984 1841531569215551416798910788156968134891
Sometimes perl is the right tool for the job... and sometimes Google is.
-sauoq "My two cents aren't worth a dime.";
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: Re: Finding Primes (A Solution)
by Tommy (Chaplain) on Aug 15, 2003 at 02:09 UTC |