Skip to main content

Posts

Showing posts from December, 2019

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 +...
1 comment
Read more

Sequence Curve: Essence of Exponential with Essence Formula

Last time, we explored Essence of Power Functions. This time, we will try to calculate for Essence of Exponentials in a similar way. $$\sum_{i=n}^m r^i = \int_{n-1}^mȢ\{r^x\}dx$$ Sequence Flatlining We were able to find Essence of Power functions using Sequence Flatlining. The basic idea behind Sequence Flatlining is to differentiate the equation for sequence until you reach 0 (Check out Sequence Curve: Essence of Power Function  for more). This method, however, will not work for Exponential Functions because they will never differentiate to 0. We will need to find another way to approach Essences. Essence Formula We start similarly to beginning of Sequence Flatlining: $$\sum_{i=n}^m f(i) = \int_{n-1}^mȢ\{f(x)\}dx \\ \sum_{i=n}^n f (i) = f(n) = \int_{n-1}^nȢ\{f(x)\}dx \\ \therefore \frac{d}{dn}f(n) = Ȣ\{f(n)\} - Ȣ\{f(n-1)\}$$ Rather than continuing to differentiate this like in Sequence Flatlining, we stop here. By Linearity of Essence (see Sequence Curve: Essentia...
Post a Comment
Read more

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,...
1 comment
Read more