Diophantine Equation with Balancing-like Sequences Associated to the Pillai-Tijdeman-type Problem

Abstract

Let \xn\n ≥ 0 be the balancing-like sequence defined by xn+1 = A xn - xn-1, for A>2, where x0 = 0 and x1 = 1. In this paper, we demonstrate how to find all the solutions of the Diophantine equation, C1xn1 + C2xn2 + C3xn3 = C4xn4 + C5xn5 + C6xn6, in fixed integer A ≥ 3, n1 > n2 > n3≥ 0, n4 >n5 > n6 ≥ 0, and C1xn1 ≠ C4 xn4, where C1, C2, C3, C4, C5, C6 are given integers such that C1 C2 C3 ≠ 0.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…