Maths Olympiad Prep

Library / /261 of 348

Algebra Difficulty 5.0 AIME, harder Find the answer

Given positive integers a1,a2,,a2023a_{1}, a_{2}, \ldots, a_{2023} such that ak=i=12023akaia_{k}=\sum_{i=1}^{2023}\left|a_{k}-a_{i}\right| for all 1k20231 \leq k \leq 2023, find the minimum possible value of a1+a2++a2023a_{1}+a_{2}+\cdots+a_{2023}.

A number or a short expression. Spacing and $ signs are ignored.

Solution

Without loss of generality, let a1a2a2023a_{1} \leq a_{2} \leq \cdots \leq a_{2023}. Then, note that ak+1ak=i=12023ak+1aiakai=k(ak+1ak)(2023k)(ak+1ak)=(2k2023)(ak+1ak)a_{k+1}-a_{k}=\sum_{i=1}^{2023}\left|a_{k+1}-a_{i}\right|-\left|a_{k}-a_{i}\right|=k(a_{k+1}-a_{k})-(2023-k)(a_{k+1}-a_{k})=(2k-2023)(a_{k+1}-a_{k}). Thus, ak+1=aka_{k+1}=a_{k} unless k=1012k=1012, so a1=a2==a1012a_{1}=a_{2}=\cdots=a_{1012} and a1013==a2023a_{1013}=\cdots=a_{2023}, and we can check that that they must be in a ratio of 1011:10121011:1012. Thus, a1,,a2023a_{1}, \ldots, a_{2023} must consist of 1012 copies of 1011c1011c, and 1011 copies of 1012c1012c for some cc, so for everything to be a positive integer, we need c1c \geq 1. This gives us the final answer of 10111012+10121011=20462641011 \cdot 1012+1012 \cdot 1011=2046264.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.