- #1

- 37

- 0

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Mathematica
- Thread starter Richter915
- Start date

- #1

- 37

- 0

- #2

- 506

- 1

See this page.

- #3

- 37

- 0

1. Prove P(1) exists

2. Prove P(K) is increasing

3. Prove P(K+1) > P(K) thus concluding that the sequence increases>

- #4

- 506

- 1

The first step is not to prove that P(1) exists, it is to prove that the first theorem in a chain of theorems holds true. The "arbitrary kth theorem being true implies truth of (k+1)th theorem" proof then allows one to form a logical chain to the (k+1)-th theorem from the 1st theorem if challenged to prove that the (k+1)-th theorem is true.Richter915 said:

1. Prove P(1) exists

2. Prove P(K) is increasing

3. Prove P(K+1) > P(K) thus concluding that the sequence increases>

In your case, you want to prove that the second item in the sequence is greater than the first item. Your second step is to prove that given an arbitrary kth term in the sequence and assuming the kth term is greater than the (k-1)th term, prove that the (k+1)th term is greater than or equal to (if your aim is not to prove strictly increasing) the kth term. The actual item to prove changes with each set of theorems, only the logical machinery is the same.

Last edited:

- #5

- 37

- 0

- #6

- 506

- 1

Unless the P(0)'th term is 0, it doesn't prove much of anything to show that P(1) is greater than zero (Consider an increasing sequence that starts with negative numbers). This inductive proof starts with showing P(2)>P(1).Richter915 said:

Share: