# Project 3: Project Euler Knockoff

from math import sqrt, ceil

# define function for checking if a number is prime
def is_prime(n):
    """A prime number can only be evenly
    divided by one and itself
    Examples: 2, 3, 5, 7, 11, 13...
    Note! 0 and 1 are NOT primes!"""
    # if prime, return True
    return xxxxxx
    # if not prime, return False


# define function for generating a fibonacci sequence
def fibgen():
    """Fibonacci sequence is defined by every next term
    being the sum of the two previous terms.
    Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34"""
    a, b = xxxxxxxxx, xxxxxxx
    while True:
        yield xxxxxx
        xxxxxxxxxxxx
        yield xxxxxx
        xxxxxxxxxxxx


# create a generator object from the generator function
x = xxxxxxxxxx
# initialize an empty list to keep track of the fib primes
fibprimes = xxxxxxxxxxx
# generate with a while loop until we have 12
while xxxxxxxxxxxxxxx < 12:
   # call the next value from the generator function
   # check to see if it's prime, then print it