By placing 27 squares with side $1$ in a circle with radius $2$, such that each square is entirely inside the circle, prove that there exists a point that 3 squares share (inside of their area).
I thought about dividing the circle into 9 equal areas and using the pigeonhole principle, but got stuck there. Any hint will help.
To get the desired conclusion, $26$ unit squares will suffice.
Let $D$ denote the disk of radius $2$, and let $C$ be the subregion of $D$ covered by some placement of $26$ unit squares within $D$.
Suppose every point of $D$ is contained in at most two of the unit squares.
Our goal is to derive a contradiction.
Let $X_i$ denote the $i$-th unit square.
For each $i$, let
For a given set $S$, let $[S]$ denote the area of $S$. \begin{align*} \text{Then}\;\; 4\pi&=[D]\\[4pt] &\ge [C]\\[4pt] &= \sum_{i=1}^{26}[A_i] + \left({\small{\frac{1}{2}}}\right) \sum_{i=1}^{26}[B_i]\\[4pt] &\ge \left({\small{\frac{1}{2}}}\right) \sum_{i=1}^{26}[A_i] + \left({\small{\frac{1}{2}}}\right) \sum_{i=1}^{26}[B_i]\\[4pt] &= \left({\small{\frac{1}{2}}}\right) \sum_{i=1}^{26}\left([A_i] + [B_i]\right)\\[4pt] &= \left({\small{\frac{1}{2}}}\right) \sum_{i=1}^{26}\,(1)\\[4pt] &= \left({\small{\frac{1}{2}}}\right)(26)\\[4pt] &= 13\\[4pt] \end{align*} contradiction.
This proves the claim.
Note:
Squares are an awkward shape for covering a large subregion of a disk, so I suspect the actual maximum number of unit squares which can be placed in a disk of radius $2$, such that each point of the disk is covered by at most two of the unit squares, is a lot less than $25$.