During AMC testing, the AoPS Wiki is in read-only mode. No edits can be made.

# Difference between revisions of "2019 AIME II Problems/Problem 14"

## Problem

Find the sum of all positive integers $n$ such that, given an unlimited supply of stamps of denominations $5,n,$ and $n+1$ cents, $91$ cents is the greatest postage that cannot be formed.

## Solution 1

By the Chicken McNugget theorem, the least possible value of $n$ such that $91$ cents cannot be formed satisfies $5n - 5 - n = 91$, so $n = 24$. For values of $n$ greater than $24$, notice that if $91$ cents cannot be formed, then any number $1 \bmod 5$ less than $91$ also cannot be formed. The proof of this is that if any number $1 \bmod 5$ less than $91$ can be formed, then we could keep adding $5$ cent stamps until we reach $91$ cents. However, since $91$ cents is the greatest postage that cannot be formed, $96$ cents is the first number that is $1 \bmod 5$ that can be formed, so it must be formed without any $5$ cent stamps. There are few $(n, n + 1)$ pairs, where $n \geq 24$, that can make $96$ cents. These are cases where one of $n$ and $n + 1$ is a factor of $96$, which are $(24, 25), (31, 32), (32, 33), (47, 48), (48, 49), (95, 96)$, and $(96, 97)$. The last two obviously do not work since $92$ through $94$ cents also cannot be formed, and by a little testing, only $(24, 25)$ and $(47, 48)$ satisfy the condition that $91$ cents is the greatest postage that cannot be formed, so $n = 24, 47$. $24 + 47 = \boxed{071}$.

## Solution 2

Notice that once we hit all residues $\bmod 5$, we'd be able to get any number greater (since we can continually add $5$ to each residue). Furthermore, $n\not\equiv 0,1\pmod{5}$ since otherwise $91$ is obtainable (by repeatedly adding $5$ to either $n$ or $n+1$) Since the given numbers are $5$, $n$, and $n+1$, we consider two cases: when $n\equiv 4\pmod{5}$ and when $n$ is not that.

When $n\equiv 4 \pmod{5}$, we can only hit all residues $\bmod 5$ once we get to $4n$ (since $n$ and $n+1$ only contribute $1$ more residue $\bmod 5$). Looking at multiples of $4$ greater than $91$ with $n\equiv 4\pmod{5}$, we get $n=24$. It's easy to check that this works. Furthermore, any $n$ greater than this does not work since $91$ isn't the largest unobtainable value (can be verified using Chicken McNugget Theorem).

Now, if $n\equiv 2,3\pmod{5}$, then we'd need to go up to $2(n+1)=2n+2$ until we can hit all residues $\bmod 5$ since $n$ and $n+1$ create $2$ distinct residues $\bmod{5}$. Checking for such $n$ gives $n=47$ and $n=48$. It's easy to check that $n=47$ works, but $n=48$ does not (since $92$ is unobtainable). Furthermore, any $n$ greater than this does not work since $91$ isn't the largest unobtainable value in those cases (can be verified using Chicken McNugget Theorem).

Since we've checked all residues $\bmod 5$, we can be sure that these are all the possible values of $n$. Hence, the answer is $24+47=\boxed{071}$. - ktong