Menu Close

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
let  f(n,m)= { (1,(n = 1)),((m+1),(n = 2)),((Σ_(i=0) ^m f(n−1,i)),(n > 2)) :}  a.compute f(3,4)  b.find a function tha satisfies above recursion.
$${let} \\ $$$${f}\left({n},{m}\right)=\begin{cases}{\mathrm{1}}&{{n}\:=\:\mathrm{1}}\\{{m}+\mathrm{1}}&{{n}\:=\:\mathrm{2}}\\{\underset{{i}=\mathrm{0}} {\overset{{m}} {\sum}}{f}\left({n}−\mathrm{1},{i}\right)}&{{n}\:>\:\mathrm{2}}\end{cases} \\ $$$${a}.\mathrm{compute}\:{f}\left(\mathrm{3},\mathrm{4}\right) \\ $$$${b}.\mathrm{find}\:\mathrm{a}\:\mathrm{function}\:\mathrm{tha}\:\mathrm{satisfies}\:\mathrm{above}\:\mathrm{recursion}. \\ $$

Leave a Reply

Your email address will not be published. Required fields are marked *