olymmath

HMMT November 2023 T10

  • Team
  • Answer

Compute the number of ways a non-self-intersecting concave quadrilateral can be drawn in the plane such that two of its vertices are (0,0)(0,0) and (1,0)(1,0), and the other two vertices are two distinct lattice points (a,b),(c,d)(a, b),(c, d) with 0≤a,c≤590 \leq a, c \leq 59 and 1≤b,d≤51 \leq b, d \leq 5. (A concave quadrilateral is a quadrilateral with an angle strictly larger than 180∘180^{\circ}. A lattice point is a point with both coordinates integers.)

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

366

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmnt/2023/t10 · Tag V117TT7R42 · Edit this page on GitHub · Keys: j next, k previous