Example 1 — Disprove a claim
Show the steps and the answer
Check small values: give , all prime.
The early cases all work, which is why the claim looks believable; passing checks prove nothing.
Pick so that every term shares a factor: at , the terms , and are all multiples of 11.
If 11 divides every piece, it divides the total, so the total cannot be prime unless it is 11 itself.
Compute: .
Showing the actual output makes the counterexample checkable by anyone.
Factor: , so it is not prime.
is an integer, so it meets the hypothesis, and its output is composite, so it breaks the conclusion.
Answer: is a counterexample, so the claim is false
Takeaway: To break a 'prime for every ' formula, choose so that every term is divisible by the same number. One such settles the question.