> 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 :)
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]
|
