Technique
Breaking a prime-formula claim by making every term share a factor
Algebra • Binary and Other Number Systems
Statement
A claim that an expression in is prime for every natural is false as soon as one gives a composite number. Choosing equal to (or a multiple of) a constant term often makes every term divisible by , so the value is a multiple of larger than .
How to use it
- 1Look at the constant term . Try or and see whether every term then carries the factor .
- 2Factor out . If what is left is more than , the value is composite, and one such disproves the claim.
Worked example
Is prime for every natural number ?
Step-by-step
- 1Put :
Why: With , , so every term has the factor .
- 2
- 3is not prime
Why: One value that is not prime is enough to show the claim fails.
Answer
No: gives .
Watch out
Checking a few small values of proves nothing: the expression may be prime for every small and still fail later.
Builds on
Also known as
counterexample, n^2 + n + 41, prime generating formula, disprove by example