show that Fibonacci numbers satisfy the recurrence relation
来源:学生作业帮 编辑:搜搜考试网作业帮 分类:数学作业 时间:2024/06/13 11:08:00
show that Fibonacci numbers satisfy the recurrence relation fn=5f(n-4)+3f(n-5) for n=5,6,7...,together with the initial conditions f0=0,f1=1,f2=1,f3=2,f4=3.use this recurrence relation to show that f5n is divisible by 5,for n=1,2,3...
注:fibonacci number满足fn=f(n-1)+f(n-2)
注:fibonacci number满足fn=f(n-1)+f(n-2)
fn=f(n-1)+f(n-2)=f(n-2)+2f(n-3)+f(n-4)
=f(n-3)+f(n-4)+2f(n-3)+f(n-4)=3f(n-3)+2f(n-4)=3(f(n-4)+f(n-5))+2f(n-4)=5f(n-4)+3f(n-5)
归纳法证明,当n=1时,f5=5,5整除f5,命题成立,假设命题对任意n成立,下面考虑n+1时的情况,利用上面等式有
f5(n+1)=f(5n+5)=5f(5n+1)+3f(5n)
由归纳法假设上式右边第2项被5整除,第1项含有因子5,故f5(n+1)也能被5整除,完成归纳法证明,故对任意n,fn能被5整除.
=f(n-3)+f(n-4)+2f(n-3)+f(n-4)=3f(n-3)+2f(n-4)=3(f(n-4)+f(n-5))+2f(n-4)=5f(n-4)+3f(n-5)
归纳法证明,当n=1时,f5=5,5整除f5,命题成立,假设命题对任意n成立,下面考虑n+1时的情况,利用上面等式有
f5(n+1)=f(5n+5)=5f(5n+1)+3f(5n)
由归纳法假设上式右边第2项被5整除,第1项含有因子5,故f5(n+1)也能被5整除,完成归纳法证明,故对任意n,fn能被5整除.
Some people believe that some numbers show the ______side of
Show that the relation R consisting of all pairs(x,y) such t
today's numbers show that was a wrong chioce
Some people believe that some numbers show the____side of a
Some people believe that some numbers show the__ (hide)side
Write a program to print the first 10 Fibonacci numbers.Each
That girl seems__________(satisfy)with the color of her dres
Let a,b and c are raional numbers which satisfy
Find the value of c that satisfy Roll's theorem for f(x)=x^2
英语翻译The study offers numbers that are still impressive.Nearl
The system of numbers that nearly everyone uses cousists of
The relation of genius to talent is the same as that of inst