Difference between revisions of "2007 Cyprus MO/Lyceum/Problem 10"
(not good at explaining, also unsure of category) |
(No difference)
|
Revision as of 16:46, 6 May 2007
Problem
The volume of an orthogonal parallelepiped is and its dimensions are integers. The minimum sum of the dimensions is
Solution
, so we want to minimize the sum of three integers whose product is . To do this, the factors must be as close together as possible. Therefore, none of the factors will be , and one will likely be . This implies that the factors are minimized when they are , and the answer is .
See also
2007 Cyprus MO, Lyceum (Problems) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
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 • 26 • 27 • 28 • 29 • 30 |