GCD of sums of kk consecutive squares of generalized Fibonacci numbers

preprint2023arXivOpen access

Abstract

In 2021, Guyer and Mbirika gave two equivalent formulas that computed the greatest common divisor (GCD) of all sums of kk consecutive terms in the generalized Fibonacci sequence (Gn)n≥0\left(G_n\right)_{n \geq 0} given by the recurrence Gn=Gn−1+Gn−2G_n = G_{n-1} + G_{n-2} for all n≥2n \geq 2 with integral initial conditions G0G_0 and G1G_1. In this current paper, we extend their results to the GCD of all sums of kk consecutive squares of these numbers. Denoting these GCD values by the symbol GG0,G12 ⁣(k)\mathcal{G}_{G_0, G_1}^2\!(k), we prove GG0,G12 ⁣(k)=gcd⁡(GkGk+1−G0G1,  Gk+12−G12,  Gk+22−G22)\mathcal{G}_{G_0, G_1}^2\!(k) = \gcd\left(G_k G_{k+1} - G_0 G_1,\; G_{k+1}^2 - G_1^2,\; G_{k+2}^2 - G_2^2\right). Moreover, we provide very tantalizing closed forms in the specific settings of the Fibonacci, Lucas, and generalized Fibonacci numbers. We close with a number of open questions for further research.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.