Write a Python function, named “find_fibonacci”, which accepts a list as input. The function will find and return the elements that satisfy the Fibonacci property:
Example : Input list : [2, 8, 4, 6, 1, 7, 8, 4, 7, 9, 4, 13]
Returned list : [[6,1,7], [1,7,8], [9,4,13]]
Write Python code that uses nested loops to display the following pattern:
1
1 2 1
1 2 4 2 1
1 2 4 8 4 2 1
1 2 4 8 16 8 4 2 1
.
.
.
1 2 4 8 16 32 64 128 64 32 16 8 4 2 1
Write a Python function that finds and prints all the prime numbers, pn, that satisfy the following equation: pn=2k+3L
for some non-negative integers k,L, such that k≤16, L≤16.