# On the resolution of the Diophantine equation $U\_n + U\_m = x^q$

Source: [On the resolution of the Diophantine equation $U\_n + U\_m = x^q$](<https://www.sota2.com/research/paper/68fa5c161e209131ce9cdfad>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T17:26:27.186Z

Authors: P.K. Bhoi, S.S. Rout, G. K. Panda

Published: 2022-02-24T07:23:10.000Z

## Abstract

Suppose that $(U\_{n})\_{n \\geq 0}$ is a binary recurrence sequence and has a dominant root $\\alpha$ with $\\alpha\>1$ and the discriminant $D$ is square-free. In this paper, we study the Diophantine equation $U\_n + U\_m = x^q$ in integers $n \\geq m \\geq 0$, $x \\geq 2$, and $q \\geq 2$. Firstly, we show that there are only finitely many of them for a fixed $x$ using linear forms in logarithms. Secondly, we show that there are only finitely many solutions in $(n, m, x, q)$ with $q, x\\geq 2$ under the assumption of the {\\em abc-conjecture}. To prove this, we use several classical results like Schmidt subspace theorem, a fundamental theorem on linear equations in $S$-units and Siegel's theorem concerning the finiteness of the number of solutions of a hyperelliptic equation.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2202.11934>)

[PDF](<https://arxiv.org/pdf/2202.11934.pdf>)
