arXiv · 2001.09717
Resolution of the equation $(3^{x_1}-1)(3^{x_2}-1)=(5^{y_1}-1)(5^{y_2}-1)$
Abstract
Consider the diophantine equation $(3^{x_1}-1)(3^{x_2}-1)=(5^{y_1}-1)(5^{y_2}-1)$ in positive integers $x_1\le x_2$, and $y_1\le y_2$. Each side of the equation is a product of two terms of a given binary recurrence, respectively. In this paper, we prove that the only solution to the title equation is $(x_1,x_2,y_1,y_2)=(1,2,1,1)$. The main novelty of our result is that we allow products of two terms on both sides.
Explore related subjects
Keep this discovery
Kálmán Liptai, László Németh, Gökhan Soydan, László Szalay. 2020-01-27. Resolution of the equation $(3^{x_1}-1)(3^{x_2}-1)=(5^{y_1}-1)(5^{y_2}-1)$. https://doi.org/10.1216/rmj.2020.50.1425
Cite the original work for its findings. Save a collection to share your selection of sources.