441
Views
2
CrossRef citations to date
0
Altmetric
Notes

Factoring Variants of Chebyshev Polynomials of the First and Second Kinds with Minimal Polynomials of cos(2π/d)

ORCID Icon
Pages 172-176 | Received 10 Sep 2020, Accepted 28 May 2021, Published online: 06 Jan 2022
 

Abstract

We solve the open problem of Y. Z. Gürtaş of factoring polynomials Un(x)±1, where Un(x) are Chebyshev polynomials of the second kind. While the factors of Un(x)21 were known, the pattern of their mapping to Un(x)+1 and Un(x)1 was not, and it was intriguing. Each factor is a polynomial of the form Ψd(x) with integer coefficients whose roots are cos(2πk/d). We then consider the analogous problem for Chebyshev polynomials of the first kind by deriving a factorization of Tn(x)21. This factorization enables the method used to solve the open problem to be applied to this one, resulting in a more direct proof.

ACKNOWLEDGMENTS

I thank the referees and Susan Jane Colley for their helpful suggestions. I am grateful to the College of Engineering & Computer Science at The Australian National University for research support.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 87.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.