A shift-extension conjecture for Fibonacci divisibility sums

From papers

Let FiF_i denote the iith Fibonacci number, and for a positive integer mm write i=1mFi\sum_{i=1}^m F_i for the sum of the first mm Fibonacci numbers. Shift-extension conjecture. For each positive integer tt, there is a positive integer nn such that

ni=1nFiimpliesn+ti=1n+tFi.n\mid \sum_{i=1}^n F_i \quad\text{implies}\quad n+t\mid \sum_{i=1}^{n+t} F_i.

This conjecture concerns the distribution of positive integers that divide their corresponding sums of initial Fibonacci numbers. The supplied text gives no resolution or further evidence, so the conjecture remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Daniel Yaqubi and Amirali Fatehizadeh, “Some results on average of Fibonacci and Lucas sequences”, arXiv:2001.11839 (2020).

Solutions 0

No solutions have been posted yet.