Difference between revisions of "2024 AMC 10B Problems/Problem 13"
(→Solution 1) |
Jj empire10 (talk | contribs) |
||
Line 8: | Line 8: | ||
~[[User:Bloggish|Bloggish]] | ~[[User:Bloggish|Bloggish]] | ||
+ | |||
+ | ==Video Solution 1 by Pi Academy (Fast and Easy ⚡🚀)== | ||
+ | |||
+ | https://youtu.be/YqKmvSR1Ckk?feature=shared | ||
+ | |||
+ | ~ Pi Academy | ||
==See also== | ==See also== | ||
{{AMC10 box|year=2024|ab=B|num-b=12|num-a=14}} | {{AMC10 box|year=2024|ab=B|num-b=12|num-a=14}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 10:03, 14 November 2024
Contents
[hide]Problem
Positive integers and satisfy the equation . What is the minimum possible value of .
Solution 1
Note that . Since and are positive integers, and , we can represent each value of and as the product of a positive integer and . Let's say that and , where and are positive integers. This implies that and that . WLOG, assume that . It is not hard to see that reaches its minimum when reaches its minimum. We now apply algebraic manipulation to get that . Since is determined, we now want to reach its maximum. Since and are positive integers, we can use the AM-GM inequality to get that: . When reaches its maximum, . This implies that . However, this is not possible since and and integers. Under this constraint, we can see that reaches its maximum when and . Therefore, the minimum possible value of is
Video Solution 1 by Pi Academy (Fast and Easy ⚡🚀)
https://youtu.be/YqKmvSR1Ckk?feature=shared
~ Pi Academy
See also
2024 AMC 10B (Problems • Answer Key • Resources) | ||
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 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.