Prime Triplets

Find prime triplets (three consecutive primes with pattern).

AdvancedPhase 6 - Category 3: Loop & Conditional MixExample 10 of 10
prime-triplets.py
1# Helper function
2def is_prime(n):
3 if n < 2:
4 return False
5 for i in range(2, int(n ** 0.5) + 1):
6 if n % i == 0:
7 return False
8 return True
9
10# Find prime triplets
11print("Prime triplets (p, p+2, p+6) up to 100:")
12for num in range(2, 95):
13 if is_prime(num) and is_prime(num + 2) and is_prime(num + 6):
14 print(f"({num}, {num + 2}, {num + 6})", end=" ")
15print()

Output

Prime triplets (p, p+2, p+6) up to 100:
(5, 7, 11) (11, 13, 17) (17, 19, 23) (41, 43, 47)

What's going on

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