AoPSWiki

Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!

Personal tools

Search

Toolbox

2005 USAMO Problems/Problem 6

From AoPSWiki

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.$

Retrieved from "http://www.artofproblemsolving.com/Wiki/index.php/2005_USAMO_Problems/Problem_6"

Add a glimpse of the Art of Problem Solving Forum to your own site!
Click here for details!

© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us