Problem

Source: (2021 -) 2022 Dürer Math Competition Regional E4 E+1 https://artofproblemsolving.com/community/c1621671_

Tags: combinatorics, number theory, coprime



We want to partition the integers $1, 2, 3, . . . , 100$ into several groups such that within each group either any two numbers are coprime or any two are not coprime. At least how many groups are needed for such a partition? We call two integers coprime if they have no common divisor greater than $1$.