- #1
torquerotates
- 207
- 0
Homework Statement
The principal of mathematical induction can be extended as follows. A list P(m),P(m+1)... of propositions is true provided 1)P(m) is true, 2) P(n+1) is true whenever P(n) is true and n>(or =) m
I have to use the above to prove that n^2>n+1 for n>(or equal to) 2
Homework Equations
n^2>n+1 for n>(or equal to) 2
The Attempt at a Solution
so I said m=n+1
Then since I assume that the original statement implies that I hold m constant and increase n by 1
Inductive step (n+1)^2>(n+1)
=> n+1>1 True b/c {1,2,3,...n}=N