Difference between revisions of "2006 iTest Problems/Problem 13"
Rockmanex3 (talk | contribs) (Solution to Problem 13 -- Optimization with Prime Summation) |
m (→Solution) |
||
Line 19: | Line 19: | ||
==Solution== | ==Solution== | ||
− | The prime numbers less than 49 are <math>2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47</math>. The largest must be at least <math>\lceil \tfrac{49}{3} \rceil = 17</math>. Afterward, we can perform casework on the largest number. One of the cases | + | The prime numbers less than 49 are <math>2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47</math>. The largest must be at least <math>\lceil \tfrac{49}{3} \rceil = 17</math>. Afterward, we can perform casework on the largest number. One of the cases is <math>19 \cdot 17 \cdot 13 = 4199</math>, which is larger than all of the given numeric answer choices. Thus, the answer is <math>\boxed{\textbf{(M)}}</math>. |
==See Also== | ==See Also== |
Latest revision as of 22:35, 3 November 2023
Problem
Suppose that are three distinct prime numbers such that . Find the maximum possible value for the product .
Solution
The prime numbers less than 49 are . The largest must be at least . Afterward, we can perform casework on the largest number. One of the cases is , which is larger than all of the given numeric answer choices. Thus, the answer is .
See Also
2006 iTest (Problems, Answer Key) | ||
Preceded by: Problem 12 |
Followed by: Problem 14 | |
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 • 31 • 32 • 33 • 34 • 35 • 36 • 37 • 38 • 39 • 40 • U1 • U2 • U3 • U4 • U5 • U6 • U7 • U8 • U9 • U10 |