<meta http-equiv="refresh" content="1; url=/nojavascript/"> Conjectures and Counterexamples | CK-12 Foundation
You are reading an older version of this FlexBook® textbook: CK-12 Geometry Concepts Go to the latest version.

# 2.1: Conjectures and Counterexamples

Difficulty Level: At Grade Created by: CK-12
%
Progress
Practice Conjectures and Counterexamples
Progress
%

What if your older brother told you that all of his male friends at school play sports, so all guys must play sports. How could you prove him wrong? After completing this Concept, you will be able to make conjectures and disprove conjectures using counterexamples.

### Watch This

Watch the final part of this video.

### Guidance

A conjecture is an “educated guess” that is based on examples in a pattern. Numerous examples may make you believe a conjecture. However, no number of examples can actually prove a conjecture. It is always possible that the next example would show that the conjecture is false. A counterexample is an example that disproves a conjecture.

#### Example A

Here’s an algebraic equation and a table of values for $n$ and with the result for $t$ .

$t=(n-1)(n-2)(n-3)$

$n$ $(n-1)(n-2)(n-3)$ $t$
1 $(0)(-1)(-2)$ 0
2 $(1)(0)(-1)$ 0
3 $(2)(1)(0)$ 0

After looking at the table, Pablo makes this conjecture:

The value of $(n-1)(n-2)(n-3)$ is 0 for any whole number value of $n$ .

Is this a valid, or true, conjecture?

No, this is not a valid conjecture. If Pablo were to continue the table to $n = 4$ , he would have see that $(n-1)(n-2)(n-3)=(4-1)(4-2)(4-3)=(3)(2)(1)=6$ .

In this example $n = 4$ is a counterexample.

#### Example B

Arthur is making figures for a graphic art project. He drew polygons and some of their diagonals.

Based on these examples, Arthur made this conjecture:

If a convex polygon has $n$ sides, then there are $n - 2$ triangles drawn from any given vertex of the polygon.

Is Arthur’s conjecture correct? Can you find a counterexample to the conjecture?

The conjecture appears to be correct. If Arthur draws other polygons, in every case he will be able to draw $n - 2$ triangles if the polygon has $n$ sides.

Notice that we have not proved Arthur’s conjecture, but only found several examples that hold true. This type of conjecture would need to be proven by induction.

#### Example C

Give a counterexample to this statement: Every prime number is an odd number. The only counterexample is the number 2: an even number (not odd) that is prime.

Watch this video for help with the Examples above.

#### Concept Problem Revisited

Your older brother made the conjecture that all guys must play sports. You could prove him wrong, or disprove his conjecture, by offering a counterexample.

Say your friend, John, is a guy and does not play sports. Just one counterexample is enough to disprove your brother's conjecture.

### Guided Practice

A car salesman sold 5 used cars to five different couples. He noticed that each couple was under 30 years old. The following day, he sold a new, luxury car to a couple in their 60’s. The salesman determined that only younger couples by used cars.

1. Is the salesman’s conjecture logical? Why or why not?

2. Can you think of a counterexample?

1. It is logical based on his experiences, but is not true.

2. A counterexample would be a couple that is 30 years old or older buying a used car.

### Explore More

Read the following examples of reasoning in the real world. Do you think the conjectures are true or can you give a counterexample?

1. For the last three days Tommy has gone for a walk in the woods near his house at the same time of day. Each time he has seen at least one deer. Tommy reasons that if he goes for a walk tomorrow at the same time, he will see deer again.
2. Maddie likes to bake. She especially likes to take recipes and make substitutions to try to make them healthier. She might substitute applesauce for butter or oat flour for white flour. She has noticed that she needs to add more baking powder or baking soda than the recipe indicates in these situations in order for the baked goods to rise appropriately.
3. One evening Juan saw a chipmunk in his backyard. He decided to leave a slice of bread with peanut butter on it for the creature to eat. The next morning the bread was gone. Juan concluded that chipmunks like to eat bread with peanut butter.
4. Sarah noticed that all her friends were in geometry class and reasoned that every 10th grade student is in geometry.
5. Describe an instance when you observed someone using invalid reasoning skills.

Give a counterexample for each of the following statements.

1. If $n$ is an integer, then $n^2 > n$ .
2. All numbers that end in 1 are prime numbers.
3. All positive fractions are between 0 and 1.
4. Any three points that are coplanar are also collinear.
5. All girls like ice cream.
6. All high school students are in choir.
7. For any angle there exists a complementary angle.
8. All teenagers can drive.
9. If $n$ is an integer, then $n>0$ .
10. All equations have integer solutions.

Jul 17, 2012

Feb 26, 2015