Difference between revisions of "2022 AIME II Problems/Problem 14"
m (Wording corrections) |
m |
||
Line 41: | Line 41: | ||
~[https://artofproblemsolving.com/wiki/index.php/User:Isabelchen isabelchen] | ~[https://artofproblemsolving.com/wiki/index.php/User:Isabelchen isabelchen] | ||
+ | |||
+ | |||
+ | |||
+ | ==Video Solution== | ||
+ | https://youtu.be/jptMMVCuj34 | ||
+ | |||
+ | ~MathProblemSolvingSkills.com | ||
+ | |||
==See Also== | ==See Also== |
Revision as of 16:18, 26 January 2023
Contents
Problem
For positive integers ,
, and
with
, consider collections of postage stamps in denominations
,
, and
cents that contain at least one stamp of each denomination. If there exists such a collection that contains sub-collections worth every whole number of cents up to
cents, let
be the minimum number of stamps in such a collection. Find the sum of the three least values of
such that
for some choice of
and
.
Solution
Notice that we must have , otherwise
cent stamp cannot be represented. At least
numbers of
cent stamps are needed to represent the values less than
. Using at most
stamps of value
and
, it can have all the values from
to
cents. Plus
stamps of value
, every value up to
can be represented. Therefore using
stamps of value
,
stamps of value
, and
stamps of value
, all values up to
can be represented in sub-collections, while minimizing the number of stamps.
So, ,
. We can get the answer by solving this equation.
,
or
,
For
,
,
![]()
,
![]()
For
,
![]()
,
![]()
,
, no solution
![]()
,
![]()
,
or
, neither values satisfy
, no solution
![]()
,
![]()
,
![]()
![]()
,
![]()
,
![]()
The least values of
are
,
,
.
Video Solution
~MathProblemSolvingSkills.com
See Also
2022 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.