Two unknowns x and y are to be found by two mathematicians
M1 and M2.
I give the Product(x * y) to M1 and Sum(x + y) to M2.
M1 doesn't know the value of S and M2 doesn't know the value
of P.
Now both the mathematicians enter separate room and do some calculation
and come back and they s
There is no single algorithm for primality testing... and all that is> known> > so far is nothing but intelligent brute forcing...> >> > try peeping through
http://primepages.org more like a bible for prime> number> > lovers.> >> > -Sudarshan
> >> >> &g
r prime number> lovers.>> -Sudarshan>>>> The hardest thing to understand is why we can> understand anything at all>
- Einstein> - Original Message -> From: "Venkatesh Dayalan" <[EMAIL PROTECTED]>&
intelligent brute forcing...try peeping through http://primepages.org more like a bible for prime number
lovers.-SudarshanThe hardest thing to understand is why we can
understand anything at all - Einstein- Original Message -From: "Venkatesh
thanks for the info
but i am looking into the logic of finding the previous prime number...
On 11/29/05, SUDARSHAN IYENGAR <[EMAIL PROTECTED]> wrote:
hey well... you must have a look at this package "pari gp"try googling and you can download this package, its very small and is thebest of its ki
