1990 AJHSME Problems/Problem 1
Revision as of 23:04, 4 July 2013 by Nathan wailes (talk | contribs)
Problem
What is the smallest sum of two -digit numbers that can be obtained by placing each of the six digits in one of the six boxes in this addition problem?
Solution
Let the two three-digit numbers be and . Their sum is equal to .
To minimize this, we need to minimize the contribution of the factor, so we let and . Similarly, we let , , and then and . The sum is
See Also
1990 AJHSME (Problems • Answer Key • Resources) | ||
Preceded by First Problem |
Followed by Problem 2 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.