Due at 4:59pm in my mailbox in SAS 3151, Tuesday, February 3, 2015

All solutions must be submitted in hardcopy
either to me in class or placed in my mailbox.

Note my office hours on my
schedule.

- Prove by induction that for the n-th Chebyshev Polynomial T_n(x) in the variable x,
defined by the linear recurrence T_0 = 1, T_1(x) = x, T_{n+2}(x) = 2xT_{n+1}(x) - T_n(x) for all n ≥ 0 one has

T_n( (y + 1/y)/2 ) = (y^n + y^(-n))/2 for all n ≥ 0, y ≠ 0.

- Consider
*C*from ENT, §1.2, Problem 10, page 12. Prove that_{n}*C*for all_{n}= binomial(2n,n) - binomial(2n,n-1)*n ≥ 1*, thus showing that the*C*are integers._{n} - ENT, §2.2, Problem 20(f), page 25.
Prove first that GCD(a,b
^{2}) = 1, and that for g = GCD(a^{2}, b^{2}), GCD(a,g) = 1. - ENT, §2.4, Problem 2(b), page 31. Please compute the Bezout coefficients by the extended Euclidean algorithm presented in class, not the back-substitution given in the book.
- Prove for the extended Euclidean algorithm described in class:
*s*for all_{k}t_{k+1}- s_{k+1}t_{k}= (-1)^{k+1}*-1 ≤ k ≤ n*