MathDB
partitions of $2000$ (in a sum of positive integers).

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

April 20, 2007
number theory unsolvednumber theory

Problem Statement

Let SS be the set of all partitions of 20002000 (in a sum of positive integers). For every such partition pp, we define f(p)f (p) to be the sum of the number of summands in pp and the maximal summand in pp. Compute the minimum of f(p)f (p) when p∈S.p \in S .
Back to ProblemsView on AoPS