Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2009-part-05 — 172 problems (EN–VI) Question 9

Math Olympiad Vault · MathNet 2009-part-05 — 172 problems (EN–VI)

Question 9

A set of points is convex if the points are the vertices of a convex polygon (that is, a non-selfintersecting polygon with all angles less than or equal to $180^{\circ}$). Let $S$ be the set of points $(x, y)$ such that $x$ and $y$ are integers and $1 \leq x, y \leq 26$. Find the number of ways to choose a convex subset of $S$ that contains exactly 98 points.