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 prime triplets
print("Prime triplets (p, p+2, p+6) up to 100:")
for num in range(2, 95):
if is_prime(num) and is_prime(num + 2) and is_prime(num + 6):
print(f"({num}, {num + 2}, {num + 6})", end=" ")
print()Output
Prime triplets (p, p+2, p+6) up to 100: (5, 7, 11) (11, 13, 17) (17, 19, 23) (41, 43, 47)
Check if three numbers form prime triplet.
Key Concepts:
- Check if num, num+2, num+6 are all prime
- Pattern: (p, p+2, p+6)
- All must be prime