专业英语测试2013年4月12日.pdfVIP

12 April, 2013 Mathematical Induction Mathematical induction is a method of mathematical proof typically used to establish that a given statement is true for all natural numbers (positive integers). It is done by proving that the first statement in the infinite sequence of statements is true, and then proving that if any one statement in the infinite sequence of statements is true, then so is the next one. The method can be extended to prove statements about more general well- founded structures(), such as trees(); this generalization, known as structural induction, is used in mathematical logic() and computer sci- ence(). Mathematical induction in this extended sense is closely related to recursion(Æ). In the following, we shall introduce the subject of inductive proofs with “simple” inductions on integers. Inductions on Integers Suppose we are given a statement S(n), about an integer n, to prove. One common approach is to prove two things: 1. The basis, where we show S(i) for a particular integer i. Usually, i = 0 or i = 1, but there are examples where we want to start at some higher i, perhaps because the statement S is false for a few small integers. 2. The inductive step, where we assume n ≥ i, where i is the basis integer, and we show that “ if S(n) then S(n + 1).” Intuitively, these two parts should convince us that S(n) is true for every integer n that is equal to or greater than the basis integer i. We can argue as follows. Suppose S(n) were false for one or more of those integers. Then there would have to be a smallest value of n, say j, f