Thread: help, this is to hard

1. help, this is to hard

i got this E.P.W. from school. Im year 12 and learning about Fibonacci and Turkinacci sequences.

The Turkinacci sequence has been formed by taking the first two terms of the original Fibonacci, doubling them and then following a typical Fibonacci pattern. The pattern formed is : 2,2,4,6,10,16,26,42,68...
(For the turkinacci sequence, call the first term T1, the second T2, the third T3, and so on).

I need help in this question.
1. Give a recurseive definition of the Turkinacci sequence.

it would be alot of help if you took your time and explained.
you'll be my hero.

2. Originally Posted by bayatly_00
i got this E.P.W. from school. Im year 12 and learning about Fibonacci and Turkinacci sequences.

The pattern formed is : 2,2,4,6,10,16,26,42,68...
(For the turkinacci sequence, call the first term T1, the second T2, the third T3, and so on).

I need help in this question.
1. Give a recurseive definition of the Turkinacci sequence.

it would be alot of help if you took your time and explained.
you'll be my hero.
Hello,

The definition of your sequence (it has quite a funny name, never heard before!) is similar to the definition of the original Fibonacci sequence:
$\displaystyle T_1=2$
$\displaystyle T_2=2$
$\displaystyle T_3=T_1+T_2$

in general:

$\displaystyle T_n=T_{n-1}+T_{n-2}$

If you want to calculate the value of for instance $\displaystyle T_5$ then you must calculate $\displaystyle T_4$ before, and to calculate $\displaystyle T_4$ you have to calculate $\displaystyle T_3$ and so on and so on, until you reach the beginning of the sequence. That means you have to go back to the beginning every time you want to calculate a value. "To go back" means in Latin "recurrere", so the expression recursive describes the procedure perfectly.

Bye