Twin Primes
Find twin primes (differ by 2).
AdvancedPhase 6 - Category 3: Loop & Conditional MixExample 4 of 10
twin-primes.py
1# Helper function2def is_prime(n):3 if n < 2:4 return False5 for i in range(2, int(n ** 0.5) + 1):6 if n % i == 0:7 return False8 return True910# Find twin primes11print("Twin primes up to 100:")12for num in range(3, 101):13 if is_prime(num) and is_prime(num + 2):14 print(f"({num}, {num + 2})", end=" ")15print()
Output
Twin primes up to 100: (3, 5) (5, 7) (11, 13) (17, 19) (29, 31) (41, 43) (59, 61) (71, 73)
What's going on
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
🔗Related Content
- 📖
Phase 6 - Learn Concepts
Review Phase 6 concepts and explanations
- 📝
Phase 6 - Quiz
Test your Phase 6 understanding with quiz questions
- 💻
Phase 6 - All Practice Problems
Explore all practice problems for Phase 6
- 🎓
Master Your Logic Building - Complete Course
Browse all phases and tutorials
- 🧠
Logic Building Overview
Learn about the complete logic building curriculum