Fibonacci Prime Numbers

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# Generate Fibonacci and check prime
11print("Fibonacci primes:")
12a, b = 0, 1
13count = 0
14while count < 20:
15    if a > 1 and is_prime(a):
16        print(a, end=" ")
17        count += 1
18    a, b = b, a + b
19print()