Difference between revisions of "1987 AIME Problems/Problem 1"
m |
m (→See also: line break now bad formatting) |
||
Line 6: | Line 6: | ||
* [[1987 AIME Problems]] | * [[1987 AIME Problems]] | ||
− | {{AIME box|year=1987|before=First | + | {{AIME box|year=1987|before=First Question|num-a=2}} |
Revision as of 12:35, 11 February 2007
Problem
An ordered pair of non-negative integers is called "simple" if the addition in base requires no carrying. Find the number of simple ordered pairs of non-negative integers that sum to .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
1987 AIME (Problems • Answer Key • Resources) | ||
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 |