CONO-SUR 2014 Problem 1
Numbers through are written on a board. A valid operation is to erase two numbers and on the board and replace them with the greatest common divisor and the least common multiple of and .
Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.