Skip to main content

Latest Post

Power Essence Coefficients and Bernoulli Numbers

Previously, we have explored methods to compute the essence of power functions $Ȣx^n$ which involves solving a large system of linear equations. This method is equivalent to solving for the inverse of a large $n\times n$ matrix where entries are values of pascal's triangle. Though the matrix method allow us to solve for large number of essences at once, it does not extend easily to solve for next iterations of essence coefficients. Rather than reusing the values we have already solved for, we will have to solve for inverse of a separate larger matrix again. Here we will introduce an iterative method for solving for these coefficients. Chapter 0: Recap Let us first remind ourselves of the definition of essence. For a function $f(x)$, we want to find the transformation $Ȣf(x)$ such that we are able to 'smooth out' its series: $$\sum_{i=a}^b f(i) = \int_{a-1}^b Ȣf(x) dx$$ For example, we can solve for the following functions: $$\begin{align*}Ȣ1 &= 1 \\ Ȣx &= x +

The n-Angle Trigonometric with Pascal's Triangles

I'm back at it again with another fun math inquiry. We learn double angle formula for $\sin$ and $\cos$ but we usually do not go any further. Of course, we can build triple and quadruple angle formula with Angle Sum Identities, but why do we not discuss patterns of $\sin(n\theta)$ or $\cos(n\theta)$?
Today, we will discuss intriguing patterns that arrises from n-Angle Trigs.

Basics

Let's first go over the basic identities:
$$\begin{align*}
\sin(\theta + \phi) &= \sin(\theta)\cos(\phi) + \cos(\theta)\sin(\phi) \\
\sin(\theta - \phi) &= \sin(\theta)\cos(\phi) - \cos(\theta)\sin(\phi) \\
\cos(\theta + \phi) &= \cos(\theta)\cos(\phi) - \sin(\theta)\sin(\phi) \\
\cos(\theta - \phi) &= \cos(\theta)\cos(\phi) + \sin(\theta)\sin(\phi) \\
 \sin(2\theta) &= 2\sin(\theta)\cos(\theta) \\
 \cos(2\theta) &= \cos^2 (\theta) - \sin^2(\theta) \end{align*}$$
From these simple identities we can build all n-angled trigs. But why aren't we taught them?
Well, for one thing, solving for the equations become quite complicated and messy. So students are given only the essential identities above and can solve for more complex identities when absolutely necessary (which usually is almost never).

But for sake of fun, and for spirit of Christmas, we will try to expand all n-Angles to their simplest forms.

Expansions

After many, many pages of working-out, getting confused, and reworking-out the expansion, I learned the essential importance of consistent organization. We will order all our terms in descending order of $\cos$.
$$\begin{align*}
\cos(3\theta) & = \cos(\theta + 2\theta)\\
& = \cos(\theta)\cos(2\theta) - \sin(\theta)\sin(2\theta) \\
& = \cos(\theta)( \cos^2(\theta) - \sin^2(\theta) ) - \sin(\theta)(2\sin(\theta)\cos(\theta)) \\
& = \cos^3(\theta) - \cos(\theta)\sin^2(\theta) - 2\cos(\theta)\sin^2(\theta) \\
& = \cos^3(\theta) - 3\cos(\theta)\sin^2(\theta) \\ \\
\sin(3\theta) &= \sin(\theta + 2\theta)\\
& =\sin(\theta)\cos(2\theta) + \cos(\theta)\sin(2\theta) \\
& = \sin(\theta)(\cos^2(\theta) -\sin^2(\theta) ) + \cos(\theta)(2\sin(\theta)\cos(\theta)) \\
& = \cos^2(\theta)\sin(\theta) - \sin^3(\theta) + 2\cos^2(\theta)\sin(\theta) \\
& = 3\cos^2(\theta)\sin(\theta)-\sin^3(\theta)
\end{align*}
$$
Do you see the pattern already?

With these, solving for Quadruple-Angle becomes more manageable.
$$\begin{align*}
\cos(4\theta) & = \cos(\theta + 3\theta) \\
&= \cos(\theta)\cos(3\theta) - \sin(\theta)\sin(3\theta) \\
& = \cos( \theta)( \cos^3(\theta) - 3\cos(\theta)\sin^2(\theta) ) - \sin(\theta)( 3\cos^2(\theta)\sin(\theta) - \sin^3(\theta) ) \\
& = \cos^4(\theta) - 3\cos^2(\theta)\sin^2(\theta) - 3\cos^2(\theta)\sin^2(\theta) + \sin^4(\theta) \\
& = \cos^4(\theta) - 6\cos^2(\theta)\sin^2(\theta) + \sin^4(\theta) \\ \\
\sin(4\theta) & = \sin(\theta + 3\theta) \\
& = \sin(\theta)\cos(3\theta) + \cos(\theta)\sin(3\theta) \\
& = \sin(\theta)( \cos^3(\theta) - 3\cos(\theta)\sin^2(\theta) ) + \cos(\theta)( 3\cos^2(\theta)\sin(\theta) - \sin^3(\theta) ) \\
&= \cos^3(\theta)\sin(\theta) - 3\cos(\theta)\sin^3(\theta) + 3\cos^3(\theta)\sin(\theta) - \cos(\theta)\sin^3(\theta) \\
& = 4\cos^3(\theta)\sin(\theta) - 4\cos(\theta)\sin^3(\theta)
\end{align*}$$
Do you see the pattern now?

Patterns in Coefficients 

The coefficients are every other values from the Pascal's Triangle with alternating signs!


With this, we can predict the next Identities to be
$$\begin{align*}
\cos(5\theta) & = \cos^5(\theta) - 10\cos^3(\theta)\sin^2(\theta) + 5\cos(\theta)\sin^4(\theta) \\ \sin(5\theta) & = 5\cos^4(\theta)\sin(\theta) - 10\cos^2(\theta)\sin^3(\theta) + \sin^5(\theta) \\ \\
\cos(6\theta) & = \cos^6(\theta) - 15\cos^4(\theta)\sin^2(\theta) + 15\cos^2(\theta)\sin^4(\theta) - \sin^6(\theta) \\
\sin(6\theta) & = 6\cos^5(\theta)\sin(\theta) - 20\cos^3(\theta)\sin^3(\theta) + 6\cos(\theta)\sin^5(\theta) \\ \\
\cos(7\theta) & = \cos^7(\theta) - 21\cos^5(\theta)\sin^2(\theta) + 35\cos^3(\theta)\sin^4(\theta) -7\cos(\theta)\sin^6(\theta) \\
\sin(7\theta) & = 7\cos^6(\theta)\sin(\theta) - 35\cos^4(\theta)\sin^3(\theta) + 21\cos^2(\theta)\sin^5(\theta) - \sin^7(\theta)\\
\vdots
\end{align*}$$
and indeed, they are true. And in fact, even the Double-Angle Formulas fits this description.
You can find n-Angle Trigonometry using Pascal'sTriangle!

$$\begin{align*}
\cos(n\theta) & = \binom{n}{0}\cos^n(\theta) - \binom{n}{2}\cos^{n-2}(\theta)\sin^2(\theta) + \binom{n}{4}\cos^{n-4}(\theta)\sin^4(\theta) - \dots + (-1)^x \binom{n}{2x} \cos^{n-2x}(\theta) \sin^{2x}(\theta) - \dots \\
\sin(n\theta) &= \binom{n}{1}cos^{n-1}(\theta)\sin(\theta) - \binom{n}{3}\cos^{n-3}(\theta)\sin^3(\theta) + \binom{n}{5}\cos^{n-5}(\theta)\sin^5(\theta) - \dots + (-1)^x\binom{n}{2x + 1}\cos^{n-2x-1}(\theta)\sin^{2x+1}(\theta) - \dots
\end{align*}$$
So why does this turn out this way?

Euler's Formula

First, if we add the two $\cos$ and $\sin$ together and order them, we get the full Binomials. Using $n=5$ as an example, we get
$$\cos(5\theta)+\sin(5\theta) = \\
\cos^5(\theta) + 5\cos^4(\theta)\sin(\theta) - 10\cos^3(\theta)\sin^2(\theta) - 10\cos^2(\theta)\sin^3(\theta) + 5\cos(\theta)\sin^4(\theta) + \sin^5(\theta)
$$
This has a striking resemblance to $(\cos(\theta)-\sin(\theta))^5$ with one crucial difference: instead of signs alternating each term, it is grouped into pairs. This alternating every second term occurs when $i$ is involved.
In fact, if we multiply $\sin(5\theta)$ by $i$, we can perfectly factor the equation into a polynomial.
$$\cos(5\theta)+i\sin(5\theta) = (\cos(\theta)+i\sin(\theta))^5$$ This generalizes to
$$\cos(n\theta)+i\sin(n\theta) = (\cos(\theta) + i\sin(\theta))^n$$
The Euler fan will now already know where this is headed. When we see a $\cos(\theta)+i\sin(\theta)$ we immediately know it equals to $e^{i\theta}$, thanks to Euler's Formula.
With help of Euler, we find a simple proof for this:
$$\begin{align*}
\cos(n\theta)+i\sin(n\theta) & = e^{i*n\theta} \\
& = (e^{i\theta})^n \\
& = (\cos(\theta) + i\sin(\theta))^n \, \blacksquare
\end{align*}$$
and for $n \in \mathbb{N}$ we can use Pascal's Triangle to generate the necessary coefficients.
$$(\cos(\theta)+i\sin(\theta))^n = \binom{n}{0}\cos^n(\theta)+i\binom{n}{1}\cos^{n-1}(\theta)\sin(\theta)-\binom{n}{2}\cos^{n-2}(\theta)\sin^2(\theta)-i\binom{n}{3}\cos^{n-3}(\theta)\sin^3(\theta)+\dots$$ Since only every second terms of expanded polynomial carry $i$, every other coefficient belongs to either $\cos(n\theta)$ or $\sin(n\theta)$.

Once again, any interesting concept we seemed to have stumbled upon, Euler had discovered centuries ago. But this doesn't make the journey any less exciting. We can keep exploring until we come across a idea truly original.


Comments

  1. I've never thought of anything like this.You are a math genius...

    ReplyDelete

Post a Comment

Popular posts from this blog

Large Polynomial Series using Matrices (Calculating Bernoulli's Number with Pascal Matrix)

Polynomial Series can be easily solved using Power Series Formulas for each term in the polynomial. However, this can be frustrating since not every Power Formula are intuitive to memorize. We would like to find a more elegant and easier-to-recall formula for computing a Polynomial Series. This can be done using matrices. Notations and Equations We will borrow the notations and simple equations from Sequence Curve articles . There, we have extended a series to be continuous through the following identity: $$\sum_{i=m}^n f(i) = \int_{m-1}^nȢ\{f(x)\}dx $$ The $Ȣ\{f(x)\}$ acts as the rate of change of a series relative to its bounds. $$\frac{d}{dt} \sum_{i=m}^nf(i) = Ȣ\{f(n)\}\frac{dn}{dt} - Ȣ\{f(m-1)\}\frac{dm}{dt}$$ Letting $t=m=n$, we find $$\frac{d}{dt} \sum_{i=t}^tf(i) = \frac{d}{dt}f(t)= Ȣ\{f(t)\} - Ȣ\{f(t-1)\} $$ Remebering that $Ȣ$ Transformation is Linear, we can derive a simple identity of $$\frac{d}{dx}f(x+1) = Ȣ\{f(x+1)\} - Ȣ\{f(x)\} = Ȣ\{f(x+1)-f(x)\}$$ This will be use

Partition Counter using Trees, Recursion, Tables, and Algorithm

Partitions are number of ways an integer can be represented as sum of positive integers. We can ask, for example, what is the partition of 5? If we write out every possible combination, $$\begin{align*}  5 &= 1+1+1+1+1 \\  &= 1+1+1+2\\ &= 1+1+3\\ &= 1+4\\ &= 1+2+2\\ &= 2+3\\  &= 5 \end{align*} $$ we can see that partition of 5 is 7. One will immediately notice, however, that this is not the most efficient approach to answering the question: not only does partition grow quickly, attempting to organize and not miss or repeat an algebraic expression becomes messy and impractical. Chapter 1: Partition Tree A cleaner, but still not the best, approach would be to use tree diagrams to represent the partitions of a number. In a Partition Tree of $n$, every path to a terminating node will add up to the number $n$. And also, every child of a node (every nodes below a given parent node) will always be greater than or equal to the parent node in order to not

Vector Plane Rotation

Vector is a useful tool in maths and in physics that describes both magnitude and direction in a space. Vectors are used to describe concepts where direction matter, such as forces and velocity. For example, two cars can have same speed(scalar) but if one if heading north and the other south, they will have different velocity(vector). Vectors are usually written in terms of their components. Components are magnitude of the vector in one dimension. In 2D space, vector can be represented as coordinate of 2 components, <x,y>, and in 3D space, vector can be represented as coordinate of 3 components, <x, y, z>. Breaking down vectors into their components is extremely useful, especially in physics, because it allows one to break down complicated changes in vector into simpler and easier-to-work-with changes in its components. Take a look at projectile motion, for example. Velocity of an object fired up into the sky at an angle changes both its direction and magnitude. Attem

Summation of Harmonic Interval and Simplified Riemann Sum

When you first learn of Summation in Pre-Calc class, it is probably in build-up to Riemann Sum. You are taught the basics of Summation and simple manipulations, such a $\sum_nc*a_n = c*\sum_na_a$ for constant $c$, but you don't get to explore deeper into Summations and really play around with it. One thing that really intrigued me was why Summations only incremented by a unit. When we have a Sum like $\sum_{n=3}^{10}a_n$, it is equal to $a_3+a_4+a_5+\dots+a_9+a_{10}$, always incrementing by a unit( $1$ ). Why couldn't we Sum with interval that is not a unit? How could we have something like $a_3+a_{3.5}+a_4+a_{4.5}+a_5+a_{5.5}+\dots+a_{8.5}+a_9+a_{9.5}+a_{10}$, incrementing by a half instead of a full unit? Sets Of course you technically can use Sets and Set Builder Notation to create a specific Summation. $$\sum_{i \in S}i,S=\{\frac{x}{2}|x\in\mathbb{N_0}\} \, = \, 0+\frac{1}{2}+1+\frac{3}{2}+\dots$$ The above is Sum of all Rational Numbers incrementing by $\frac{1