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 $m$ a positive integer, let $s(m)$ be the sum of the digits of $m$. For $n\ge 2$, let $f(n)$ be the minimal $k$ for which there exists a set $S$ of $n$ positive integers such that $s\left(\sum_{x\in X} x\right) = k$ for any nonempty subset $X\subset S$. Prove that there are constants $0 < C_1 < C_2$ with \[C_1 \log_{10} n \le f(n) \le C_2 \log_{10} n.\]

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 (ProblemsResources)
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. AMC logo.png