【读书笔记】《具体数学》第一章：Recurrent Problems

反思：

本节写了三个例子其中，有以下特征：

1. 找规律——数学归纳法
2. 将石子展开，成为具有普遍认识的求和式，在用数学归纳法证明其正确
3. 对小值找规律

技巧

1.从小找规律

Our experience with small cases has not onlyhelped us to discover a general formula,it has also provided a convenient way to check that we haven’t made a foolish error.

2.寻求Tn这样有意义的量的封闭形式的表达式时，我们经过的三个阶段.

看小、求递归式、求封闭式

• Look at small cases.This gives us insight into the problem and helps us in stages 2 and 3.
• Find and prove a mathematical expression for the quanlity of interest.For the Tower of Hanoi,this is the recurrence(1,1) that allows us,given the inclination,to compute Tn for any n.
• Find and prove a clpsed form for our mathematical expression.For the Tower of Hanoi,this is the recurrence solution(1.2)

1.1:T0=0;Tn=2T(n-1)+1 for n>0

1.2:Tn=2的n次方-1

3.在证明封闭式中比归纳法更简单的证明技巧：

Fortunately there’s a better way to proceed,by choosing particular values and then combinbing them.

总的方法论：
++First we find settings of general parameters for which we know the solution;this gives us a repertoire of special cases that we can solve.Then we obtain the general case by combining the special cases.We need as many independent special solutions as there are independent parameters.++

定义：

一、数学归纳法：

Mathmatical induction is general way to prove that some statement about the integer n is true for all n >= n0

*First we prove the statement when n has its smalles value,n0;this is called the basis.Then we prove the statement for n>n0,assuming that it has already been proved for all values between n0 and n-1,inclusive ;this called the induction.

作用

++Such a proof gives infinitely many results with only a finite amount of work.++