1989 AJHSME Problems/Problem 14
Revision as of 23:03, 4 July 2013 by Nathan wailes (talk | contribs)
Problem
When placing each of the digits in exactly one of the boxes of this subtraction problem, what is the smallest difference that is possible?
Solution
When trying to minimize , we minimize and maximize . Since in this problem, is three digit and is two digit, we set and . Their difference is .
See Also
1989 AJHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
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.