EP 241 Computer Programming |
|
Prime NumbersAn integer p > 1 is called a prime number if its only positive divisors are 1 and p. An integer greater than 1 that is not a prime is called a composite. There are an infinite number of primes, the first 15 primes are: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 ...In mathematics, the Sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers up to a specified integer. For deatils see: http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes Using Sieve of Eratosthenes algorithm, write a Fortran program to list and count all prime numbers less than 10000. SOLUTION
|