A combinatorial approach to the Fourier expansions of powers of cos and sin
Abstract
We present a new combinatorial approach to the computation of the (real) Fourier expansions of n(t) and n(t), where n≥ 1 is an integer. As an application, we compute the Fourier expansions of f(t)=1a- t and g(t)=1a- t, where a∈ R with |a|>1.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.