1987 AIME Problems/Problem 1

Revision as of 16:49, 15 February 2007 by Azjps (talk | contribs) (yay, adding, and no carry-overs! + solution)

Problem

An ordered pair $\displaystyle (m,n)$ of non-negative integers is called "simple" if the addition $\displaystyle m+n$ in base $\displaystyle 10$ requires no carrying. Find the number of simple ordered pairs of non-negative integers that sum to $\displaystyle 1492$.

Solution

Since no carrying over is allowed, the range of possible values of any digit of $m$ is from $0$ to the respective digit in $1492$ (the values of $n$ are then fixed). Thus, the number of ordered pairs will be $(1 + 1)(4 + 1)(9 + 1)(2 + 1) = 2\cdot 5\cdot 10\cdot 3 = 300$.

See also

1987 AIME (ProblemsAnswer KeyResources)
Preceded by
First Question
Followed by
Problem 2
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions