We have the quadratic equation x2−x−1=0 whose roots are α and β. By Vieta’s formula (which states that for ax2+bx+c=0 we get α+β=−ab and αβ=ac), we obtain
α+β=1andαβ=−1.
Now, since each root satisfies the original equation, we can write
α2−α−1=0⟹α2=α+1,
β2−β−1=0⟹β2=β+1.
Adding these two equalities gives a very useful recurrence for the sequence pk=αk+βk:
p2=α2+β2=(α+1)+(β+1)=α+β+2=1+2=3.
Because α2=α+1 and β2=β+1, if we multiply both sides by αm−2 or βm−2 respectively (for m≥2) and then add, we arrive at
αm+βm=αm−1+βm−1+αm−2+βm−2,
that is,
pm=pm−1+pm−2,m≥2.
This is exactly the Fibonacci-type (linear homogeneous) recurrence relation. Using the already known initial values
p0=α0+β0=1+1=2,p1=α+β=1,
we can generate subsequent terms one by one:
p2p3p4p5=p1+p0=1+2=3,=p2+p1=3+1=4,=p3+p2=4+3=7,=p4+p3=7+4=11.
With these exact numerical values in hand, let us inspect each option.
Option A: p3=p5−p4? We have p5−p4=11−7=4=p3, so this statement is true.
Option B: p5=11? Our calculation gives p5=11, so this statement is also true.
Option C: (p1+p2+p3+p4+p5)=26? Adding, 1+3+4+7+11=26, so this statement is true as well.
Option D: p5=p2⋅p3? The right-hand side equals p2p3=3×4=12, while the left-hand side is p5=11. Since 11=12, this statement is false.
Therefore the only statement that is not true is Option D.
Hence, the correct answer is Option 4.