For how many positive integers is a prime number?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
n^2-3n+2 = (n-1)(n-2) is a product of consecutive integers, hence even, so it can only be the prime 2, which happens at n = 3.
Solution
Factor the quadratic: .
The factors and are consecutive integers, so one of them is even and the product is always even. The only even prime is , so we need
Two consecutive integers with product are and (giving ) or and (giving , which is not positive). Only survives, and indeed is prime.
The answer is .
Why this works
A quadratic that factors over the integers is a product of two integers, and a product is prime only when one factor is . Here parity does even better: the product of consecutive integers is always even, so the only candidate prime is , and the search collapses to a single equation. Factor first, then ask what the factors must be.
Alternative approach
Without parity: for both factors and exceed , so the product is composite. Check directly: values . Exactly one prime.
The trap
Checking n = 1, 2, 3, 4 (values 0, 0, 2, 6) and guessing that more primes show up for larger n, or counting n = 0 as a positive integer.
Common mistakes
- Checking n = 1, 2, 3, 4 (values 0, 0, 2, 6) and guessing that more primes show up for larger n, or counting n = 0 as a positive integer.
- Treating or as prime, which would add and to the count.
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Use an invariant, parity, or coloring argument