Logic Building
# Helper function
def is_prime(n):
if n < 2:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
# Find twin primes
print("Twin primes up to 100:")
for num in range(3, 101):
if is_prime(num) and is_prime(num + 2):
print(f"({num}, {num + 2})", end=" ")
print()Output
Twin primes up to 100: (3, 5) (5, 7) (11, 13) (17, 19) (29, 31) (41, 43) (59, 61) (71, 73)
Check if number and number+2 are both prime.
Key Concepts:
- Check if num is prime
- Check if num+2 is prime
- Both must be prime