You are not logged in. Please login at to post your questions!


Finding recurrence relation from combinatorics formulas

For example let f(n)=nC0+(n-1)C1+(n-2)C2+(n-3)C3 +...........+(n-k)Ck; where k<=n/2;


How will we solve it ?

I know recusrsive function f(n)=f(n-1)+f(n-2)+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-(m-1))C1+(n-2(m-1))C2+(n-3(m-1))C3+............

Please suggest way to solve above problem

asked 19 Feb, 00:21

saurabh_mittal's gravatar image

accept rate: 0%

edited 19 Feb, 00:28

(19 Feb, 02:00) meooow ♦6★
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 19 Feb, 00:21

question was seen: 113 times

last updated: 19 Feb, 02:00