Integrated Mathematics 1 · Topic 7.3 · Unit 7 · CA CCSS G-CO.9 (reasoning)
Read the opening paragraph and the "The method" box on the lesson page. In your own words, restate each idea below.
Converse: swap them, "If \( q \), then \( p \)." Not guaranteed true even when the original is.
Inverse: negate both, "If not \( p \), then not \( q \)." Also not guaranteed true.
Contrapositive: swap AND negate, "If not \( q \), then not \( p \)." Always has the same truth value as the original conditional, this is the one free equivalence.
Biconditional: "\( p \) if and only if \( q \)," true exactly when both the conditional and its converse are true.
Inductive reasoning generalizes from specific examples or a pattern, it can suggest a conjecture but never proves one, a pattern can always break at the next case.
Deductive reasoning applies accepted facts, definitions, or properties (such as the Law of Detachment: if "if \( p \) then \( q \)" is true and \( p \) is true, then \( q \) must be true) to reach a conclusion that is guaranteed, given true premises. This is what a proof actually is.
Read the "Worked example" box. Then, without looking back, try writing your own answer below.
Example 1: writing the three related statements. Original: "If a polygon is a triangle, then it has three sides."
In two or three sentences, explain this lesson's main idea to someone who has not read it.