Difference between revisions of "1968 AHSME Problems/Problem 26"
(Created page with "== Problem == Let <math>S=2+4+6+\cdots +2N</math>, where <math>N</math> is the smallest positive integer such that <math>S>1,000,000</math>. Then the sum of the digits of <math>...") |
m (→Solution) |
||
| Line 10: | Line 10: | ||
== Solution == | == Solution == | ||
| − | <math>\fbox{}</math> | + | <math>\fbox{E}</math> |
== See also == | == See also == | ||
Revision as of 03:33, 29 September 2014
Problem
Let 
, where 
is the smallest positive integer such that 
. Then the sum of the digits of is:
Solution
See also
| 1968 AHSME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 25 |
Followed by Problem 27 | |
| 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 • 26 • 27 • 28 • 29 • 30 | ||
| All AHSME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
