Polynomial values in linear recurrences. II

DOI10.1016/0022-314X(86)90056-9zbMath0591.10007OpenAlexW2069733676MaRDI QIDQ1074616

István Nemes, Attila Pethoe

Publication date: 1986

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-314x(86)90056-9

zbMATH Keywords

Chebyshev polynomialsequenceintegral solutionspolynomial with integer coefficientsbinary linear recurrencesecond order linear recurrence sequence

Mathematics Subject Classification ID

Recurrences (11B37) Diophantine equations (11D99)

Related Items (5)

Generating functions, Fibonacci numbers and rational knots ⋮ On the Lucas sequence equation \(\frac{1}{U_n}=\sum_{k=1}^{\infty} \frac{U_{k-1}}{x^k} \) ⋮ On special extrema of polynomials with applications to Diophantine problems ⋮ The Diophantine equation Fn = P(x) ⋮ Combinatorial numbers in binary recurrences

Cites Work

• Perfect powers in second order linear recurrences
• Prime and composite polynomials
• On the Diophantine equation $ax^{2t}+bx^ty+cy^2=d$ and pure powers in recurrence sequences.
• On Square Pseudo-Lucas Numbers
• On Square Fibonacci Numbers
• On Fibonacci numbers which are one more than a square.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial values in linear recurrences. II