Find the number of elements that a set $B$ can have, contained in $(1, 2, ... , n)$, according to the following property: For any elements $a$ and $b$ on $B$ ($a \ne b$), $(a-b) \not| (a+b)$.
Problem
Source: Cono Sur 1993-problem 3
Tags: ceiling function, number theory unsolved, number theory