maths.free › Discrete Math & Logic › Proof by induction

Proof by induction

Base case, inductive step, strong induction, and the well-ordering principle.

To prove P(n) for all n: prove P(1), then prove P(n) ⇒ P(n + 1). Strong induction assumes all earlier cases. Picture it: the staircase of dominoes. Think it: induction is equivalent to the well-ordering of ℕ. Every non-empty set of naturals has a least element.

工作范例 · sum of k for k = 1 to n

Calculus · Series-And-Sums

Sum k for k = 1 to n

\sum_{k=1}^{n} k

一步

\sum_{k=1}^{n} k
Write the sum out.
1 + 2 + 3 + 4 + \cdots
The first few terms.
= \frac{n \left(n + 1\right)}{2}
Closed form (a standard summation formula, provable by induction).

发送答案

\frac{n \left(n + 1\right)}{2}

现在轮到你选择问题, 输入或绘制您自己的。每一步, 图片, 答案隐藏到您询问。

保持你自己的工作

免费账户在每一课上都添加注解, 记录你完成的, 在一个地方解决的, 以及您可以询问的关于此页的导师。数学本身向每个人开放, 是否签名。

签名上签名登录

此处所用符号

输入完整定义、图片和其中每个字母的含义的符号。

如何: Proof by induction

State P(n) precisely.
Base case: verify P(1) (or P(0)).
Inductive step: assume P(k), derive P(k + 1), citing the assumption exactly once at least.
Conclude by the principle of induction.

人们对人们提出的问题

What makes mathematics "discrete"?

It deals with separate, countable objects (integers, graphs, statements) rather than continuous quantities. No limits, no infinitesimals; instead induction, counting and logic.

How does a proof by induction work?

Show the statement for the first case, then show that whenever it holds for n it holds for n + 1. Like dominoes: the first falls, and each knocks over the next.

What order should I take these lessons in?

Logic and proof first, because every later lesson proves things. Then induction, sets, relations and functions, counting, recurrences, graphs, Boolean algebra and automata, and finally algorithms and complexity, which use nearly everything before them.

Is discrete mathematics the same as the maths of computer science?

Largely. Data structures are graphs and trees, correctness arguments are induction, running times are recurrences and sums, circuits are Boolean algebra, and what a computer can do efficiently is the subject of the last lessons. It is also ordinary mathematics in its own right.

Do I need calculus for this course?

No. School algebra is enough. A little familiarity with limits helps when comparing growth rates, and the lesson on asymptotic analysis explains the one limit fact it uses.