There are no known ‘neat’ expressions that generate only primes! Find counterexamples to the following claims.
(i) All numbers of the form are prime.
(ii) All numbers of the form are prime.
(iii) All numbers of the form are prime.
Confirming your payment
Propositions and their Converses · Question 13 of 17
There are no known ‘neat’ expressions that generate only primes! Find counterexamples to the following claims.
(i) All numbers of the form are prime.
(ii) All numbers of the form are prime.
(iii) All numbers of the form are prime.
One value of that gives a composite number is enough to disprove each claim.
(i) For we get , , , all prime. But for :
65 is not prime, so is a counterexample.
(ii) For we get , all prime. But for :
121 is not prime, so is a counterexample. (Also gives .)
(iii) For we get , , , all prime. But for :
259 is not prime, so is a counterexample.
Each claim worked for the first few values of and still turned out false — checking a few cases never proves a claim.