Question: Write a function using recursion and at least one helper function. Create a list of n Fibonacci numbers. For instance, a list of ten Fibonacci
Write a function using recursion and at least one helper function. Create a list of n
Fibonacci numbers. For instance, a list of ten Fibonacci numbers would be
[1,1,2,3,5,8,13,21,34,55]. (This is different than a list of Fibonacci numbers with values to n.)
Parameter for function is required, such as (problem2 n =). Multiply each of the Fibonacci numbers by 3. Only output numbers that have a
leading digit of 4.
problem2 40
[432,4791,4038807,44791056]
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
