Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2005 USAMO Problems/Problem 6"

(→‎Solution)
m
Line 4: Line 4:
 
C_1 \log_{10} n \le f(n) \le C_2 \log_{10} n.
 
C_1 \log_{10} n \le f(n) \le C_2 \log_{10} n.
 
</cmath>
 
</cmath>
 +
 +
==Solution==
 +
{{solution}}
 +
 +
== See Also==
 +
{{USAMO newbox|year=2005|num-b=5|after=Last Question}}

Revision as of 18:05, 11 April 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.

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
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2005_USAMO_Problems/Problem_6&oldid=52484"