Difference between revisions of "2006 AMC 12A Problems/Problem 4"
Dairyqueenxd (talk | contribs) (→Problem) |
Dairyqueenxd (talk | contribs) (→Solution 1) |
||
| Line 6: | Line 6: | ||
== Solution 1 == | == Solution 1 == | ||
| − | From the [[greedy algorithm]], we have <math>9</math> in the hours section and <math>59</math> in the minutes section. <math>9+5+9= | + | From the [[greedy algorithm]], we have <math>9</math> in the hours section and <math>59</math> in the minutes section. <math>9+5+9=\boxed{\textbf{(E) }23}</math> |
==Solution 2== | ==Solution 2== | ||
Revision as of 17:37, 16 December 2021
- The following problem is from both the 2006 AMC 12A #4 and 2008 AMC 10A #4, so both problems redirect to this page.
Contents
Problem
A digital watch displays hours and minutes with AM and PM. What is the largest possible sum of the digits in the display?
Solution 1
From the greedy algorithm, we have 
in the hours section and 
in the minutes section. 
Solution 2
With a matrix we can see
The largest single digit sum we can get is .
For the minutes digits, we can combine the largest 
digits, which are 
, and finally 
.
See also
| 2006 AMC 12A (Problems • Answer Key • Resources) | |
| Preceded by Problem 3 |
Followed by Problem 5 |
| 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 12 Problems and Solutions | |
| 2006 AMC 10A (Problems • Answer Key • Resources) | ||
| Preceded by Problem 3 |
Followed by Problem 5 | |
| 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. 
