Tag Archives: Recursion

Recurrence relation proof using strong induction

Posted on March 7, 2022 by Sumant Sumant
Posted in Mathematical Induction | Tagged , | Leave a comment

Strong Induction, Recursive function, Inequality

Posted on December 13, 2021 by Sumant Sumant
Posted in Inequalities, Mathematical Induction | Tagged , , | Leave a comment

Striling number of 2nd kind Triangle

Posted on August 8, 2021 by Sumant Sumant
Posted in Combinatorics, Computer Program | Tagged | Leave a comment

Catalan Number: Triangulating a polygon

Posted on February 10, 2021 by Sumant Sumant

There are numerous ways to interpret Catalan Number and one of them is thinking of triangulating an n+2 gon polygon corresponding to nth Catalan number and this gives us the following recursive formula . Here is an example of Octagon … Continue reading →

Posted in Combinatorics, Proof | Tagged , | Leave a comment

Closed formula for Derangement Numbers using Inclusion Exclusion

Posted on January 31, 2021 by Sumant Sumant

We know that nth Derangement Numbers can be calculated by its recursive formula D(n)=(n-1)(D(n-1)+D(n-2)). It remember it as (n-1) times the recursive formula for Fibonacci numbers.

Posted in Combinatorics | Tagged | Leave a comment

Thinking Fibonacci and encoding in C

Posted on January 31, 2021 by Sumant Sumant

There are many ways to think about Fibonacci numbers. One of my favorite one is to think of climbing a staircase where one can either take 1 step or 2 steps at a time.

Posted in Combinatorics | Tagged , | Leave a comment

Tower of Hanoi (Recursion)

Posted on January 27, 2021 by Sumant Sumant
Posted in Algorithm, Combinatorics, Computer Program, Famous Problem, Programming | Tagged , | Leave a comment

Gamma Function

Posted on February 5, 2019 by Sumant Sumant
Posted in Combinatorics, Gamma Function, Uncategorized | Tagged | Leave a comment

Binet Formula for Fibonacci Number

Posted on July 9, 2017 by Sumant Sumant

While there are many ways to derive the recursive formula of Fibonacci Sequence. The formula to find the nth term of a Fibonacci sequence is a beautiful formula. We are not going to derive here but prove the formula using … Continue reading →

Posted in Mathematical Induction, Number Theory, Proof | Tagged , , | Leave a comment

Leonardo’s Recurrence

Posted on December 30, 2015 by Sumant Sumant

The generalised Fibonacci series is given by  

Posted in Complex Numbers | Tagged | Leave a comment