This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1

2019 Jozsef Wildt International Math Competition, W. 19
Let $\{F_n\}_{n\in\mathbb{Z}}$ and $\{L_n\}_{n\in\mathbb{Z}}$ denote the Fibonacci and Lucas numbers, respectively, given by $$F_{n+1} = F_n + F_{n-1}\ \text{and}\ L_{n+1} = L_n + L_{n-1}\ \text{for all}\ n \geq 1$$with $F_0 = 0$, $F_1 = 1$, $L_0 = 2$, and $L_1 = 1$. Prove that for integers $n \geq 1$ and $j \geq 0$ [list=1] [*]$\sum \limits_{k=1}^n F_{k\pm j}L_{k\mp j}=F_{2n+1}-1+\begin{cases} 0, & \text{if}\ n\ \text{is even}\\ \left(-1\right)^{\pm j}F_{\pm 2j}, & \text{if}\ n\ \text{is odd} \end{cases}$ [*] $\sum \limits_{k=1}^nF_{k+j}F_{k-j}L_{k+j}L_{k-j}=\frac{F_{4n+2}-1-nL_{4j}}{5}$ [/list]
lucas sequence number theory fibonacci sequence