Le 28/12/2011 11:53, Warp nous fit lire :
> B. Gimeno <nomail@nomail> wrote:
>> I've been writing a small macro that could definitely prove the Riemann
>> hypothesis, but I need a simple function that inexplicably has not been included
>> in the include file "math.inc."
>> Is there not a function of primality (N)? It may return true or false according
>> to the entered value  and we don't have to wait until May first to publish the
>> results.
> 
>   If this is a joke, it's a relatively odd one.
> 
The real issue is that povray does not store/deal with int, but only
floating point. Such function would be subject to rounding errors...

And if the primality was easy to know past the range of 64 bits long
integer (any implementation should use a static array of the know primes
to check for match, no point in using a dynamic approach), a lot of
cryptographic systems would be in trouble, IIRC.

Post a reply to this message