Difference between revisions of "2002 AMC 10A Problems/Problem 18"
m (→Problem) |
|||
Line 11: | Line 11: | ||
https://www.youtube.com/watch?v=1sdXHKW6sqA ~David | https://www.youtube.com/watch?v=1sdXHKW6sqA ~David | ||
+ | |||
+ | ==Video Solution by Daily Dose of Math== | ||
+ | |||
+ | https://youtu.be/QSLlfaf50Is | ||
+ | |||
+ | ~Thesmartgreekmathdude | ||
==See Also== | ==See Also== |
Latest revision as of 17:40, 15 October 2024
Contents
[hide]Problem
A xx cube is made of normal dice. Each die's opposite sides sum to . What is the smallest possible sum of all of the values visible on the faces of the large cube?
Solution
In a 3x3x3 cube, there are cubes with three faces showing, with two faces showing and with one face showing. The smallest sum with three faces showing is , with two faces showing is , and with one face showing is . Hence, the smallest possible sum is . Our answer is thus .
Video Solution
https://www.youtube.com/watch?v=1sdXHKW6sqA ~David
Video Solution by Daily Dose of Math
~Thesmartgreekmathdude
See Also
2002 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 17 |
Followed by Problem 19 | |
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 AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.