arXiv Analytics

Sign in

arXiv:2409.02933 [math.NT]AbstractReferencesReviewsResources

A Pair of Diophantine Equations Involving the Fibonacci Numbers

Xuyuan Chen, Hung Viet Chu, Fadhlannafis K. Kesumajana, Dongho Kim, Liran Li, Steven J. Miller, Junchi Yang, Chris Yao

Published 2024-08-21Version 1

Let $a, b\in \mathbb{N}$ be relatively prime. Previous work showed that exactly one of the two equations $ax + by = (a-1)(b-1)/2$ and $ax + by + 1 = (a-1)(b-1)/2$ has a nonnegative, integral solution; furthermore, the solution is unique. Let $F_n$ be the $n$th Fibonacci number. When $(a,b) = (F_n, F_{n+1})$, it is known that there is an explicit formula for the unique solution $(x,y)$. We establish formulas to compute the solution when $(a,b) = (F_n^2, F_{n+1}^2)$ and $(F_n^3, F_{n+1}^3)$, giving rise to some intriguing identities involving Fibonacci numbers. Additionally, we construct a different pair of equations that admits a unique positive (instead of nonnegative), integral solution.

Related articles: Most relevant | Search more
arXiv:2309.04488 [math.NT] (Published 2023-09-01)
On a Pair of Diophantine Equations
arXiv:1705.06468 [math.NT] (Published 2017-05-18)
On Diophantine equations involving sums of Fibonacci numbers and powers of $2$
arXiv:1211.1440 [math.NT] (Published 2012-11-07, updated 2013-02-27)
Explicit formulas using partitions of integers for numbers defined by recursion