Question and Answers Forum

All Questions      Topic List

Arithmetic Questions

Previous in All Question      Next in All Question      

Previous in Arithmetic      Next in Arithmetic      

Question Number 208217 by mr W last updated on 07/Jun/24

1^2 +2^2 +3^2 +5^2 +8^2 +13^2 +21^2 =?

12+22+32+52+82+132+212=?

Answered by A5T last updated on 07/Jun/24

This is trivial,but could be interesting  with a connection with Fibonacci sequence.  f_n =f_(n−1) +f_(n−2) ; f_1 =f_2 =1,f_3 =2  f_1 ^2 +f_2 ^2 +...+f_n ^2 =^? f_n f_(n+1)  ...(i)  Induction;base case:  f_1 ^2 =f_1 ×f_2 =1;f_1 ^2 +f_2 ^2 =f_2 ×f_3 =2  So,suppose ∃n_1 (n_1 =1) such that (i) is true;we   show that it must be true for n_1 +1; hence for all  n≥n_1   f_1 ^2 +f_2 ^2 +...+f_n_1  ^2 =f_n_1  f_(n_1 +1)   ⇒f_1 ^2 +f_2 ^2 +...f_n_1  ^2 +f_(n_1 +1) ^2 =f_n_1  f_(n_1 +1) +f_(n_1 +1) ^2   =f_(n_1 +1) (f_n_1  +f_(n_1 +1) )=f_(n_1 +1) f_(n_1 +2)   ⇒n_1 +1 is true; so (i) is true for all n≥1  ⇒1^2 +1^2 +2^2 +3^2 +5^2 +8^2 +13^2 +21^2 =21×34  ⇒?=(21×34)−1=713

Thisistrivial,butcouldbeinterestingwithaconnectionwithFibonaccisequence.fn=fn1+fn2;f1=f2=1,f3=2f12+f22+...+fn2=?fnfn+1...(i)Induction;basecase:f12=f1×f2=1;f12+f22=f2×f3=2So,supposen1(n1=1)suchthat(i)istrue;weshowthatitmustbetrueforn1+1;henceforallnn1f12+f22+...+fn12=fn1fn1+1f12+f22+...fn12+fn1+12=fn1fn1+1+fn1+12=fn1+1(fn1+fn1+1)=fn1+1fn1+2n1+1istrue;so(i)istrueforalln112+12+22+32+52+82+132+212=21×34?=(21×34)1=713

Commented by mr W last updated on 07/Jun/24

��

Answered by zamin2001 last updated on 07/Jun/24

1^2 +1^2 +2^2 +3^2 +5^2 +8^2 +13^2 +21^2 =21×34  ⇒ 1^2 +2^2 +3^2 +5^2 +8^2 +13^2 +21^2 =21×34−1=713

12+12+22+32+52+82+132+212=21×3412+22+32+52+82+132+212=21×341=713

Commented by mr W last updated on 07/Jun/24

��

Answered by A5T last updated on 07/Jun/24

Another proof(constructive):  f_(n−1) f_(n+1) =(f_(n+1) −f_n )(f_n +f_(n−1) )  f_(n−1) f_(n+1) =f_n f_(n+1) +f_(n+1) f_(n−1) −f_n ^2 −f_n f_(n−1)   ⇒f_n ^2 =f_n f_(n+1) −f_n f_(n−1)  (we get a telescoping sum)  ⇒f_1 ^2 +f_2 ^2 +...+f_n ^2 =f_n f_(n+1)

Anotherproof(constructive):fn1fn+1=(fn+1fn)(fn+fn1)fn1fn+1=fnfn+1+fn+1fn1fn2fnfn1fn2=fnfn+1fnfn1(wegetatelescopingsum)f12+f22+...+fn2=fnfn+1

Commented by mr W last updated on 07/Jun/24

��

Terms of Service

Privacy Policy

Contact: info@tinkutara.com