我们知道数学归纳法是由两个步骤组成的,其中第一步是取自然数n的第一个值n对命题进行验证,第二步中含有二点,第一点为假设n取正整数k(k>n_1)时原命题第成立,从而推证第二点,n取k+1时原命题应成立。因此用数学归纳法论证数学命题的关键在于证明n=k+1时所导出的命题成立。下面就此谈谈处理的方法。 We know that mathematical induction consists of two steps. The first step is to take the first value n of the natural number n to verify the proposition. In the second step, there are two points. The first point is to assume that n is a positive integer k. (k>n_1) When the original proposition was established, the second point was deduced. When n is k+1, the original proposition should be established. Therefore, the key to using mathematical induction to demonstrate mathematical propositions is to prove that the propositions derived when n=k+1 are established. Here’s how to deal with it.