Question

Write a recursive version of function f(n) = 3 * n i.e. multiples of 3

Answer 1

f(n+1) - f(n) = 3(n+1) - 3n = 3n + 3 - 3n = 3;
The recursive version is f(n+1) = f(n) + 3;