Loading [MathJax]/jax/output/HTML-CSS/jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
K12 LibreTexts

2.6: Conjectures and Counterexamples

( \newcommand{\kernel}{\mathrm{null}\,}\)

Educated guesses and examples that disprove them.

A conjecture is an “educated guess” that is based on examples in a pattern. A counterexample is an example that disproves a conjecture.

Suppose you were given a mathematical pattern like h=16t2. What if you wanted to make an educated guess, or conjecture, about h?

Use the following information for Examples 1 and 2:

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.

Example 2.6.1

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

Solution

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

Example 2.6.2

Can you think of a counterexample?

Solution

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

Example 2.6.3

Here’s an algebraic equation and a table of values for n and t.

t=(n1)(n2)(n3)

n (n1)(n2)(n3) t
1 (0)(1)(2) 0
2 (1)(0)(1) 0
3 (2)(1)(0) 0

Solution

After looking at the table, Pablo makes this conjecture:

The value of (n1)(n2)(n3) is 0 for any number n.

Is this a true conjecture?

This is not a valid conjecture. If Pablo were to continue the table to n=4, he would have see that (n1)(n2)(n3)=(41)(42)(43)=(3)(2)(1)=6

In this example n=4 is the counterexample.

Example 2.6.4

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

f-d_1a8e170aaf8620eaf6b280adec82dced4a1087956f5ea32a28204c7f+IMAGE_TINY+IMAGE_TINY.png
Figure 2.6.1

From these examples, Arthur made this conjecture:

If a convex polygon has n sides, then there are n2 triangles formed when diagonals are drawn from any vertex of the polygon.

Is Arthur’s conjecture correct? Or, can you find a counterexample?

Solution

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

Notice that we have not proved Arthur’s conjecture, but only found several examples that hold true. So, at this point, we say that the conjecture is true.

Example 2.6.5

Give a counterexample to this statement: Every prime number is an odd number.

Solution

The only counterexample is the number 2: an even number (not odd) that is prime.

Review

Give a counterexample for each of the following statements.

  1. If n is a whole number, then n2>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.

Review (Answers)

To see the Review answers, open this PDF file and look for section 2.5.

Resources

Vocabulary

Term Definition
conjecture A conjecture is an educated guess that is based on examples in a pattern.
counterexample A counterexample is an example that disproves a conjecture.
fraction A fraction is a part of a whole. A fraction is written mathematically as one value on top of another, separated by a fraction bar. It is also called a rational number.

Additional Resources

Interactive Element

Video: Inductive Reasoning

Activities: Conjectures and Counterexamples Discussion Questions

Study Aids: Types of Reasoning Study Guide

Practice: Conjectures and Counterexamples

Real World: Conjectures And Counterexamples


This page titled 2.6: Conjectures and Counterexamples is shared under a CK-12 license and was authored, remixed, and/or curated by CK-12 Foundation via source content that was edited to the style and standards of the LibreTexts platform.

CK-12 Foundation
LICENSED UNDER
CK-12 Foundation is licensed under CK-12 Curriculum Materials License

Support Center

How can we help?