Fibonacci Sequence: Running Sum

Recurrence for the Tiling problem
Tiling Problem Relation and Fibonacci Number
Reversing the above Equation
  • E has to have occurred only once.
  • E hints to be a trivial case.
  • Each term in the summation is a positive term, hence no exclusion is happening in this part of the equation
  • Since there is no term with a minus sign, then each of the terms in the expression is a representation of a case, and all the cases are mutually exclusive (i.e. no two cases overlap)
  • And the summation of all the terms gives the total number of ways to perform the act, this means that the cases are exhaustive(i.e. covers all possibilities)

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Anshul Garg

Anshul Garg

Programmer | In love with Maths and Problem Solving | github@garganshul108 | linkedin@anshulgargofficial