Effective Resolution of Diophantine equations of the form un+um=wp1z1⋯pszsu_n+u_m=w p_1^{z_1} \cdots p_s^{z_s}

preprint2016arXivOpen access

Abstract

Let unu_n be a fixed non-degenerate binary recurrence sequence with positive discriminant, ww a fixed non-zero integer and p1,p2,…,psp_1,p_2,\dots,p_s fixed, distinct prime numbers. In this paper we consider the Diophantine equation un+um=wp1z1⋯pszsu_n+u_m=w p_1^{z_1} \cdots p_s^{z_s} and prove under mild technical restrictions effective finiteness results. In particular we give explicit upper bounds for n,mn,m and z1,…,zsz_1, \dots, z_s. Furthermore, we provide a rather efficient algorithm to solve Diophantine equations of the described type and we demonstrate our method by an example.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.