Converse and Contrapositive
A conditional equals its contrapositive.
Key idea
A conditional equals its contrapositive.
In depth
For p → q: converse is q → p, inverse is ¬p → ¬q, contrapositive is ¬q → ¬p. The contrapositive is always equivalent to the original; the converse and inverse are equivalent to each other but not to it.
Worked example
"If it rains, the ground is wet." Contrapositive: "If the ground is dry, it did not rain." Converse (not equivalent): "If wet, it rained."
Formula
Real-world uses
- Checking if “if it rains, the ground is wet” means the same as its contrapositive in reasoning tasks
Common mistake
Assuming the converse follows from the original.
How to learn this
- Read the key idea and say it in your own words.
- Work through the worked example, then try a similar problem.
- Use the interactive lesson’s visual and mini-quiz to check the pattern.
Frequently asked questions
What is Converse and Contrapositive?
A conditional equals its contrapositive. It is a topic at the advanced level in Discrete Math & Number Theory.
What is the formula for Converse and Contrapositive?
The key formula is p→q ≡ ¬q→¬p.
Where is Converse and Contrapositive used in real life?
Real-world examples: Checking if “if it rains, the ground is wet” means the same as its contrapositive in reasoning tasks.
What should I learn before Converse and Contrapositive?
Make sure you are comfortable with De Morgan’s Laws, the previous topic in Discrete Math & Number Theory.
What is a common mistake with Converse and Contrapositive?
Assuming the converse follows from the original.
How can I practise Converse and Contrapositive?
Open the interactive lesson, play with the visual, then answer the three-question mini-quiz. Getting two right marks the topic complete.
What comes after Converse and Contrapositive?
Move on to Quantifiers next.
Related advanced topics in Discrete Math & Number Theory
- Tautologies and Contradictions – Always true or always false statements.
- Logical Equivalence – Statements with identical truth tables.
- De Morgan’s Laws – Negation swaps AND and OR.
- Quantifiers – “For all” and “there exists”.
- Negating Quantified Statements – Flip the quantifier and negate the predicate.
- Proof by Direct Argument – Derive the conclusion from premises with valid steps.