Given an integer n ≥ 0, generate the n-th Chebyshev polynomial of the 1st Kind.
Examples:
chebyshev1stKindPoly(0)
ans =
1 chebyshev1stKindPoly(1)
ans =
1 0 chebyshev1stKindPoly(2)
ans =
2 0 -1Neither string operations nor interpolations are allowed!
Solution Stats
Solution Comments
Problem Recent Solvers40
Suggested Problems
-
Find state names that start with the letter N
460 Solvers
-
581 Solvers
-
Sum all integers from 1 to 2^n
6271 Solvers
-
Getting the indices from a vector
1405 Solvers
-
151 Solvers
More from this Author18
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Solution 1422711
Hi ! I've tried solving your problem using a recursive method, only to be met by a "While evaluating the solution, the server encountered an error caused by long running MATLAB code. Edit the code if needed and then submit." Are recursive codes computable by the matlab online platform ?
Regards,
Adel
Hi! You are overdoing it by using a "for" loop with the recursion: it takes too long and an error is thrown. Remove the loop and try again. Good luck!
Regards, Yaroslav