The Thinking Board

Pick's theorem

The room

Not for the board · 0 of 5

The problem

A lattice polygon is a simple polygon whose corners are all points with integer coordinates. Suppose it has lattice points strictly inside and lattice points on its boundary.

Show that its area is

You can cut the polygon into tiny triangles that contain no other lattice points, or reach for Euler's formula for polyhedra, which is also on the board. Is the second proof really independent of the first?

0 proofs posted

0 votes cast
Most convincingNewest

No proofs yet

Be the first to put an argument on the board.

Add a proof