Primes.c
by Stanowski Etienne
Stan.Etienne@caramail.com
Programmed in C with Ti-Gcc and don't need any kernel.
09/21/2000

Very fast : finding all prime numbers between 1 and 1000 is barely instatanated.
2 differents utilisations :
 * "primes(A)"  : answer true if prime number
 * "primes(A,B)": gives all prime numbers between A and B. Numbers A and B must be positives between 1 & 2^32/2-1. Be careful, entering a number > 2^32/2-1 can freeze the TI. The answer is given in a list form. Be careful, 0 and  1 are not prime numbers.
examples: "primes(5)" -> true
	  "primes(1,15)" -> "{2 3 5 7 11 13}"
	  "primes(15,1)" -> "{13 11 7 5 3 2}"
It has no known bugs. I won't be responsible of any damage during the execution of the progam.
The algorythm could have been faster but we would see the difference for more than 1000 numbers.