Problem

Source:

Tags: combinatorics



There are $9$ point in the Cartezian plane with coordinates $(0,0),(0,1),(0,2),(1,0),(1,1),(1,2),(2,0),(2,1),(2,2).$ Some points are coloured in red and the others in blue. Prove that for any colouring of the points we can always find a right isosceles triangle whose vertexes have the same colour.