# New Math Formula: Sums of Power for Arithmetic Series

## Recommended Posts

Posted (edited)

This is part of my works. I have formulated a new formulation for sums of power and it works for any numbers (i.e. real & complex arithmetic progression). The generalize equation can generate any power p (it works fine also with complex p).

Let the p-th power of an arithmetic series as follows
$\sum_{i=1}^n x_i^p = x_1^p + x_2^p + x_3^p + \cdots + x_n^p$

The general equation for the sum is given as follows

$\sum^{n}_{i=1} {x_i}^p=\sum^{u}_{m=0}\phi_m s^{2m}\frac{[\sum^{n}_{i=1} x_i] ^{p-2m}}{n^{p-(2m+1)}}$
where: $p-(2m+1)\ge 1$ if p is even and  $p-(2m+1)\le 1$ if p is odd, $\phi_m$ is a coefficient,$\sum^{n}_{i=1} {x_i}$ sum of n-th term, $u=\frac {p-1}{2}$ for odd p and $u=\frac {p}{2}$ for even p and s is the difference between terms (i.e $s=x_{i+1}-x_{i}$).

Below are the equations for p=2-7

$\\\sum_{i=0}^{n}x_{i}^{2}=\frac{\left [ \sum_{i=0}^{n}x_{i} \right ]^2}{n}+\frac{n(n^2-1)s^2}{12}\\\\\\\sum_{i=0}^{n}x_i^3=\frac{\left [ \sum_{i=0}^{n}x_i \right ]^3}{n^2}+\frac{(n^2-1)s^2\left [ \sum_{i=0}^{n} x_i\right ]}{4}$

The value s is the common difference of successive terms in arithmetic progression and $\sum_{i=0}^{n}x_i$ is the sum of arithmetic terms. The beauty of this equation is that when you set n=2, it describes the Fermat's Last Theorem in a polynomial forms and if you set p to be negative, you can get new form of Riemmann's Zeta Function.

Here, you can see how the coefficients are repetitive:
$\\\sum_{i=0}^{n}x_i^4=\frac{\left [ \sum_{i=0}^{n}x_i \right ]^4}{n^3}+\frac{(n^2-1)s^2\left [ \sum_{i=0}^{n}x_i \right ]^2}{2n}+\frac{n(3n^2-7)(n^2-1)s^4}{240}\\\\\\\sum_{i=0}^{n}x_i^5=\frac{\left [ \sum_{i=0}^{n}x_i \right ]^5}{n^4}+\frac{5(n^2-1)s^2\left [ \sum_{i=0}^{n} x_i\right ]^3}{6n^2}+\frac{(3n^2-7)(n^2-1)s^4\left [ \sum_{i=0}^{n}x_i \right ]}{48}$

$\\\sum_{i=0}^{n}x_i^6=\frac{\left [ \sum_{i=0}^{n}x_i \right ]^6}{n^5}+\frac{5(n^2-1)s^2\left [ \sum_{i=0}^{n}x_i \right ]^4}{4n^3}+\frac{(3n^2-7)(n^2-1)s^4\left [ \sum_{i=0}^{n}x_i \right ]^2}{16n}+\frac{n(3n^4-18n^2+31) (n^2-1)s^6}{1344}\\\\\\\sum_{i=0}^{n}x_i^7=\frac{\left [ \sum_{i=0}^{n}x_i \right ]^7}{n^6}+\frac{7(n^2-1)s^2\left [ \sum_{i=0}^{n}x_i \right ]^5}{4n^4}+\frac{7(3n^2-7)(n^2-1)s^4\left [ \sum_{i=0}^{n}x_i \right ]^3}{48n^2}+\frac{(3n^4-18n^2+31) (n^2-1)s^6\left [ \sum_{i=0}^{n}x_i \right ]}{192}$

Perhaps, by looking at this new formulation, someone could work out an alternative shorter proof for Fermat's Last Theorem.

Edited by stangerzv

##### Share on other sites
Posted (edited)

How are x_i related?

Edited by mathematic

##### Share on other sites

x_i is an arithmetic series (e.g x_1, x_2, ...x_n=2,3,..,1000)

## Create an account

Register a new account