In this paper, an alternative proof is provided for a theorem of R.L.Graham concerning Chebyshev polynomials. While studying the properties of a double star, R.L.Graham [2] proved a theorem concerning Chebyshev polynomials of the first kind ${T_n (x)}$. The purpose of this paper is to provide an alternative proof for his theorem. Our method is based on the divisibility properties of the natural numbers. One may observe that the Chebyshev polynomials evaluated at integers considered by R.L.Graham match with the solutions of the Pell's equation for a general, square-free $D \in N$.
Ramasamy, A., Ponraj, R. (2021). An Alternative Proof for a Theorem of R.L. Graham Concerning CHEBYSHEV Polynomials. Journal of Algorithms and Computation, 53(1), 117-122. doi: 10.22059/jac.2021.81593
MLA
A.M.S.. Ramasamy; R Ponraj. "An Alternative Proof for a Theorem of R.L. Graham Concerning CHEBYSHEV Polynomials". Journal of Algorithms and Computation, 53, 1, 2021, 117-122. doi: 10.22059/jac.2021.81593
HARVARD
Ramasamy, A., Ponraj, R. (2021). 'An Alternative Proof for a Theorem of R.L. Graham Concerning CHEBYSHEV Polynomials', Journal of Algorithms and Computation, 53(1), pp. 117-122. doi: 10.22059/jac.2021.81593
VANCOUVER
Ramasamy, A., Ponraj, R. An Alternative Proof for a Theorem of R.L. Graham Concerning CHEBYSHEV Polynomials. Journal of Algorithms and Computation, 2021; 53(1): 117-122. doi: 10.22059/jac.2021.81593
)