Difference between revisions of "2005 USAMO Problems/Problem 6"
(→Solution) |
|||
Line 7: | Line 7: | ||
==Solution== | ==Solution== | ||
{{solution}} | {{solution}} | ||
+ | By Jason's theorem number 1239142, we know this is true. | ||
== See Also== | == See Also== | ||
{{USAMO newbox|year=2005|num-b=5|after=Last Question}} | {{USAMO newbox|year=2005|num-b=5|after=Last Question}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 19:52, 17 October 2013
Problem
For a positive integer, let be the sum of the digits of . For , let be the minimal for which there exists a set of positive integers such that for any nonempty subset . Prove that there are constants with
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it. By Jason's theorem number 1239142, we know this is true.
See Also
2005 USAMO (Problems • Resources) | ||
Preceded by Problem 5 |
Followed by Last Question | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.