Combinatorial numbers in binary recurrences

DOI10.1007/S10998-009-9083-2MaRDI QIDQ1046812zbMATH OpenOpenAlexFDO

Authors Tünde Kovács

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

zbMATH Keywords

combinatorial numberspolynomial valuesbinary recurrence sequences

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Recurrences (11B37) Computer solution of Diophantine equations (11Y50)

Recommendations

• scientific article; zbMATH DE number 2097493
• scientific article; zbMATH DE number 1355191
• Sums of factorials in binary recurrence sequences
• On the resolution of the equations \(U_n=\binom x3\) and \(V_n=\binom x3\)
• The Diophantine equation \(F_n=P(x)\)

Cites work

• scientific article; zbMATH DE number 3979149 (Why is no real title available?)
• scientific article; zbMATH DE number 4101287 (Why is no real title available?)
• scientific article; zbMATH DE number 3179414 (Why is no real title available?)
• scientific article; zbMATH DE number 17619 (Why is no real title available?)
• scientific article; zbMATH DE number 2097493 (Why is no real title available?)
• scientific article; zbMATH DE number 892620 (Why is no real title available?)
• scientific article; zbMATH DE number 3204780 (Why is no real title available?)
• scientific article; zbMATH DE number 3399320 (Why is no real title available?)
• scientific article; zbMATH DE number 3185062 (Why is no real title available?)
• Addendum to a paper of Harada and Lang
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• Combinatorial Diophantine equations - the genus 1 case
• Combinatorial diophantine equations
• Computing all integer solutions of a genus 1 equation
• Computing integral points on elliptic curves
• Lucas and fibonacci numbers and some diophantine Equations
• On Square Fibonacci Numbers
• On \(S\)-integral solutions of the equation \(y^ m=f(x)\)
• On some Diophantine results related to Euler polynomials
• On the Diophantine equation F(x)=G(y)
• On the zeros of shifted Bernoulli polynomials
• Perfect Pell Powers
• Polynomial values in linear recurrences. II
• Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms
• Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms. The case of quartic equations
• Some elliptic curves arising from the Leech lattice
• The Diophantine Equation y ² = ax ³ +bx ² +cx +d
• The Magma algebra system. I: The user language

Cited in

(10)

• scientific article; zbMATH DE number 3877267 (Why is no real title available?)
• On the resolution of the equations \(U_n=\binom x3\) and \(V_n=\binom x3\)
• On Diophantine equations involving Lucas sequences
• The Diophantine equation \(F_n=P(x)\)
• Linear combinations of prime powers in binary recurrence sequences
• Lucas numbers of the form \(\binom{2^t}{k}\)
• scientific article; zbMATH DE number 2201547 (Why is no real title available?)
• Generalized Lucas numbers of the form \(11x^2\mp 1\)
• On some polynomial values of repdigit numbers
• On special extrema of polynomials with applications to Diophantine problems

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Combinatorial numbers in binary recurrences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046812)