Ask Question
9 August, 00:00

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

+2
Answers (1)
  1. 9 August, 00:08
    0
    F (n+1) - f (n) = 3 (n+1) - 3n = 3n + 3 - 3n = 3;

    The recursive version is f (n+1) = f (n) + 3;
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Write a recursive version of function f (n) = 3 * n i. e. multiples of 3 ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers