# Sums of $S$-units in sum of terms of recurrence sequences

Source: [Sums of $S$-units in sum of terms of recurrence sequences](<https://www.sota2.com/research/paper/68fa5a271e209131ce9bd4da>)

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

Data updated: 2025-10-25T16:19:39.178Z

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

Published: 2021-04-10T16:44:28.000Z

## Abstract

Let $S := \\{p\_1,\\ldots ,p\_{\\ell}\\}$ be a finite set of primes and denote by $\\mathcal{U}\_S$ the set of all rational integers whose prime factors are all in $S$. Let $(U\_n)\_{n\\geq 0}$ be a non-degenerate linear recurrence sequence with order at least two. In this paper, we provide a finiteness result for the solutions of the Diophantine equation $aU\_n + bU\_m = z\_1 +\\cdots +z\_r,$ where $n\\geq m$ and $z\_1, \\ldots, z\_r\\in \\mathcal{U}\_S$.

## 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/2104.04808>)

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