具体数学--(求和式的一般形式的几种方法)

UTF8gbsn

How to find the closed form of any formula? We will demonstrate an
example to show seven different methods to achieve this goal.

$$S_n=\sum _{1⩽k⩽n}{k}^2,n⩾0$$

You could look it up.

There’s several books that you can look it up.

• Standard Mathematical Tables

• Handbook of Mathematical Functions

• Handbook of Integer Sequences

I think google is the first choice of the modern people.

Guess the answer, prove it by induction

It is very difficult to guess the answer, so this method is not
recommended.

Perturb the sum

• First method

  $$S_n=\sum _{i=1}^n{i}^2$$

  Perturb $$\begin{array}{rl}{S}_n+(n+1{)}^2& =\sum _{0⩽k⩽n}(k+1{)}^2=\sum _{0⩽k⩽n}{k}^2+2\sum _{0⩽k⩽n}k+\sum _{0⩽k⩽n}1\\ & =S_n+2\sum _{0⩽k⩽n}k+(n+1)\end{array}$$

  Finally we can get that
  $$S_n+(n+1{)}^2=S_n+2\sum _{0⩽k⩽n}k+(n+1)$$

  The left $S_n$ and right $S_n$ cancelled each other which leads to a
  failure of our process. However, we get the solution of
  $$(n+1{)}^2=2\sum _{0⩽k⩽n}k+(n+1)\Rightarrow \sum _{0⩽k⩽n}k=[(n+1{)}^2-(n+1)]/2$$

  This clue leads to a second method which begin with $i^3$.

• Second Method

  $$T_n=\sum _{i=1}^n{i}^3$$

  Perturb

  $$\begin{array}{rl}{T}_n+(n+1{)}^3& =\sum _{0⩽k⩽n}(k+1{)}^3=\sum _{0⩽k⩽n}{k}^3+3\sum _{0⩽k⩽n}{k}^2+3\sum _{0⩽k⩽n}k+\sum _{0⩽k⩽}1\\ & =T_n+3S_n+3\frac{(n+1)n}{2}+(n+1)\end{array}$$

  Finally, we get

  $$3S_n=(n+1)(n+\frac{1}{2})n$$

Build a repertoire

This is a general method. We can assume that the solution to be

$$\begin{array}{rl}{R}_0& =\alpha \\ R_n& =R_{n-1}+\beta +\gamma n+\delta n^2,n>0\end{array}$$

Now, we have four parameters $\alpha ,\beta ,\gamma ,\delta$. The closed
form should be

$$R_n=A(n)\alpha +B(n)\beta +C(n)\gamma +D(n)\delta$$

At this step, our focus is on the $A(n),B(n),C(n),D(n)$. We will use
special $\alpha ,\beta ,\gamma ,\delta$ to get these
$A(n),B(n),C(n),D(n)$.

• $A(n)$

  1. Let’s assume that $\alpha =1,\beta =0,\gamma =0,\delta =0$
     $$f(n)=A(n),R_n=R_{n-1}\Rightarrow R_n=R_{n-1}=...=R_0=1(R_0=\alpha =1)$$

  2. Now, we get $\mathbf{A}(\mathbf{n})=1$

• $B(n)$

  1. $R_n=f(n)=n$

  2. $n=n-1+\beta +\gamma n+\delta n^2\Rightarrow 1=\beta +\gamma n+\delta n^2\Rightarrow \beta =1,\gamma =0,\delta =0$

  3. $f(n)=A(n)\alpha +B(n)\beta \Rightarrow f(n)=1\cdot \alpha +B(n)1\Rightarrow f(n)=R_n=n=\alpha +B(n)$

  4. $\mathbf{B}(\mathbf{n})=\mathbf{n}$

• $C(n)$

  1. $R_n=f(n)=n^2$

  2. $n^2=(n-1{)}^2+\beta +\gamma n+\delta n^2\Rightarrow 2n-1=\beta +\gamma n+\delta n^2\Rightarrow \beta =-1,\gamma =2,\delta =0,\alpha =0$

  3. $f(n)=n^2=2C(n)-n\Rightarrow \mathbf{C}(\mathbf{n})=\frac{{\mathbf{n}}^2+\mathbf{n}}{2}$

• $D(n)$

  1. $R_n=f(n)=n^3\Rightarrow 3\mathbf{D}(\mathbf{n})=\mathbf{n}(\mathbf{n}+\frac{1}{2})(\mathbf{n}+1)$

Finally, we get what we want.

$$A(n)=1,B(n)=n,C(n)=\frac{n+n^2}{2},D(n)=\frac{n(n+\frac{1}{2})(n+1)}{3}$$

After we know $A(n),B(n),C(n),D(n)$, we can infer
$\alpha ,\beta ,\gamma ,\delta$ for specific problems such as
$R_0=0,R_n=R_{n-1}+n^2$.

1. $R_0=0\Rightarrow R_0=\alpha =0$

2. $R=R_{n-1}+n^2\Rightarrow \beta =0,\gamma =0,\delta =1$

At last, we get

$$R(n)=\frac{n(n+\frac{1}{2})(n+1)}{3}$$

Replace sums by integrals

$${\int }_0^n{x}^{2}dx=\frac{1}{3}{x}^3{|}_0^n=\frac{1}{3}{n}^3$$

$$S_n=\sum _{i=0}^n{k}^2$$

How to calculate $S_n$ based on integral?

$$E_n=S_n-\frac{1}{3}{n}^3=S_{n-1}+n^2-\frac{1}{3}{n}^3,(S_{n-1}=E_{n-1}+\frac{1}{3}(n-1{)}^3)$$
$$E_n=E_{n-1}+\frac{1}{3}(n-1{)}^3+n^2-\frac{1}{3}{n}^3=E_{n-1}+n-\frac{1}{3}$$

From $E_n=E_{n-1}+n-\frac{1}{3}$, we can get a closed form for $E_n$,
and when we get the closed form for $E_n$, we get the closed form for
$S_n$

Another path

$$E_n=S_n-{\int }_0^n{x}^{2}dx=\sum _{k=1}^n(k^2-{\int }_{k-1}^k{x}^{2}dx)=\sum _{k=1}^n(k^2-\frac{k^{3-(k-1{)}^3}}{2})$$
$$E_n=\sum _{k=1}^n(k-\frac{1}{3})$$

The same result as previous one.

Convert multiple to sum

$$\begin{array}{rl}{S}_n& =\sum _{1⩽k⩽n}{k}^2=\sum _{1⩽j⩽k⩽n}k\\ & =\sum _{1⩽j⩽n}\sum _{j⩽k⩽n}k\\ & =\sum _{1⩽j⩽n}(\frac{j+n}{2})(n-j+1)\\ & =\frac{1}{2}\sum _{1⩽j⩽n}(n(n+1)+j-j^2)\\ & =\frac{1}{2}{n}^2(n+1)+\frac{1}{4}n(n+1)-\frac{1}{2}{S}_n=\frac{1}{2}n(n+\frac{1}{2})(n+1)-\frac{1}{2}{S}_n\end{array}$$

At the end of this procedure, we can get $S_n$

Method 7 and 8

7 Use finite calculus. 9 Use generating functions.(The next section.)
加粗样式