Let $n$ be a positive integer and let $\triangle$ be the closed triangular domain with vertices at the lattice points $(0, 0), (n, 0)$ and $(0, n)$. Determine the maximal cardinality a set $S$ of lattice points in $\triangle$ may have, if the line through every pair of distinct points in $S$ is parallel to no side of $\triangle$.
Problem
Source: Danube 2014 p4
Tags: lattice points, parallelogram, Maximal, cardinality, combinatorics, geometry, combinatorial geometry