Saturday, August 13, 2011

Fortran that test for prime number?

That is not to difficult? A prime number is a number greater than 1 with exactly two divisors. If you have the num_divisors function, the rest is easy

No comments:

Post a Comment