For example let f(n)=nC0+(n1)C1+(n2)C2+(n3)C3 +...........+(nk)Ck; where k<=n/2; 1<=n<=10^7 How will we solve it ? I know recusrsive function f(n)=f(n1)+f(n2)+1 will solve it . But i want to general methods to solve this type of questions of converting formulae to recursion. Here is another problem Magic Gems. its function is f(n,m)=nC0+(n(m1))C1+(n2(m1))C2+(n3(m1))C3+............ Please suggest way to solve above problem asked 19 Feb, 00:21

click