let-f-n-m-1-n-1-m-1-n-2-i-0-m-f-n-1-i-n-gt-2-a-compute-f-3-4-b-find-a-function-tha-satisfies-above-recursion-

Question Number 55823 by 121194 last updated on 04/Mar/19

l e t

f (n, m) = {\begin{cases} 1 & n = 1 \\ m + 1 & n = 2 \\ \underset{i = 0}{\sum^{m}} f (n - 1, i) & n > 2 \end{cases}

a . compute f (3, 4)

b . find a function tha satisfies above recursion .