# Rational Polynomials That Take Integer Values at the Fibonacci Numbers

• Published in 2016
In the collections
An integer-valued polynomial on a subset $S$ of $\mathbb{Z}$ is a polynomial $f(x) \in \mathbb{Q}[x]$ with the property $f(S) \subseteq \mathbb{Z}$. This article describes the ring of such polynomials in the special case that $S$ is the Fibonacci numbers. An algorithm is described for finding a regular basis, i.e., an ordered sequence of polynomials, the $n$th one of degree $n$, with which any such polynomial can be expressed as a unique integer linear combination.

## Other information

key
RationalPolynomialsThatTakeIntegerValuesattheFibonacciNumbers
type
article
2016-08-02
date_published
2016-06-10

### BibTeX entry

@article{RationalPolynomialsThatTakeIntegerValuesattheFibonacciNumbers,
key = {RationalPolynomialsThatTakeIntegerValuesattheFibonacciNumbers},
type = {article},
title = {Rational Polynomials That Take Integer Values at the Fibonacci Numbers},
author = {Keith Johnson and Kira Scheibelhut},
abstract = {An integer-valued polynomial on a subset {\$}S{\$} of {\$}\mathbb{\{}Z{\}}{\$} is a polynomial {\$}f(x) \in \mathbb{\{}Q{\}}[x]{\$} with the property {\$}f(S) \subseteq \mathbb{\{}Z{\}}{\$}. This article describes the ring of such polynomials in the special case that {\$}S{\$} is the Fibonacci numbers. An algorithm is described for finding a regular basis, i.e., an ordered sequence of polynomials, the {\$}n{\$}th one of degree {\$}n{\$}, with which any such polynomial can be expressed as a unique integer linear combination.},
comment = {},
}