Open Access
Winter 2005 On a Problem of Berzsenyi Regarding the GCD of Polynomial Expressions
Les Reid
Missouri J. Math. Sci. 17(1): 3-11 (Winter 2005). DOI: 10.35834/2005/1701003

Abstract

Let $G(m,k)=\max\lbrace \text{GCD}((n+1)^m+k,n^m+k)\ |\ n \in \mathbb N \rbrace$. The fact that $G(1,k)=1$ is trivial and Berzsenyi has shown that $G(2,k)=|4k+1|$. We give explicit formulas for $G(m,k)$ for $m=3,4,5$.

Citation

Download Citation

Les Reid. "On a Problem of Berzsenyi Regarding the GCD of Polynomial Expressions." Missouri J. Math. Sci. 17 (1) 3 - 11, Winter 2005. https://doi.org/10.35834/2005/1701003

Information

Published: Winter 2005
First available in Project Euclid: 22 August 2019

zbMATH: 1119.11005
Digital Object Identifier: 10.35834/2005/1701003

Rights: Copyright © 2005 Central Missouri State University, Department of Mathematics and Computer Science

Vol.17 • No. 1 • Winter 2005
Back to Top