Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
The formula gives a prime for for a long time. A student checks the first ten values and claims that is prime for every whole number . Explain why ten checks do not prove the claim. Then find, without a computer, a value of for which is clearly not prime. Hint: make every term share a factor. The smallest counterexample is the one you find first this way. Give it, and the value of there.
Direct proof: assume , reach . Contrapositive: assume , reach . Exhaustion: check every one of finitely many cases. One counterexample disproves a for-all claim.
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Why examples are not enough. The claim is about every whole number. Ten cases leave infinitely many unchecked. One failure would make it false.
Step 2. A clear counterexample. At : , not prime.
Step 3. A smaller one. At : . Not prime.
Step 4. Is it the smallest? Checking to (the lesson's program does this) shows every value is prime. So is the smallest counterexample.
Check. , and .
Answer: , with .
Log in to join the discussion.
Loading…