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

DOI10.1007/S10986-017-9374-ZMaRDI QIDQ683367zbMATH OpenOpenAlexFDO

Authors Nabin Kumar Meher, S. S. Rout

Publication date 6 February 2018

Published in Lithuanian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1612.05869

zbMATH Keywords

Diophantine equationslinear recurrence sequencereduction methodlinear forms in logarithms

Mathematics Subject Classification ID

Recurrences (11B37) Diophantine equations in many variables (11D72) Linear forms in logarithms; Baker's method (11J86)

Abstract: Let ${U_n}_{ngeq0}$ be a non-degenerate binary recurrence sequence with positive discriminant. Let $p_1,ldots,p_s$ be fixed prime numbers and $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 $U_{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 $F_{n_1}+F_{n_2}=2^{z_1}+3^{z_2}$, in non-negative integers $n_1,n_2,z_1,z_2$ with $z_{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.

Recommendations

• Prime powers in sums of terms of binary recurrence sequences
• Linear combinations of prime powers in binary recurrence sequences
• Multiplicative relations on binary recurrences
• Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
• Diophantine equations with products of consecutive members of binary recurrences

Cites work

• scientific article; zbMATH DE number 426359 (Why is no real title available?)
• scientific article; zbMATH DE number 4055706 (Why is no real title available?)
• scientific article; zbMATH DE number 1215558 (Why is no real title available?)
• scientific article; zbMATH DE number 508846 (Why is no real title available?)
• scientific article; zbMATH DE number 1408152 (Why is no real title available?)
• An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
• Fibonacci and Lucas numbers of the form \(2^a+3^b+5^c\)
• Fibonacci numbers at most one away from a perfect power
• Fibonacci numbers of the form \(p^a\pm p^b+1\)
• Fibonacci numbers of the form \(p^a\pm p^b\)
• Linear combinations of prime powers in binary recurrence sequences
• On the Diophantine equation $ax^{2t}+bx^ty+cy^2=d$ and pure powers in recurrence sequences.
• On the Diophantine equation \(F_n + F_m=2^a\)
• On the sum of powers of two consecutive Fibonacci numbers
• Perfect Pell Powers
• Perfect powers in second order linear recurrences
• Powers of two as sums of three Fibonacci numbers
• Powers of two as sums of two Lucas numbers
• Powers of two as sums of two \(k\)-Fibonacci numbers
• Prime powers in sums of terms of binary recurrence sequences
• THE EQUATIONS 3x²−2 = y² AND 8x²−7 = z²

Cited in

(14)

• Multiplicative relations on binary recurrences
• Sums of factorials in binary recurrence sequences
• Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
• Diophantine equations with products of consecutive members of binary recurrences
• An exponential Diophantine equation related to powers of three consecutive Fibonacci numbers
• Linear combinations of prime powers in \(X\)-coordinates of Pell equations
• Prime powers in sums of terms of binary recurrence sequences
• Sums of \(S\)-units in sum of terms of recurrence sequences
• Linear combinations of prime powers in binary recurrence sequences
• On Diophantine equations involving sums of Fibonacci numbers and powers of 2
• On prime powers in linear recurrence sequences
• On the Diophantine equations of the form \(\lambda_1 U_{n_1} + \lambda_2 U_{n_2} +\cdots +\lambda_k U_{n_k} = wp_1^{z_1}p_2^{z_2} \cdots p_s^{z_s}\)
• Cullen numbers in sums of terms of recurrence sequence
• Linear combinations of factorials and \(S\)-units in a binary recurrence sequence

This page was built for publication: Linear combinations of prime powers in sums of terms of binary recurrence sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683367)