MathDB
Slovenia 2019 TST1 P3

Source: 2019 Slovenia 1st TST Problem 3

February 19, 2019
TSTcombinatorics

Problem Statement

Let nn be any positive integer and MM a set that contains nn positive integers. A sequence with 2n2^n elements is christmassy if every element of the sequence is an element of MM. Prove that, in any christmassy sequence there exist some successive elements, the product of whom is a perfect square.