Difference between revisions of "2024 USAJMO Problems/Problem 2"
(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...") |
(→Solution 1) |
||
Line 5: | Line 5: | ||
== Solution 1 == | == Solution 1 == | ||
+ | |||
+ | |||
+ | ==See Also== | ||
+ | {{USAJMO newbox|year=2024|num-b=1|num-a=3}} | ||
+ | {{MAA Notice}} |
Revision as of 20:38, 19 March 2024
Contents
[hide]Problem
Let and be positive integers. Let be the set of integer points with and . A configuration of rectangles is called happy if each point in 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
See Also
2024 USAJMO (Problems • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAJMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.