
Algebra PreAlgebra and Basic Algebra Math Forum 
 LinkBack  Thread Tools  Display Modes 
March 31st, 2014, 04:44 AM  #1 
Newbie Joined: Mar 2014 From: Poland Posts: 5 Thanks: 0  Mathematical Induction, Fibonacci Sequence and Pascal's triangle
Hello guys, During the creation of my math work on the topic of Pascal's Triangle I came up with a formula for counting elements of Fibonacci Sequence using the entries from Pascal's Triangle (binomial coefficients). I know that there is a general formula for that, which I have, explained it and proven by induction, but what I also wanted to do in my work, was to create two formulas for counting even entries of Fibonacci Sequence and the odd ones. What I am struggling with however, is how to prove it using the induction. I attach the screenshot of the page that deals directly with ODD numbers. If you guys could help me with the induction, I would greatly appreciate it. I am looking forward to hearing from you! Kind regards, kbeski 
March 31st, 2014, 06:07 AM  #2 
Newbie Joined: Mar 2014 From: Poland Posts: 5 Thanks: 0  
March 31st, 2014, 09:31 AM  #3 
Global Moderator Joined: Dec 2006 Posts: 20,746 Thanks: 2133 
Proving (effectively by induction) that the righthand sides are Fibonacci numbers is done in many websites. The lefthand sides are sums of entries along certain diagonals of Pascal's triangle. Their additive property (as required for Fibonacci numbers) follows easily from the additive property used in the construction of Pascal's triangle. In both cases, it is easier to deal with all the Fibonacci numbers instead of the even position and odd position ones separately. 
March 31st, 2014, 09:48 AM  #4  
Newbie Joined: Mar 2014 From: Poland Posts: 5 Thanks: 0  Quote:
I would like to thank you for your answer, but also tell you that I still have troubles with rearranging the formula in order to prove it. The below is what I have already written as it comes to a general formula for obtaining any Fibonacci Number using Pascal's Triangle. I honestly and sincerely have no idea how to continue it and I think I have already searched most of the internet to find a solution to my problem. I will greatly appreciate your help  
March 31st, 2014, 10:33 AM  #5 
Global Moderator Joined: Dec 2006 Posts: 20,746 Thanks: 2133  This article explains visually why the appropriate diagonals of Pascal's triangle generate the Fibonacci numbers. Do you understand it?

March 31st, 2014, 10:40 AM  #6 
Newbie Joined: Mar 2014 From: Poland Posts: 5 Thanks: 0 
Yes I indeed understand it, but I am afraid it does not help with my question at all.

March 31st, 2014, 11:15 AM  #7 
Global Moderator Joined: Dec 2006 Posts: 20,746 Thanks: 2133 
Binet's formula for the Fibonacci numbers is explained and proved here. Do you also understand that explanation? For each article, the proof given can readily be converted to a formal proof by induction. You also need an inductive proof that Pascal's triangle contains all the binomial coefficients, which is easily accomplished. Last edited by skipjack; March 31st, 2014 at 11:21 AM. 
March 31st, 2014, 12:52 PM  #8 
Newbie Joined: Mar 2014 From: Poland Posts: 5 Thanks: 0 
skipjack, I do understand it, but I think that you don't get what my problem is. I am struggling with expanding the RHS from the last equation of the picture I have uploaded. I just don't know how to rearrange it in such manner, that I could be able to continue proving the validity of the formula.


Tags 
fibonacci, induction, mathematical, pascal, sequence, triangle 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Pascal's triangle  texaslonghorn  Elementary Math  3  February 23rd, 2014 10:07 AM 
Pascal's triangle and e  brunojo  Number Theory  7  February 6th, 2014 10:49 AM 
pascal triangle  rambo123  Algebra  2  December 12th, 2010 08:48 AM 
Pascal's Triangle  symmetry  Algebra  2  February 18th, 2007 03:52 PM 
pascal triangle  rambo123  Number Theory  1  December 31st, 1969 04:00 PM 