2024 USAJMO Problems/Problem 2

Revision as of 20:37, 19 March 2024 by Ryanjwang (talk | contribs) (Created page with "__TOC__ === Problem === Let <math>m</math> and <math>n</math> be positive integers. Let <math>S</math> be the set of integer points <math>(x,y)</math> with <math>1\leq x\leq2...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Contents

 [hide

Problem

Let $m$ and $n$ be positive integers. Let $S$ be the set of integer points $(x,y)$ with $1\leq x\leq2m$ and $1\leq y\leq2n$. A configuration of $mn$ rectangles is called happy if each point in $S$ is a vertex of exactly one rectangle, and all rectangles have sides parallel to the coordinate axes. Prove that the number of happy configurations is odd.

Solution 1