AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.

1987 AIME Problems/Problem 1

From AoPSWiki

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 (ProblemsResources)
Preceded by
First Question
Followed by
Problem 2
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Trying to get to the USAMO in 2010? Our AIME Problem Series can help you get there! Click here to enroll today!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us