Linear combinations of prime powers in sums of terms of binary recurrence sequences

preprint2016arXivOpen access

Abstract

Let {Un}n≥0\{ {U_{n}\}_{n \geq 0} } be a non-degenerate binary recurrence sequence with positive discriminant. Let {p1,…,ps}\{p_1,\ldots, p_s\} be fixed prime numbers and {b1,…,bs}\{b_1,\ldots ,b_s\} be fixed non-negative integers. In this paper, we obtain the finiteness result for the solution of the Diophantine equation Un1+⋯+Unt=b1p1z1+⋯+bspszsU_{n_{1}} + \cdots + U_{n_{t}} = b_1 p_1^{z_1} + \cdots+ b_s p_s^{z_s} under certain assumptions. Moreover, we explicitly solve the equation Fn1+Fn2=2z1+3z2F_{n_1}+ F_{n_2}= 2^{z_1} +3^{z_2}, in non-negative integers n1,n2,z1,z2n_1, n_2, z_1, z_2 with z2≥z1z_2\geq z_1. The main tools used in this work are the lower bound for linear forms in logarithms and the Baker-Davenport reduction method.

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.