2021 AMC Fall 10B Problem 7
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?
Show solution without answering
Key insight
Reduce all 14 special fractions. Two of them can only add to a whole number if both are whole numbers, or both have the same bottom (2 or 4).
Solution
- List the special fractions. The top and bottom add to , so they are . Reduce each one:
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2. When can two of them add to a whole number? For example, , which is not whole. In lowest terms, a fraction with bottom can only be "completed" to a whole number by another fraction with bottom . So group the fractions by their bottom number.
3. Whole numbers . Add any two, repeats allowed:
, , , , , .
4. Halves . Two halves always make a whole number:
, , , , , .
5. Quarters . Only works. ( and give halves.)
6. The rest (bottoms ) each appear once. Doubling one of them, like , is not a whole number.
7. Collect and remove repeats:
(, , and each came up twice.) That is different whole numbers.
The answer is .
Why this works
Sorting the fractions by their bottom number turns a search through all pairs into a few short lists, because the fractional parts can only cancel between fractions with the same bottom. After that, the only danger is careless listing, so write every sum down and cross off repeats at the end.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
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 .
Review in the AoPS books
- Introduction to Number Theory, Chapter 11: Decimals and Fractions
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.2)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.