加载中…
In this paper we consider the minimal polynomial of . We introduce some polynomial sequences with the same recurrence relation as the rescaled Chebyshev polynomials of the first kind, which turn out to be related to those of various kinds, all coming from those of the second kind. We see that are divisible by the square of either of these polynomials. Then by appropriately removing unnecessary factors from these polynomials, we can easily calculate without recursion, which improves Barnes’ result in 1977. As an appendix, we give a compact table of the minimal polynomials of for .

生成讲解博客的中文版本

生成AI智能校验的中文版本