- Thread starter
- #1
mathworker
Active member
- May 31, 2013
- 118
we all know Fibonacci numbers,just for information
they are the numbers of sequence whose \(\displaystyle t_n=t_{n-1}+t_{n-2}\) and \(\displaystyle t_0=t_1=1\)
\(\displaystyle \text{PROVE THAT:}\)
$$1+S_n=t_{n+2}$$
where,
$$S_n=\text{sum up-to n terms}$$
$$t_n=\text{nth term}$$
they are the numbers of sequence whose \(\displaystyle t_n=t_{n-1}+t_{n-2}\) and \(\displaystyle t_0=t_1=1\)
\(\displaystyle \text{PROVE THAT:}\)
$$1+S_n=t_{n+2}$$
where,
$$S_n=\text{sum up-to n terms}$$
$$t_n=\text{nth term}$$