Assume a generic recursive relation is defined as : A[i] = p*A[i-1] + q where p and q are coefficients of the relation. Write a function that takes the first three numbers in this relation as a list, such as [A[0], A[1], A[2]] and computes p and q, and returns A[3]. For example, given [1,3,5] your function should return 7, because the numbers 1,3,5 are produced by the series: A[i] = A[i-1] + 2 where p is 1 and q is 2, and then the next number in the series becomes 7. You can assume that p and q are always integers. You can also assume that p and q are determinable in any test case. """ def recursionSolver(values): return # Remove this line to answer this question.
Assume a generic recursive relation is defined as :
A[i] = p*A[i-1] + q
where p and q are coefficients of the relation.
Write a function that takes the first three numbers in this relation as a list,
such as [A[0], A[1], A[2]]
and computes p and q, and returns A[3]. For example, given [1,3,5] your
function should return 7, because the numbers 1,3,5 are produced by the
series:
A[i] = A[i-1] + 2
where p is 1 and q is 2, and then the next number in the series becomes 7. You
can assume that p and q are always integers. You can also assume that p and q
are determinable in any test case.
"""
def recursionSolver(values):
return # Remove this line to answer this question.
İn python.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 1 images