Answer:
(a) Look at the tile at the right-hand end of the path. If it is a square tile, the remaining n−1 units can be covered in tn−1 ways. If it is a rectangular tile, it is red or blue (2 choices), and the remaining n−2 units can be covered in tn−2 ways. These cases do not overlap and cover every tiling, so tn=tn−1+2tn−2.
(b) Generate the terms from the rule:
t3=3+2(1)=5,t4=5+2(3)=11,t5=11+2(5)=21
t6=21+2(11)=43,t7=43+2(21)=85
(c) At n=1: 34−1=1. At n=2: 38+1=3. For the rule, with f(n)=32n+1+(−1)n:
f(n−1)+2f(n−2)=32n+(−1)n−1+2n+2(−1)n−2=32n+1+(−1)n=f(n)
since (−1)n−1+2(−1)n−2=(−1)n(−1+2)=(−1)n. So the formula is right for every n (it also gives 5, 11, 21, 43, 85 from part (b)).
(d)
t10=3211+1=32049=683
(From the rule: t8=85+86=171, t9=171+170=341, t10=341+342=683.)
(e)
tn+tn+1=32n+1+(−1)n+2n+2+(−1)n+1=33⋅2n+1=2n+1
So the sums are 4,8,16,32,… (for example t1+t2=4 and t2+t3=8): a G.P. with first term 4 and common ratio 2.