Question 90
The Euclidean plane is dissected into several disjoint *bounded* regions (not further subdivided) by $n$ intersecting equilateral triangles of side length $1$. Determine the smallest value of $n$ such that the number of parts thus arising can be at least $2023$.
The picture shows four intersecting triangles.
The picture shows four intersecting triangles.