Re: Very Big numbers

Gernot Frisch wrote:

>>Can it also find all 100% proven Prime Numbers?
> 
> 
> Yes, it can:
> 
> int is_prime(BIG_NUM num)
> {
>    for (BIG_NUM i=3 ; i<num; i++)
>       if (!(test_num%i) return 0;
>    return 1;
> }
> 
> Muahaha! You didn't say anything about speed, did you :)

....But he _did_ claim 100% correctness. Your code contains two errors 
that prevent compilation and the algorithm is incorrect to top it off.

Best regards,

   Sidney