Let be an equilateral triangle of side length , whose vertices are located at and . Let be continuous functions such that, i.e., each point in is mapped to some point in the triangle by each function .
Think of each as a pen with color . So that each colors its range (which is some portion of the triangle ) with the color . E.g., if , this means that the point is colored '1' by the function .
Find the minimum number of continuous functions needed to color the entire triangle.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The stunning discovery of the existence of such continuous functions, which span the whole triangle (or square) was made by Peano. See Space-filling curve .