Call a fraction , not necessarily in the simplest form, special if and are positive integers whose sum is . How many distinct integers can be written as the sum of two, not necessarily different, special fractions?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
Reduce the 14 special fractions; two of them sum to an integer only if both are integers or both have the same denominator 2 or 4.
Solution
The special fractions are for . In lowest terms:
Two reduced fractions add to an integer only if they have the same denominator (a fraction with denominator can only be cancelled by another with denominator ). So group by denominator:
- Integers : pairwise sums (repeats allowed) are .
- Denominator : : sums are .
- Denominator : : the only integer sum is .
- Denominators appear once each, and doubling them gives no integer.
Collecting distinct values: , which has elements.
The answer is .
Why this works
Sorting by reduced denominator turns a search into a few tiny lists, because a sum of reduced fractions is an integer only when the denominators cancel each other. The remaining work is careful listing with duplicate removal.
The trap
Forgetting that a fraction may be added to itself (such as 1/2 + 1/2 = 1), or listing a sum twice (8 arises as 4 + 4 and as 3/2 + 13/2).
Common mistakes
- Forgetting that a fraction may be added to itself (such as 1/2 + 1/2 = 1), or listing a sum twice (8 arises as 4 + 4 and as 3/2 + 13/2).
- Missing the denominator- pair (though also arises as ), or not reducing and before grouping.
Techniques
Organized listing / direct enumeration · Split into exhaustive cases and handle each