顯示具有 differential 標籤的文章。 顯示所有文章
顯示具有 differential 標籤的文章。 顯示所有文章

2008年7月5日 星期六

The sequence of n^x

Last time I have consider the sequence of x², x³,… x^n. We found that we can reduce their differential to a constant in n times. Could we apply the same method to 2^x, 3^x, 4^x?

Let’s start with 2:
1,2,4,8,16,32,64

Their differential:
1,2,4,8,16,32

The differential of this differential again yell:
1,2,4,8,16

Notice that since the differential is identical with the original sequence, therefore this method doesn’t work for 2^x..

Let’s tried with the sequence of 3^x:
1,3,9,27,81,243

Their differential:
2,6,18,54,162

The differential of their differential:
4,12,36,108

Although they may look different at the surface. Notice that:
2*(2,6,18,54,162)=(4,12,36,108,)

Thus, it is again a repeating sequence. We could thus said, the sequence of the n^x has the property that repeat itself in the differentiation process. Moreover, we also notice that for n^x, the differential of differential is a multiple of previous sequence by (n-1).

Let’s test this hypothesis:
Take 3,4,5 as example:

For 3, we have:
1,3,9,27,81,243;
2,6,18,54,162;
4,12,36,108;
8,24,72;

For 4, we have:
1,4,16,64,256,1024;
3,12,48,192,768;
9,36,144,576;
27,81,243;

For 5, we have:
1,5,25.125,625,3125;
4,20,100,500,2500;
16,80.400,2000;
64,320,1600.

We thus verify the hypothesis. One thing interesting is, if we look at the first item of each differential sequences, it formed a sequence identical to last sequence.
What can we make of this?

Donate n to the power x by k(x,n), we list them in order:
k(2,n)-k(1,n)=k(1,n-1)
k(3,n)-2*k(2,n)+k(1,n)=k(2,n-1)
k(4,n)-3*k(3,n)+3*k(2,n)-k(4,n)=k(3,n-1)
k(5,n)-4*k(4,n)+6*k(3,n)-4k(2,n)+k(1,n)=k(4,n-1)

There many equations we can form using them, I just list one type here:
(k(3,n)-2*k(2,n)+k(1,n))/(k(2,n)-k(1,n))=n
(k(4,n)-3*k(3,n)+3*k(2,n)-k(4,n))/(k(2,n)-k(1,n))=n^2

or (k(3,n)-2*k(2,n)+k(1,n))/(k(2,n)-k(1,n))= (k(4,n)-3*k(3,n)+3*k(2,n)-k(4,n))/(k(3,n)-2*k(2,n)+k(1,n))
we can form however complex relationship from this base.

2008年6月3日 星期二

Differential between x to the power n

This is first notice by me what I was in High School,

I discover that for the sequence of x²,
1,4,9,16,25.36

Their difference is respectively:
3,5,7,9,11

The difference of their difference is:
2,2,2,2

And the difference of difference of difference is all zero. For three identical steps we reduce the sequence to zero, and the power of x is 2. It also take 2 step to arrive at identical number.

Then I tried the sequence of x³:
1,8,27,64,125,216

Their difference is respectively:
7,19,37,61

The difference of their difference is:
12,18,24

The difference of their difference of their difference is:
6,6.

So now it take 3 iterations to reduce them to equal number, and it take four iterations to zero out all differentials. Notice the power of x is 3.

It doesn’t take long for me to realize the relationship between number of iterations to reduce the differential to equal number; and the number of iterations to zero out all differential is always one more than the power of x.

Therefore we can write the expression for the powers of x:
For x², (X(3)-X(2))-(X(2)-X(1))=(X(4)-X(3))-(X(3)-X(2))
or X(3)-2X(2)+X(1)= X(4)-2X(3)+X(2)
or X(4)-3X(3)+3X(2)-X(1)=0
Thus, X(4)=3X(3)-3X(2)+X(1)

For x³, ((X(4)-X(3))-(X(3)-X(2)))-((X(3)-X(2))-(X(2)-X(1)))=((X(5)-X(4))-(X(4)-X(3)))-((X(4)-X(3))-(X(3)-X(2)))
or X(4)-3X(3)+3X(2)-X(1)=X(5)-3X(4)+3X(3)-X(2)
or X(5)-4X(4)+6X(3)-4X(2)+X(1)=0
Thus, X(5)=4X(4)-6X(3)+4X(2)-X(1)

We could thus generalize the result for the sequence of X^n,
X(n+2)=(n+1)C(1)X(n)-(n+1)C(2)X(n-1)+(n+1)C(3)X(n-2)-(n+1)C(4)X(n-3)….+(-1)^(2+n)*(n+1)C(n+1)X(1)

Now for x^6, we have
X(8)=7X(7)-21X(6)+35X(5)-35X(4)+21X(3)-7X(2)+X(1)

Therefore, we have a more convenient way to calculated x to power n if we know the terms of the sequence from n+1 consecutive. Trust me, in my mind, that was better than the calculator to calculate the power of any number to any power at that time.

However, I notice that in the n iteration that the difference between x^n is equal to n!
i.e. For x², X(3)-2X(2)+X(1)=2, so we need only last 2 of the sequence in x²
For x³, X(4)-3X(3)+3X(2)-X(1)=6, so we need only last 3 of the sequence in x³

Therefore, for x^n, X(n+1)-nC(1)X(n)+nC(2)X(n-1)-nC(3)X(n-2)+nC(4)X(n-3)….+(-1)^(1+n)*nC(n+1)X(1)=n!