└── fibonacci


/fibonacci:
--------------------------------------------------------------------------------
 1 | def fibonacci(n):
 2 |     a, b = 0, 1
 3 |     sequence = []
 4 |     while a < n:
 5 |         sequence.append(a)
 6 |         a, b = b, a + b
 7 |     return sequence
 8 | 
 9 | def is_prime(num):
10 |     if num < 2:
11 |         return False
12 |     for i in range(2, int(num**0.5) + 1):
13 |         if num % i == 0:
14 |             return False
15 |     return True
16 | 
17 | def prime_fibonacci(n):
18 |     fib_numbers = fibonacci(n)
19 |     prime_fibs = [num for num in fib_numbers if is_prime(num)]
20 |     return prime_fibs
21 | 
22 | if __name__ == "__main__":
23 |     limit = 1000
24 |     primes_in_fibonacci = prime_fibonacci(limit)
25 |     print(f"Prime Fibonacci numbers less than {limit}: {primes_in_fibonacci}")
26 |     total_primes = len(primes_in_fibonacci)
27 |     print(f"Total prime Fibonacci numbers found: {total_primes}")
28 | 
29 |     # Дополнительная информация
30 |     if total_primes > 0:
31 |         print(f"First prime Fibonacci number: {primes_in_fibonacci[0]}")
32 |         print(f"Last prime Fibonacci number: {primes_in_fibonacci[-1]}")
33 |     else:
34 |         print("Нет простых чисел Фибоначчи в заданном диапазоне.")
35 | 


--------------------------------------------------------------------------------