primes.txt


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18

def checkprime(n){
	i = 2;
	s = int(sqrt(n));
	while i <= s {
		if n % i == 0 break;
		i += 1;
	}
	return(i < s);
}

def main(argc,argv){
	N = 100;
	i = 2;
	while i < N {
		if checkprime(i) print(i);
		i += 1;
	}
}