On prime powers in linear recurrence sequences
From MaRDI portal
Recommendations
Cites work
- A sharpening of the bounds for linear forms in logarithms II
- 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
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
- scientific article; zbMATH DE number 3882509 (Why is no real title available?)
- scientific article; zbMATH DE number 3924872 (Why is no real title available?)
- scientific article; zbMATH DE number 3979149 (Why is no real title available?)
- scientific article; zbMATH DE number 1973372 (Why is no real title available?)
- Linear forms in two logarithms and interpolation determinants II
- Multiplicative independence in k-generalized Fibonacci sequences
- ON PERFECT POWERS IN LINEAR RECURRENCE SEQUENCES OF INTEGERS
- On the Diophantine equation $ax^{2t}+bx^ty+cy^2=d$ and pure powers in recurrence sequences.
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2
Cited in
(7)- Perfect powers in linear recurring sequences
- Arithmetical study of recurrence sequences
- Tribonacci numbers that are products of two Fibonacci numbers
- 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}\)
- On Tribonacci numbers written as a product of two Perrin numbers
- On Tribonacci numbers written as a product of three Fibonacci numbers
This page was built for publication: On prime powers in linear recurrence sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081636)