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;
> }
>
for (BIG_NUM i=3 ; i<num; i+=2) // <<<<< I just doubled its
speed yay!!!!!
I think you would have to put a pentium 3.4ghz into a time dialation
chamber
and speed time by a factor of a billion to get an answer for 100 digit
prime this way
within your lifetime (if the 'puter didnt turn to dust first - did I
mention an anti-entropy
field as well...).
**EXAMPLE** of higher mathematics winning over the infinite monkeys
approach
(Im glad to hear they have come up with shortcuts, though Im still
wondering what
100 digit numbers are good for (besides encryption keys))
eek eek
>
> Muahaha! You didn't say anything about speed, did you :)
>
> Honestly, if you want to sell your lib - which seems to be really a
> nice piece of code - make clear what the benefits over the free
> libraries are. e.g. support, small exe size, quick to implement, VB
> interfaces available...
>
> Good luck,
>
> --
> -Gernot
>
> Post here, don't email. If you feel you have to mail, revert my
> forename from:
> tonreG.Frisch.at.Dream-D-Sign.de@[EMAIL PROTECTED]
|
