if n < 2: return False elif n == 2: return True else: for i in range(2, n): if n % i == 0: return False return True def find_primes(n): primes = [] for i in range(2, n+1): if is_prime(i): primes.append(i) return primes primes = find_primes(100)

Here the function is_prime takes one argument n and checks if it is a prime number. If it is a prime number it returns True, otherwise it returns False. 
    The function find_primes takes one argument n and returns a list of all the prime numbers between 2 and n.