Math/CS Club Talk: A Second Helping of Pick's Theorem

Math/CS Club talk on Pick's Theorem.
  • What Math and Computer Science student featured
  • When Nov 25, 2014 from 03:00 PM to 04:00 PM (GMT+0 / UTC0)
  • Where Math/CS Department Conference Room: AC/2C07
  • Contact Name
  • Contact Phone 718-262-2551
  • Attendees Talks are open to all (you do NOT have to be a math or CS major to attend). Snacks will be provided.
  • Add event to calendar iCal

Earlier this semester we discussed Pick’s Theorem. Join us for a second talk where we prove the theorem.

Missed the first talk? No worries. You can follow this one without having sat through the other.

Pick’s theorem states that the area of a polygon whose vertices have integer coefficients can be found just by counting the lattice points on the interior and boundary of the polygon!

Specifically, the area is given by

Area(P) = i + (b/2) - 1 where i is the number interior lattice points, and b is the number of boundary lattice points.

X