ISL 2013 C4
Let be a positive integer, and let be a subset of . An -partition of into parts is a representation of as a sum , where the parts belong to and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set . We say that an -partition of into parts is optimal if there is no -partition of into parts with . Prove that any optimal -partition of contains at most different parts. (Germany)
Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.
Official text: IMO 2013 Shortlist booklet, page 4.
Solutions
Official solution Solution 1 by the IMO Problem Selection Committee
The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).
Similar problems
These problems have the most words in common with this statement.