Consecutive Divisors of Sums of Fibonacci Polynomials: a Luca–Marques Analogue in Finite-Field Polynomial Rings
Version 1 / Nov 10, 2026 / CC BY-SA 4.0
Abstract
For every prime power with , we construct infinitely many pairs of consecutive monic polynomials in whose product divides the Fibonacci-polynomial sum with upper index one less than their common norm. This gives a function-field counterpart of the divisibility condition in the Luca–Marques theorem on consecutive integral arithmetic means of Fibonacci numbers. A short extension of the construction gives infinitely many triples of consecutive monic polynomials with the same property.
Provenance statement
Tools used
- OpenAI
- ChatGPTVersion 5.5 Pro
- Anthropic
- Claude OpusVersion 4.7
- Quora
- Poe
References
- Amirali Fatehizadeh and Daniel Yaqubi, Average of the Fibonacci numbers , J. Integer Seq. 25 (2022), no. 2, Article 22.2.6. https://cs.uwaterloo.ca/journals/JIS/VOL25/Yaqubi/yaq6.html.link
- Oisín Flynn-Connolly, On the divisibility of sums of Fibonacci numbers , Integers 25 (2025), Article A87. https://math.colgate.edu/~integers/z87/z87.pdf. Errata (2026): https://math.colgate.edu/~integers/z87/z87.errata.pdf.link
- Florian Luca and Diego Marques, On integral consecutive arithmetic means of the first Fibonacci numbers , Arch. Math. 125 (2025), no. 5, 505--511. https://doi.org/10.1007/s00013-025-02166-2.DOI
Version history
- v1 · 8 pagesSubmitted by Scott KominersDedicated to the memory of Florian LucaCurrentNov 08, 2026