Abstract
We give several effective and explicit results concerning the values of some polynomials in binary recurrence sequences. First we provide an effective finiteness theorem for certain combinatorial numbers (binomial coefficients, products of consecutive integers, power sums, alternating power sums) in binary recurrence sequences, under some assumptions. We also give an efficient algorithm (based on genus 1 curves) for determining the values of certain degree 4 polynomials in such sequences. Finally, partly by the help of this algorithm we completely determine all combinatorial numbers of the above type for the small values of the parameter involved in the Fibonacci, Lucas, Pell and associated Pell sequences.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. U. Alfred, On square Lucas numbers, Fibonacci Quart., 2 (1964), 11–12.
A. Baker, The Diophantine equation y 2 = ax 3 + bx 2 + cx + d, J. London Math. Soc., 43 (1968), 1–9.
W. Bosma, J. Cannon and C. Playoust, The Magma algebra system. I. The user language., J. Symbolic Comput., 24 (1997), 235–265.
B. Brindza, On S-integral solutions of the equation y m = f(x), Acta Math. Hungar., 44 (1984), 133–139.
N. Bruin and M. Stoll, Two-cover descent on hyperelliptic curves, ArXiv preprint, arXiv: 0803.2052, 2008.
Y. Bugeaud, M. Mignotte and S. Siksek, Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers, Ann. of Math. (2), 163 (2006), 969–1018.
J. H. E. Cohn, Square Fibonacci numbers, Etc., Fibonacci Quart., 2 (1964), 109–113.
J. H. E. Cohn, On square Fibonacci numbers, J. London Math. Soc., 39 (1964), 537–540.
J. H. E. Cohn, Lucas and Fibonacci numbers and some Diophantine equations, Proc. Glasgow Math. Assoc., 7 (1965), 24–28.
J. H. E. Cohn, Perfect Pell powers, Glasgow Math. J., 38 (1996), 19–20.
I. Connell, Addendum to a paper of Harada and Lang, J. Algebra, 145 (1992), 463–467.
J. Gebel, A. Pethő and H. G. Zimmer, Computing integral points on elliptic curves, Acta Arith., 68 (1994), 171–192.
L. Hajdu and Á. Pintér, Combinatorial diophantine equations, Publ. Math. Debrecen, 56 (2000), 391–403.
K. Harada and M. L. Lang, Some elliptic curves arising from the Leech lattice, J. Algebra, 125 (1989), 298–310.
E. Herrmann, Bestimmung aller ganzzahligen Lösungen quartischer elliptischer diophantischer Gleichungen unter Verwendung von Linearformen in elliptischen Logarithmen, Diploma thesis, 1998.
T. Kovács, Combinatorial Diophantine equations — the genus 1 case, Publ. Math. Debrecen, 72 (2008), 243–255.
W. L. Mcdaniel, Triangular numbers in the Pell sequence, Fibonacci Quart., 34 (1996), 105–107.
L. Ming, On triangular Fibonacci numbers, Fibonacci Quart., 27 (1989), 98–108.
L. Ming, On triangular Lucas numbers, Applications of Fibonacci Numbers, 4 (1991), 231–240.
L. Moser and L. Carlitz, Problem H-2, Fib. Quarterly, 1 (1963), 46.
I. Nemes and A. Pethő, Polynomial values in linear recurrences II, J. Number Theory, 24 (1986), 47–53.
C. S. Ogilvy, Tomorrow’s math, unsolved problems for the amateur, Oxford Univ. Press, 1962.
A. Pethő, On the Solution of the Equation G n = P(x), Fibonacci Numbers and Their Applications, D. Reidel Publ. Comp., 1986, 193–201.
A. Pethö, Diofantoszi egyenletek effektív és explicit megoldása, Academic doctoral dissertation, Hungarian Academy of Sciences, 1990 (in Hungarian).
A. Pethő, The Pell sequence contains only trivial perfect powers, Sets, Graphs and Numbers, Budapest (Hungary), Colloq. Math. Soc. János Bolyai 60, 1991, 561–568.
Y. Ping-Zhi, On a special diophantine equation a( x n ) = by r + c, Publ. Math. Debrecen, 44 (1994), 137–143.
Á. Pintér and Cs. Rakaczki, On the zeros of shifted Bernoulli polynomials, Appl. Math. Comput., 187 (2007), 379–383.
H. Rademacher, Topics in analytic number theory, Die Grundlehren der math. Wissenschaften, Band 169, Springer-Verlag, Berlin, 1973.
Cs. Rakaczki, On some Diophantine results related to Euler polynomials, Period. Math. Hungar., 57 (2008), 61–71.
A. P. Rollett, Problem 5080, Amer. Math. Monthly, 70 (1963), 216.
T. N. Shorey and R. Tijdeman, Exponential diophantine equation, Cambridge University Press, 1986.
R. J. Stroeker and N. Tzanakis, Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms, Acta Arith., 67 (1994), 177–196.
R. J. Stroeker and N. Tzanakis, Computing all integer solutions of a genus 1 equation, Math. Comp., 72 (2003), 1935–1946.
L. Szalay, Some polynomial values in binary recurrences, Rev. Colombiana Mat., 35 (2001), 99–106.
L. Szalay, On the resolution of the equation U n = ( x3 and V n = ( x3 ), Fibonacci Quart., 40 (2002), 9–12.
Sz. Tengely, On the Diophantine equation F(x) = G(y), Acta Arith., 110 (2003), 185–200.
Sz. Tengely, Finding g-gonal numbers in recurrence sequences, submitted.
N. Tzanakis, Solving Elliptic Diophantine Equations by estimating Linear Forms in Elliptic Logarithms. The case of Quartic Equations, Acta Arith., 75 (1996), 165–190.
O. Wyler, In the Fibonacci series F 1 = 1, F 2 = 1, F n+1 = F n + F n−1 the first, second and twelfth terms are squares, Amer. Math. Monthly, 71 (1964), 221–222.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Attila Pethő
Rights and permissions
About this article
Cite this article
Kovács, T. Combinatorial numbers in binary recurrences. Period Math Hung 58, 83–98 (2009). https://doi.org/10.1007/s10998-009-9083-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-009-9083-2