Identities, equivalence and algebraic arguments · Foundation
Introduced| English | Meaning |
|---|---|
| counterexample/ˈkaʊntəreɡzæmpl/ | A specific example that shows a general claim is false. |
| equivalent expressions/ɪˈkwɪvələnt ekˈspreʃnz/ | An expression with the same value as another for every permitted value of its variables. |
Euler's prime formula
- In 1772 Leonhard Euler noticed that $n^2 + n + 41$ gives a prime number for $n = 0, 1, 2, \ldots, 39$. Forty examples — but at $n = 40$ it gives $1681 = 41 \times 41$.
- Many examples do not prove a rule. One counterexample can break it.
Work out $n^2 + n + 41$ when $n = 40$.
Difficulty 2/5 · 140 coins + a small bonus on first completion today
$1600 + 40 + 41 = 1681 = 41^2$.
Equivalent expressions
- Two equivalent expressions 等价表达式 give the same value for every input: $3(x + 2) - x$ and $2x + 6$.
- Show it by valid steps: $3(x + 2) - x = 3x + 6 - x = 2x + 6$.
Which expressions are equivalent to $4(x + 3) - 2x$?
Difficulty 2/5 · 140 coins + a small bonus on first completion today
$4x + 12 - 2x = 2x + 12$.
Identity symbol
- We write $3(x + 2) - x \equiv 2x + 6$. The $\equiv$ sign means "for all values of $x$".
- An equation such as $x^2 = x$ is true only for some values ($x = 0$ or $1$).
Identity or equation?
Difficulty 2/5 · 140 coins + a small bonus on first completion today
Identities hold for every value.
Worked example: true or false?
Claim: "$x^2 = x$ for every number $x$."
- Try $x = 1$: $1 = 1$. This works, but one example proves nothing.
- Try $x = 2$: $4 \ne 2$. This is a counterexample 反例.
- Verdict: the claim is false. One counterexample is enough.
Identities, equivalence and algebraic arguments
An equation may hold only for some values, while an identity holds for every allowed input
Compare the model with the worked case and explain one change.
Which value of $n$ is a counterexample to "$n^2 + 1$ is always even"?
Difficulty 1/5 · 100 coins + a small bonus on first completion today
$4 + 1 = 5$ is odd.
Showing something is always true
- To prove a statement for all numbers, use algebra, not examples.
- "The sum of two consecutive numbers is odd": $n + (n + 1) = 2n + 1$, which is one more than an even number, so always odd.
Even and odd in algebra
- An even number can be written $2n$; an odd number $2n + 1$, for a whole number $n$.
- $2n + 2m = 2(n + m)$ shows even + even is even.
Which expression is always odd when $n$ is a whole number?
Difficulty 1/5 · 100 coins + a small bonus on first completion today
One more than an even number.
Checking a few numbers is not a proof. $(2n + 1)^2 = 49$ when $n = 3$ is odd, but that one case shows nothing about every $n$. Euler's formula worked 40 times and still failed.
If a rule works for 10 examples, it is proved.
Difficulty 1/5 · 100 coins + a small bonus on first completion today
Euler's formula worked for 40.
Equivalent expressions agree for every input; show it by expanding and simplifying, and write $\equiv$. To disprove a claim, give one counterexample. To prove it, use algebra such as $2n$ and $2n + 1$, never a list of examples.
Prove that the sum of two odd numbers is always even.
Algebraic proof.