View More View Less
  • 1 University of Debrecen Institute of Mathematics Debrecen P.O. Box 12. H-4010 Hungary
Restricted access


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.

Monthly Content Usage

Abstract Views Full Text Views PDF Downloads
Aug 2020 5 0 0
Sep 2020 0 0 0
Oct 2020 3 0 0
Nov 2020 0 0 0
Dec 2020 2 0 0
Jan 2021 1 0 0
Feb 2021 0 0 0