Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Pick's theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{good article}} {{short description|Formula for area of a grid polygon}} {{for|the theorem in complex analysis|Schwarz lemma#Schwarz–Pick theorem}} [[File:Farey_sunburst_6.svg|thumb|[[Farey sunburst]] of order 6, with 1 interior {{color|red|(red)}} and 96 boundary {{color|green|(green)}} points giving an area of {{nowrap|{{color|red|1}} + {{sfrac|{{color|green|96}}|2}} − 1 {{=}} 48}}{{r|kiradjiev}}]] In [[geometry]], '''Pick's theorem''' provides a formula for the [[area]] of a [[simple polygon]] with integer [[vertex (geometry)|vertex]] coordinates, in terms of the number of integer points within it and on its boundary. The result was first described by [[Georg Alexander Pick]] in 1899.{{r|pick}} It was popularized in English by [[Hugo Steinhaus]] in the 1950 edition of his book ''Mathematical Snapshots''.{{r|gs|steinhaus}} It has multiple proofs, and can be generalized to formulas for certain kinds of non-simple polygons.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)