Problem

Source: Kosovo MO 2019 Grade 9, Problem 5

Tags: combinatorics



There are given in a table numbers $1,2,...,18$. What is minimal number of numbers we should erase such that the sum of every two remaining numbers is not perfect square of a positive integer.