For how many of the integers is not prime?
Answer and explanation
Correct answer: C.
- Step 1: Compute : it is prime for most small , so look for composites. gives ; gives ; gives ; gives .
- Step 2: Every other value from to gives a prime (), so exactly values fail.
Answer
.
Why not the others: Fewer than four misses some of the composites , , , ; more than four would require another composite among the listed primes.
Practise more Counterexamples.
Free questions with an explanation for every one, and full timed TMUA mock tests.
More Counterexamples questions
- A student claims: *'For every positive integer , is prime.'* Which value of is a counterexample?
- A student claims: *'If is a prime number, then is also prime.'* Which value of is a counterexample?
- A student claims: *'If , then .'* Which pair is a counterexample?
- A student claims: 'If a whole number is divisible by both 4 and 6, then it is divisible by 24.' Which number is a counterexample?
- A student claims: *'If a real number satisfies , then .'* Which value of is a counterexample?
- A student claims: *'If and are irrational numbers, then is irrational.'* Which pair is a counterexample?