Art of Problem Solving

2019 AMC 10B Problems/Problem 12: Difference between revisions

Da923120 (talk | contribs)
No edit summary
No edit summary
Line 1: Line 1:
Whoah, oh. I gave you my heart
What is the greatest possible sum of the digits in the base-seven representation of a positive integer less than <math>2019</math>?
 
<math>\textbf{(A) } 11
\qquad\textbf{(B) } 14
\qquad\textbf{(C) } 22
\qquad\textbf{(D) } 23
\qquad\textbf{(E) } 27</math>
 
==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 <math>4+6+6+6 = \boxed{C) 22}</math>
 
iron

Revision as of 14:01, 14 February 2019

What is the greatest possible sum of the digits in the base-seven representation of a positive integer less than $2019$?

$\textbf{(A) } 11 \qquad\textbf{(B) } 14 \qquad\textbf{(C) } 22 \qquad\textbf{(D) } 23 \qquad\textbf{(E) } 27$

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 $4+6+6+6 = \boxed{C) 22}$

iron