olymmath

ISL 2013 C4

Let nn be a positive integer, and let AA be a subset of {1,…,n}\{1, \ldots, n\}. An AA-partition of nn into kk parts is a representation of nn as a sum n=a1+⋯+akn=a_{1}+\cdots+a_{k}, where the parts a1,…,aka_{1}, \ldots, a_{k} belong to AA and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set {a1,a2,…,ak}\left\{a_{1}, a_{2}, \ldots, a_{k}\right\}. We say that an AA-partition of nn into kk parts is optimal if there is no AA-partition of nn into rr parts with r<kr<k. Prove that any optimal AA-partition of nn contains at most 6n3\sqrt[3]{6 n} 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.

Locator isl/2013/c4 · Tag 7Y67XR787A · Edit this page on GitHub · Keys: j next, k previous