Difference between revisions of "2010 UNCO Math Contest II Problems/Problem 3"
m (→See also) |
(→Solution) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 6: | Line 6: | ||
== Solution == | == Solution == | ||
| + | The solution rst must factor <math>48=2^{4}\cdot{3}</math> and the numbers must be DISTINCT. <math>3+4+4=11</math> fails the distinct test so <math>2+4+6=12</math> is the solution. | ||
== See also == | == See also == | ||
Latest revision as of 01:46, 13 January 2019
Problem
Suppose 
, and 
are three different positive integers and that their product is 
, i.e., 
What is the smallest possible value of the sum 
?
Solution
The solution rst must factor 
and the numbers must be DISTINCT. 
fails the distinct test so 
is the solution.
See also
| 2010 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 2 |
Followed by Problem 4 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
| All UNCO Math Contest Problems and Solutions | ||
