Fungrim home page

Fungrim entry: ae791d

Tn ⁣(x)=k=0n/2(n2k)(x21)kxn2kT_{n}\!\left(x\right) = \sum_{k=0}^{\left\lfloor n / 2 \right\rfloor} {n \choose 2 k} {\left({x}^{2} - 1\right)}^{k} {x}^{n - 2 k}
Assumptions:nZ0  and  xCn \in \mathbb{Z}_{\ge 0} \;\mathbin{\operatorname{and}}\; x \in \mathbb{C}
T_{n}\!\left(x\right) = \sum_{k=0}^{\left\lfloor n / 2 \right\rfloor} {n \choose 2 k} {\left({x}^{2} - 1\right)}^{k} {x}^{n - 2 k}

n \in \mathbb{Z}_{\ge 0} \;\mathbin{\operatorname{and}}\; x \in \mathbb{C}
Fungrim symbol Notation Short description
ChebyshevTTn ⁣(x)T_{n}\!\left(x\right) Chebyshev polynomial of the first kind
Sumnf(n)\sum_{n} f(n) Sum
Binomial(nk){n \choose k} Binomial coefficient
Powab{a}^{b} Power
ZZGreaterEqualZn\mathbb{Z}_{\ge n} Integers greater than or equal to n
CCC\mathbb{C} Complex numbers
Source code for this entry:
    Formula(Equal(ChebyshevT(n, x), Sum(Mul(Mul(Binomial(n, Mul(2, k)), Pow(Sub(Pow(x, 2), 1), k)), Pow(x, Sub(n, Mul(2, k)))), For(k, 0, Floor(Div(n, 2)))))),
    Variables(n, x),
    Assumptions(And(Element(n, ZZGreaterEqual(0)), Element(x, CC))))

Topics using this entry

Copyright (C) Fredrik Johansson and contributors. Fungrim is provided under the MIT license. The source code is on GitHub.

2020-04-08 16:14:44.404316 UTC