Coursework.Info - Inspiration in an Instant

On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:

1 Explaining the Principle of mathematical induction: Formally the principle of a proof by induction can be stated as follows: A proposition P (n) involving a positive integer n, is true for all positive integral values of n if, P (1), and P (k) ? P (k +1) is true. This can be explained using a staircase as a simple analogy. Image the proposition that a man can climb a given uniform staircase, to prove this statement we need to show two things. These are that the man can get onto the first step and that he is able to climb from one step to an other. Now relating this to the formal principle of induction, the staircase can be considered the general proposition P (n). The first step of the staircase is P (1), the second P (2), the third P (3), and so on. If we can show that the...

Get instant access

• Instant, unlimited access to our documents in full
• Swap your work for free access, or pay £4.99
• To see the full version of this document and 163,112 others