Problem

Source: 11-th Hungary-Israel Binational Mathematical Competition 2000

Tags: number theory unsolved, number theory



Let $S$ be the set of all partitions of $2000$ (in a sum of positive integers). For every such partition $p$, we define $f (p)$ to be the sum of the number of summands in $p$ and the maximal summand in $p$. Compute the minimum of $f (p)$ when $p \in S .$