Difference between revisions of "2016 AIME I Problems/Problem 8"
(Added problem and solution) |
(→Solution) |
||
Line 6: | Line 6: | ||
To find n, realize that there are 3!=6 ways of ordering the numbers in each of the places. Additionally, there are three possibilities for the numbers in the ones place-4 7 and 9, 5 7 and 8, and 6 7 and 9. Therefore there are 6^3 * 3 ways total, which is 648. <math>|m-n|</math>=<math>|810-648|</math>=162. | To find n, realize that there are 3!=6 ways of ordering the numbers in each of the places. Additionally, there are three possibilities for the numbers in the ones place-4 7 and 9, 5 7 and 8, and 6 7 and 9. Therefore there are 6^3 * 3 ways total, which is 648. <math>|m-n|</math>=<math>|810-648|</math>=162. | ||
+ | |||
+ | == See also == | ||
+ | {{AIME box|year=2016|n=I|num-b=7|num-a=9}} | ||
+ | {{MAA Notice}} |
Revision as of 16:55, 4 March 2016
Problem 8
For a permutation of the digits , let denote the sum of the three -digit numbers , , and . Let be the minimum value of subject to the condition that the units digit of is . Let denote the number of permutations with . Find .
Solution
Solution by jonnyboyg: To minimize , the numbers 1, 2, and 3 must be in the hundreds places. The numbers in the ones places must have a sum of 20. This means that the numbers in the tens places will always have the same sum. One way to do this is 154+267+389=810. Therefore m=810.
To find n, realize that there are 3!=6 ways of ordering the numbers in each of the places. Additionally, there are three possibilities for the numbers in the ones place-4 7 and 9, 5 7 and 8, and 6 7 and 9. Therefore there are 6^3 * 3 ways total, which is 648. ==162.
See also
2016 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 7 |
Followed by Problem 9 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.