Geometry · Lesson 2.1 · Unit 2 · G-CO.9
Read the opening paragraph and the "The method" box on the lesson page. In your own words, restate each idea below.
Inductive reasoning moves from specific cases to a general claim. Look at examples, notice what they have in common, propose that it always happens.
The general claim is called a conjecture. It is a proposal, not a result, and it stays a conjecture until proved.
No number of confirming cases proves a conjecture. A hundred examples that work leave open the possibility that the hundred and first does not.
One counterexample disproves it completely. A single case where the hypothesis holds and the conclusion fails settles the matter permanently.
To find a counterexample, look at the edges: zero, one, negatives, fractions, the smallest case, the degenerate case.
A counterexample must satisfy the hypothesis. Producing a case where the "if" part fails proves nothing.
Read the "Worked example" box. Then, without looking back, try writing your own answer below.
(a) Make a conjecture from the pattern 1, 4, 9, 16, 25 and predict the next two terms. (b) Test the conjecture "the sum of any two odd numbers is even." (c) Find a counterexample to "for every number \( n \), \( n^2 \gt n \)." (d) Find a counterexample to "all prime numbers are odd."
In two or three sentences, explain this lesson's main idea to someone who has not read it.