We have a convex irregular pentagon whose vertices (no three of which are collinear) have integer coordinates.
What is the least area such a pentagon can have ?
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.
We can use Pick's formula to make analysis a bit easier. If i is the number of interior points, and b is the number of vertices, then the area is
i + 2 1 b − 1
The least this can be for b = 5 would be 2 3 , but only if such a pentagon can be drawn without any interior points. Such a pentagon can be drawn, but it will not be convex.
The next least is 2 5 , where there is 1 interior point, as you have drawn.