Books by Mitchell Kato

#prime number program def primeBoolean(n): nprime=True for x in range(2,n-1): if n%x==0: nprime=False return nprime def nthprime(n): countp=0 x=2 while countp