Display program code

primes1.pl : Prime numbers
Generate prime numbers by Sieve of Eratosthenes.

How to use:
For an integer N, you enter prime(N),
and get all primes P1,P2,..,Pm up to N prime(P1), prime(P2), prime(Pm).

Program: Change the code, then submit!

Console: Enter query or select example from below, then submit and wait for answer!

Select example query: 

WebCHR help - CHR Website - (c) Copyrights Martin Kaeser Uni Ulm 2007