Problem

Source: 2017 Iran TST second exam day1 p2

Tags: Iran, Iranian TST, number theory, combinatorics



Find the largest number $n$ that for which there exists $n$ positive integers such that non of them divides another one, but between every three of them, one divides the sum of the other two. Proposed by Morteza Saghafian