Rational Polynomials That Take Integer Values at the Fibonacci Numbers

• Published in 2016
• Added on 2016-08-02

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.

Links

• http://www.jstor.org/stable/10.4169/amer.math.monthly.123.4.338

Other information

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 = {},
	date_added = {2016-08-02},
	date_published = {2016-10-09},
	urls = {http://www.jstor.org/stable/10.4169/amer.math.monthly.123.4.338},
	collections = {Fibonaccinalia,Fun maths facts,Integerology},
	url = {http://www.jstor.org/stable/10.4169/amer.math.monthly.123.4.338},
	urldate = {2016-08-02},
	year = 2016
}