Prime powers in sums of terms of binary recurrence sequences

DOI10.1007/S00605-019-01282-WMaRDI QIDQ2313398zbMATH OpenOpenAlexFDO

Authors Eshita Mazumdar, S. S. Rout

Publication date 19 July 2019

Published in Monatshefte für Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

balancing numbersDiophantine equationslinear forms in logarithmsreduction method

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Counting solutions of Diophantine equations (11D45) Linear forms in logarithms; Baker's method (11J86)

Abstract: Let ${u_n}_{ngeq0}$ be a non-degenerate binary recurrence sequence with positive, square-free discriminant and $p$ be a fixed prime number. In this paper, we have shown the finiteness result for the solutions of the Diophantine equation $u_{n_1}+u_{n_2}+cdots+u_{n_t}=p^z$ with some conditions on $n_i$ for all $1leqileqt$. Moreover, we explicitly find all the powers of three which are sums of three balancing numbers using the lower bounds for linear forms in logarithms. Further, we use a variant of Baker-Davenport reduction method in Diophantine approximation due to Dujella and PethH{o}.

Review text

Consider the Diophantine equation \(u_{n_1}+\dots+u_{n_t}=p^z\) in non-negative integers \(n_1,\dots,n_t\) and \(z\), where \((u_n)\) is a linear recurrence sequence and \(p\) is a prime. If \((u_n)\) is a binary sequence, then under certain assumptions it is proved that the equation has only finitely many soltuins which can be effectively bounded. In the particular case where \((u_n)\) is the sequence of balancing numbers, \(t=3\) and \(p=3\), it is shown that the equation has no solutions with \(n_1>n_2>n_3\). The main tool in the proofs is Baker's method.

Recommendations

• Linear combinations of prime powers in sums of terms of binary recurrence sequences
• Linear combinations of prime powers 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}\)
• scientific article; zbMATH DE number 1305305
• Products of Prime Powers in Binary Recurrence Sequences Part II: The Elliptic Case, with an Application to a Mixed Quadratic-Exponential Equation

Cites work

• 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
• Diophantine equations concerning balancing and Lucas balancing numbers
• Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
• scientific article; zbMATH DE number 426359 (Why is no real title available?)
• scientific article; zbMATH DE number 3875371 (Why is no real title available?)
• scientific article; zbMATH DE number 1200746 (Why is no real title available?)
• scientific article; zbMATH DE number 1215558 (Why is no real title available?)
• scientific article; zbMATH DE number 1391723 (Why is no real title available?)
• Linear combinations of prime powers in binary recurrence sequences
• On a conjecture about repdigits in \(k\)-generalized Fibonacci sequences
• On Square Fibonacci Numbers
• 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=2a
• 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 k-Fibonacci numbers
• Powers of two as sums of two Lucas numbers
• Products of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation

Cited in

(14)

• \(S\)-parts of sums of terms of linear recurrence sequences
• Cullen numbers in sums of terms of recurrence sequence
• Linear combinations of prime powers in binary recurrence sequences
• A balancing problem on a binary recurrence and its associate
• Arithmetical study of recurrence sequences
• On the Zeckendorf representation of smooth numbers
• Balancing sequence contains no prime number
• Sums of S-units in sum of terms of recurrence sequences
• On prime powers in linear recurrence sequences
• On products of 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}\)
• Linear combinations of prime powers in sums of terms of binary recurrence sequences
• Sums of S-units in sum of terms of recurrence sequences. II
• On the resolution of the Diophantine equation U_n + U_m = x^q

This page was built for publication: 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 Q2313398)