Szathmáry László honlapja @ DEIK

Modules

Write two programs:

Print prime numbers that are less than 100 (ex1.py)
Print the sum of prime numbers that are less than 200 (ex2.py)

In order to decide if a number is prime, you can use this simple function:

def is_prime(n):
"""
Decide whether a number is prime or not.
"""
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False

i = 3
maxi = n**0.5 + 1
while i <= maxi:
if n % i == 0:
return False
i += 2

return True

Further instructions will be given during the lab…

The source code of the Miller-Rabin algorithm is here: miller_rabin.py.

20121110a

Modules