Difference between revisions of "2006 AMC 12A Problems/Problem 4"
I like pie (talk | contribs) (Duplicate, AMC 10 box, LaTeX spacing) |
(→See also) |
||
| Line 11: | Line 11: | ||
{{AMC12 box|year=2006|ab=A|num-b=3|num-a=5}} | {{AMC12 box|year=2006|ab=A|num-b=3|num-a=5}} | ||
{{AMC10 box|year=2006|ab=A|num-b=3|num-a=5}} | {{AMC10 box|year=2006|ab=A|num-b=3|num-a=5}} | ||
| + | {{MAA Notice}} | ||
[[Category:Introductory Number Theory Problems]] | [[Category:Introductory Number Theory Problems]] | ||
Revision as of 16:50, 3 July 2013
- The following problem is from both the 2006 AMC 12A #4 and 2008 AMC 10A #4, so both problems redirect to this page.
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
From the greedy algorithm, we have 
in the hours section and 
in the minutes section. 
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. 
