Difference between revisions of "2019 AMC 10B Problems/Problem 12"
Ironicninja (talk | contribs) |
|||
| Line 1: | Line 1: | ||
| + | ==Problem== | ||
| + | |||
What is the greatest possible sum of the digits in the base-seven representation of a positive integer less than <math>2019</math>? | What is the greatest possible sum of the digits in the base-seven representation of a positive integer less than <math>2019</math>? | ||
| Line 12: | Line 14: | ||
iron | iron | ||
| + | |||
| + | ==See Also== | ||
| + | |||
| + | {{AMC10 box|year=2019|ab=B|num-b=11|num-a=13}} | ||
| + | {{MAA Notice}} | ||
Revision as of 14:45, 14 February 2019
Problem
What is the greatest possible sum of the digits in the base-seven representation of a positive integer less than 
?
Solution
Convert 2019 to base 7. This will get you 5613, which will be the upper bound. To maximize the sum of the digits, we want as many 6s as possible (which is the highest value in base 7), and this would be the number "4666". Thus, the answer is 
iron
See Also
| 2019 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 11 |
Followed by Problem 13 | |
| 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. 
