Rabbits and Recurrence Relations

A sequence is an ordered collection of objects (usually numbers), which are allowed to repeat. Sequences can be finite or infinite. Two examples are the finite sequence (π,−2–√,0,π)$(\pi ,-\sqrt{2},0,\pi )$ and the infinite sequence of odd numbers (1,3,5,7,9,…)$(1,3,5,7,9,\dots )$. We use the notation an$a_n$ to represent the n$n$-th term of a sequence.

A recurrence relation is a way of defining the terms of a sequence with respect to the values of previous terms. In the case of Fibonacci's rabbits from the introduction, any given month will contain the rabbits that were alive the previous month, plus any new offspring. A key observation is that the number of offspring in any month is equal to the number of rabbits that were alive two months prior. As a result, if Fn$F_n$ represents the number of rabbit pairs alive after the n$n$-th month, then we obtain the Fibonacci sequence having terms Fn$F_n$ that are defined by the recurrence relation Fn=Fn−1+Fn−2$F_n=F_{n-1}+F_{n-2}$ (with F1=F2=1$F_1=F_2=1$ to initiate the sequence). Although the sequence bears Fibonacci's name, it was known to Indian mathematicians over two millennia ago.

When finding the n$n$-th term of a sequence defined by a recurrence relation, we can simply use the recurrence relation to generate terms for progressively larger values of n$n$. This problem introduces us to the computational technique of dynamic programming, which successively builds up solutions by using the answers to smaller cases.

Given: Positive integers n≤40$n\le 40$ and k≤5$k\le 5$.

Return: The total number of rabbit pairs that will be present after n$n$ months, if we begin with 1 pair and in each generation, every pair of reproduction-age rabbits produces a litter of k$k$ rabbit pairs (instead of only 1 pair).

n=35
k=4
a=1
b=0
c=a*k
for i in range(1,n):
    a=a+b
    b=c
    c=a*k
print(a)