a repository of mathematical know-how

Strengthen your inductive hypothesis

Stub iconThis article is a stub.This means that it cannot be considered to contain or lead to any mathematically interesting information.

Quick description

Suppose that you are trying to prove by induction that the statement P(n) holds for every positive integer n, and suppose that you are having difficulties deducing P(n) from P(n-1). One option you have is to work on a different statement Q(n). If Q(n) implies P(n) and if Q(n) can be proved by induction, then you have proved P(n). This often turns out to be a very helpful technique.


Basic graph theory.

Example 1: Proof that all planar graphs are 5-choosable

General discussion


Post new comment

(Note: commenting is not possible on this snapshot.)

Before posting from this form, please consider whether it would be more appropriate to make an inline comment using the Turn commenting on link near the bottom of the window. (Simply click the link, move the cursor over the article, and click on the piece of text on which you want to comment.)