Recurrent Theme of Pick's Theorem
Abstract
We review and possibly add some new variant to the existing derivations of the formula for the area of Jordan lattice polygons drawn on two-dimensional lattices. The formula is known as Pick's theorem and is related to the number theory elementary result-Bezout lemma. It is pointed out that Euclidean algorithm can be easily used in construction of infinite number of distinct primitive cells for any two-dimensional lattice. Pick's formula itself can also be obtained in an elementary "cut and re-assemble" finite process.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.