2023 WSMO Speed Round Problems/Problem 1

Revision as of 15:33, 2 May 2025 by Pinkpig (talk | contribs) (Created page with "==Problem== Find the number of square units in the area of the shaded region. <asy> size(4cm); for (int i=0; i<5; ++i) { for (int j=0; j<5; ++j) { dot((i,j)); } } pair...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Find the number of square units in the area of the shaded region. [asy] size(4cm);  for (int i=0; i<5; ++i) {  for (int j=0; j<5; ++j)  {   dot((i,j));  } } pair a = (0,2); pair b = (1,4); pair c = (3,2); pair d = (4,4); pair e = (3,0); pair f = (1,2);  path x = a--b--c--d--e--f--cycle;  fill(x, cyan); draw(x, linewidth(2)); [/asy]

Solution