Logic Building/Phase 6 - Category 1: Number Logic/Program

Fibonacci Prime Numbers

Find Fibonacci numbers that are prime.

Logic BuildingAdvanced

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

# Generate Fibonacci and check prime
print("Fibonacci primes:")
a, b = 0, 1
count = 0
while count < 20:
    if a > 1 and is_prime(a):
        print(a, end=" ")
        count += 1
    a, b = b, a + b
print()

Output

Fibonacci primes:
2 3 5 13 89 233 ...

Generate Fibonacci and check primality.

Key Concepts:

Generate Fibonacci sequence
Check if number is prime
Filter prime Fibonacci numbers

Numbers with Prime Digit Sum

Happy Numbers