Mind map
1_MATHEMATICAL PROOF STRATEGIES

Map content
1_MATHEMATICAL PROOF STRATEGIES
DIRECT PROOF
- The most straight forward approach use to prove conditional statements are true.
- Assume P is true and then shows the forces Q to be true
MATHEMATICAL INDUCTION
- It is used when we have a set of statements S1,S2,S3,...,Sn,..., and we need to prove that they are all true.
- Conjecture
- The sum of the first n odd natural numbers equals n2
- The sum of the first n odd natural numbers equals n2
- if the base case is true, then all the cases in that particular problem are true
- It is used when we have a set of statements S1,S2,S3,...,Sn,..., and we need to prove that they are all true.
INDIRECT METHOD
- CONTRADICTION
- To prove any kind of statement, not limited to proving just conditional statement
- Assume that P is false, so ~P is true and deduces C^~C
- ~p --> ( c --> ~c)
- Used when direct and contrapositive approaches are not seem to work
- CONTRAPOSITIVE PROOF
- p --> q is logically equivalent to ~ q --> ~ p
- Alternative to direct proof
- Assume ~Q is true to deduce that ~P is true
- CONTRADICTION
Images and files in the map
Information
- Description
- Mind Map on 1_MATHEMATICAL PROOF STRATEGIES, created by shafii2801 on 14/07/2016.
- Created by
- shafii2801
- Views
- 0
- History
-
- Created by shafii2801 · Jul 2, 2016
- Copied by shafii2801 · Jul 14, 2016
- Rating











