8

Given some positive integer $n\ge 3$, we can ask how many 2-dimensional lattices $L_1,\ldots,L_k$ are required such that their disjoint union contains all vertices of a regular $n$-gon. (We don't require that the lattices be centered at the origin.)
When $n=3,4,6$, the polygon is a lattice polygo...