MEMO 2012 pojedinačno problem 2
Dodao/la:
arhiva23. lipnja 2013. Let

be a positive integer. A set

is called allowed if it does not contain three distinct elements

such that

divides

and

divides

. Determine the largest possible number of elements in an allowed set

.
%V0
Let $N$ be a positive integer. A set $S \subset \{ 1, 2, \cdots, N \}$ is called allowed if it does not contain three distinct elements $a, b, c$ such that $a$ divides $b$ and $b$ divides $c$. Determine the largest possible number of elements in an allowed set $S$.
Izvor: Srednjoeuropska matematička olimpijada 2012, pojedinačno natjecanje, problem 2