Olympiad Maths Prep

Track / Stage 4 / 83 of 340 #343 of 2000

Problem 343

AMC 12 late, AIME early
Number theory Difficulty 4.7 Find the answer

Determine the smallest integer n2n \geqslant 2 such that there exist strictly positive integers (ai)1in\left(a_{i}\right)_{1 \leqslant i \leqslant n} satisfying:

i=1nai2(i=1nai)21 \sum_{i=1}^{n} a_{i}^{2} \mid\left(\sum_{i=1}^{n} a_{i}\right)^{2}-1

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

We can find the solution at the following address, page 14: https://maths-olympiques . fr/wp-content/uploads/2020/04/corrig\%C3\%A9-comment\%C3\%A9-envoi-5. pdf

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