Problem

Source: China Western Mathematical Olympiad 2019 Day 2 P4

Tags: combinatorics, Sets



We call a set $S$ a good set if $S=\{x,2x,3x\}(x\neq 0).$ For a given integer $n(n\geq 3),$ determine the largest possible number of the good subsets of a set containing $n$ positive integers.