Linear combinations of prime powers in binary recurrence sequences
From MaRDI portal
Recommendations
- Linear combinations of prime powers in sums of terms of binary recurrence sequences
- Perfect powers from the sums of terms of linear recurrences
- Prime powers in sums of terms of binary recurrence sequences
- scientific article; zbMATH DE number 1305305
- ON PERFECT POWERS IN LINEAR RECURRENCE SEQUENCES OF INTEGERS
Cites work
- A Hasse-type principle for exponential Diophantine equations and its applications
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- Carmichael's lambda function
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Combinatorial numbers in binary recurrences
- Fibonacci and Lucas numbers of the form \(2^a+3^b+5^c\)
- scientific article; zbMATH DE number 426359 (Why is no real title available?)
- scientific article; zbMATH DE number 3979149 (Why is no real title available?)
- scientific article; zbMATH DE number 508846 (Why is no real title available?)
- Linear combinations of factorials and S-units in a binary recurrence sequence
- On the Diophantine equation $ax^{2t}+bx^ty+cy^2=d$ and pure powers in recurrence sequences.
- Perfect powers in second order linear recurrences
- The Magma algebra system. I: The user language
Cited in
(16)- Sums of \(S\)-units in recurrence sequences
- Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
- A Hasse-type principle for exponential Diophantine equations over number fields and its applications
- Linear combinations of prime powers in X-coordinates of Pell equations
- Sums of \(S\)-units in the solution sets of generalized Pell equations
- Linear combinations of factorials and S-units in a binary recurrence sequence
- Prime powers in sums of terms of binary recurrence sequences
- \(k\)-Fibonacci powers as sums of powers of some fixed primes
- On the exponential Diophantine equation \(P_n^x+P_{n+1}^x+\cdots +P_{n+k-1}^x=P_m\)
- A linear recurrence sequence of composite numbers
- Nonnegative integer solutions of the equation \(F_{n}-F_{m}=5^{a}\)
- On the exponential Diophantine equation Pxn+Pxn+1=Pm
- Sums of S-units in sum of terms of recurrence sequences
- Linear combinations of prime powers in sums of terms of binary recurrence sequences
- Integers represented by binary recursive sequences
- Sums of S-units in sum of terms of recurrence sequences. II
This page was built for publication: Linear combinations of prime powers in binary recurrence sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965766)
