Show that there is a dense subset $S$ of $A=[0,1]\times [0,1]$ such that $S$ contains at most one point on each vertical line and at most one point on each horizontal line.
When I think about dense subsets and which contain "not so many" points, the rational numbers come to mind. So if we take $P=\mathbb{Q}\cap[0,1]$, and $S=P\times P$, then we do have the closure of $S$ equal $A$. However, $S$ contains more than one point on each vertical/horizontal line (in fact, infinitely many). How might we adjust so that each horizontal/vertical line contains at most one point in $S$?