Problemadvanced
Lattice points inside a non-lattice polygon
Problem of counting integer points inside a polygon whose vertices need not be lattice points, solved with a Pick-like formula and gcd computations.
Problem of counting integer points inside a polygon whose vertices need not be lattice points, solved with a Pick-like formula and gcd computations.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag X0W0GT Edit this page History Report an error