Gcd of numbers on blackboard
Source: Japan Mathematical Olympiad Finals 2018 Q1
February 13, 2018
number theorygreatest common divisorinvariant
Problem Statement
Positive integers between to inclusive are written on a blackboard, each exactly once. One operation involves choosing two numbers and on the blackboard and erasing them, then writing the greatest common divisor of and . After a number of operations, there is only one positive integer left on the blackboard. Prove this number cannot be a perfect square.