Combinatorial numbers in binary recurrences
From MaRDI portal
Publication:1046812
DOI10.1007/s10998-009-9083-2zbMath1212.11020OpenAlexW2093688200MaRDI QIDQ1046812
Publication date: 29 December 2009
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2437/94637
Computer solution of Diophantine equations (11Y50) Recurrences (11B37) Special sequences and polynomials (11B83)
Related Items
Linear combinations of prime powers in binary recurrence sequences ⋮ On some polynomial values of repdigit numbers ⋮ On Diophantine equations involving Lucas sequences ⋮ On special extrema of polynomials with applications to Diophantine problems ⋮ Lucas numbers of the form (2t/k) ⋮ The Diophantine equation Fn = P(x) ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some elliptic curves arising from the Leech lattice
- On \(S\)-integral solutions of the equation \(y^ m=f(x)\)
- On the zeros of shifted Bernoulli polynomials
- On some Diophantine results related to Euler polynomials
- Polynomial values in linear recurrences. II
- Addendum to a paper of Harada and Lang
- The Magma algebra system. I: The user language
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms
- Computing integral points on elliptic curves
- Computing all integer solutions of a genus 1 equation
- On the Diophantine equation F(x)=G(y)
- Perfect Pell Powers
- Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms. The case of quartic equations
- Lucas and fibonacci numbers and some diophantine Equations
- On Square Fibonacci Numbers
- The Diophantine Equation y 2 = ax 3 +bx 2 +cx +d
