Find the maximum value of $k$ for which one can choose $k$ integers out of $1,2... ,2n$ so that none of them divides another one.
Problem
Source: 2001 Estonia National Olympiad Final Round grade 12 p2
Tags: max, number theory, divides
Source: 2001 Estonia National Olympiad Final Round grade 12 p2
Tags: max, number theory, divides
Find the maximum value of $k$ for which one can choose $k$ integers out of $1,2... ,2n$ so that none of them divides another one.