Math
posted by Sean .
prove
f_{2n+1} = f_{n+1}^2 + f_n^2
Where f is the fibonacci sequence (so f_1=1, f_2=1, f_3=2, f_4=3, f_5=5, etc)
Respond to this Question
Similar Questions

Physics
The Russell Traction System To immobilize a fractured femur (the thigh bone), doctors often utilize the Russell traction system illustrated in the figure. Notice that one force is applied directly to the knee, F_1,while two other forces, … 
physics
The following forces act on a hockey puck (round, rubber disk) sitting on a frictionless surface: F_1 = 12 N at 15 degrees; F_2 = 28 N at 125 degrees; and F_3 = 33.3 N at 235 degrees. All the forces are in the plane of the ice. Determine … 
Math
F25= 75,025 and F26= 121,393 where Fn is the nth term in the Fibonacci sequence. Find F27. I do not understand the Fibonacci sequence, could someone help me with my question and explain it to me please. 
college physics
Two forces, of magnitudes F_1 = 80.0 N and F_2 = 25.0 N, act in opposite directions on a block, which sits atop a frictionless surface. Initially, the center of the block is at position x_i = 4.00 cm. At some later time, the block … 
physics
Four forces act on a hotair balloon, F_1 is upward at 4600 N, F_2 is left at 1450 N, F_3 is right at 850 N, and F_4 is downward at 3600 N. ____ N at _____ degrees clockwise from F_2. 
Physics
Waves of all wavelengths travel at the same speed v on a given string. Traveling wave velocity and wavelength are related by v=lambda*f,where v is the wave speed, lambda is the wavelength (in meters), and f is the frequency [in hertz]. … 
PreCalc
Find three examples of the Fibonacci sequence in nature. Write a paragraph for each example. For each example, address the following questions: How does the example relate to the Fibonacci sequence? 
Fibonacci sequence
The Fibonacci sequence a1=1,a2=1,a3=2,a4=3,a5=5,a6=8… is defined recursively using the formulas a1=a2=1 and an+2=an+an+1 for all n≥1. Find the greatest common divisor of a484 and a2013. 
Math (fibonacci
A sequence of numbers is called a Fibonaccitype sequence if each number (after for the first two) is the sum of the two numbers which precede it. For example, 1, 1, 2, 3, 5, 8 ... is a Fibonacci type sequence. If 1985, x, y, 200 … 
Fibonacci Sequence
The sequence < un > is defined by the recurrence Un+1 = 3Un+1\5Un+3 initial condition of u1 = 1: Need to show un in terms of Fibonacci / Lucas numbers