n is prime, iterate from 2 to n-1.n is divisible by any number in this range (n % i == 0), then n is not prime.break statement to exit early when a divisor is found.else clause with for loop to confirm primality if no divisor is found.break to stop iteration upon finding a divisor.else with for loop to execute code if no break occurs, confirming a prime number.def and returning values.lambda.lambda x: x * x.map.map returns an iterator; can be converted to list.filter(lambda x: x % 2 == 0, container).reduce from functools.reduce(lambda x, y: x + y, container).