TITLE:
Squares from D(–4) and D(20) Triples
AUTHORS:
Zvonko Čerin
KEYWORDS:
Fibonacci Numbers, Lucas Numbers, Square, Symmetric Sum, Alternating Sum, Product, Component
JOURNAL NAME:
Advances in Pure Mathematics,
Vol.1 No.5,
September
21,
2011
ABSTRACT: We study the eight infinite sequences of triples of natural numbers A=(F2n+1,4F2n+3,F2n+7), B=(F2n+1,4F2n+5,F2n+7), C=(F2n+1,5F2n+1,F2n+3), D=(F2n+3,4F2n+1,F2n+3) and A=(L2n+1,4L2n+3,L2n+7), B=(L2n+1,4L2n+5,L2n+7), C=(L2n+1,5L2n+1,L2n+3), D=(L2n+3,4L2n+1,L2n+3. The sequences A,B,C and D are built from the Fibonacci numbers Fn while the sequences A, B, C and D from the Lucas numbers Ln. Each triple in the sequences A,B,C and D has the property D(-4) (i. e., adding -4 to the product of any two different components of them is a square). Similarly, each triple in the sequences A, B, C and D has the property D(20). We show some interesting properties of these sequences that give various methods how to get squares from them.