2025 CSAT — Q6
Three prime numbers , and , each less than , are such that . How many distinct possible values can we get for ?
Worked rationale
says are in arithmetic progression with middle term , so . We hunt prime APs with all terms .
Reading A — three distinct primes (the natural reading of “three prime numbers ”). Because a -term AP of primes (other than ) needs an even common difference (a that is odd would force an even term, and cannot sit in the middle of three primes ), the prime APs are:
with middle terms . The sums are — the distinct values are , i.e. .
Reading B — primes “not necessarily distinct” (allowing , i.e. ). Then any prime gives with sum ; the non-constant APs add no new sums. That gives distinct values (option (d)).
Neither natural reading yields . My independent blind-solve gives (distinct primes, the reading I judge intended) or (repeats allowed).
Why the other options miss
- B answered the sub-step, not the question: counts the five prime-AP triples rather than the four distinct sums (two triples share sum ).
- D solved the wrong question: the value under the “repeats allowed” reading (); correct only if is admitted.
Specialist insight
The mathematics is clean — , so we count distinct middle terms, not triples — but the reading is the trap, and this is a live example of why we never reverse-engineer an answer from a published key. The number of prime-AP triples () differs from the number of distinct sums (, since recurs), and the “repeats allowed” reading gives . A disciplined solver states the reading explicitly, counts distinct values, and — finding the official irreproducible — flags it rather than bending the math. That honesty is the scoring discipline.
Count distinct sums (where repeats values), not the five triples ( 5); the official "" matches neither clean reading and is flagged contested.