Problem

Source: Argentina TST 2009

Tags: induction, pigeonhole principle, combinatorics unsolved, combinatorics



On a $ 50 \times 50$ board, the centers of several unit squares are colored black. Find the maximum number of centers that can be colored black in such a way that no three black points form a right-angled triangle.