Difference between revisions of "2022 AIME II Problems/Problem 14"
Isabelchen (talk | contribs) |
Isabelchen (talk | contribs) (→Solution 1) |
||
Line 12: | Line 12: | ||
We can get the answer by solving this equation. | We can get the answer by solving this equation. | ||
+ | |||
+ | <math>c > \lfloor \frac{c-1}{b} \rfloor + b-1</math> | ||
+ | |||
+ | <math>\frac{999}{c} + c > \lfloor \frac{999}{c} \rfloor + \lfloor \frac{c-1}{b} \rfloor + b-1 = 97</math> | ||
+ | |||
+ | <math>c^2 - 97c + 999 > 0</math>, <math>c > 85.3</math>, <math>c < 11.7</math> | ||
+ | |||
+ | <math>\lfloor \frac{999}{c} \rfloor + \lfloor \frac{c-1}{b} \rfloor + b-1 > \frac{999}{c}</math> | ||
+ | |||
+ | <math>97 > \frac{999}{c}</math>, <math>c>10.3</math> | ||
+ | |||
+ | Case <math>1</math>: For <math>10.3 < c < 11.7</math>, <math>c = 11</math>, <math>\lfloor \frac{999}{11} \rfloor + \lfloor \frac{10}{b} \rfloor + b-1 = 97</math> | ||
+ | |||
+ | <math>\lfloor \frac{10}{b} \rfloor + b = 8</math>, <math>b=7</math> | ||
+ | |||
+ | Case <math>2</math>: For <math>c>85.3</math>, | ||
+ | |||
+ | Case <math>2.1</math>: <math>c = 86</math>, <math>\lfloor \frac{999}{86} \rfloor + \lfloor \frac{85}{b} \rfloor + b-1 = 97</math> | ||
+ | |||
+ | <math>\lfloor \frac{85}{b} \rfloor + b = 87</math>, <math>b=87 > c</math>, no solution | ||
To be continued...... | To be continued...... |
Revision as of 11:41, 19 February 2022
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 1
Notice that we must have , or else 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 is able to have all the values from to cents. Plus stamps of value , every value up to is able to be represented. Therefore using stamps of value , stamps of value , and stamps of value all values up to are able to be represented in sub-collections, while minimizing the number of stamps.
So,
We can get the answer by solving this equation.
, ,
,
Case : For , ,
,
Case : For ,
Case : ,
, , no solution
To be continued......
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.