Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2025 USAJMO Problems/Problem 3

Revision as of 01:41, 22 March 2025 by Eevee9406 (talk | contribs) (Created page with "__TOC__ == Problem == Let <math>m</math> and <math>n</math> be positive integers, and let <math>\mathcal R</math> be a <math>2m\times 2n</math> grid of unit squares. A domin...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $m$ and $n$ be positive integers, and let $\mathcal R$ be a $2m\times 2n$ grid of unit squares.

A domino is a $1\times2$ or $2\times1$ rectangle. A subset $S$ of grid squares in $\mathcal R$ is domino-tileable if dominoes can be placed to cover every square of $S$ exactly once with no domino extending outside of $S$. Note: The empty set is domino tileable.

An up-right path is a path from the lower-left corner of $\mathcal R$ to the upper-right corner of $\mathcal R$ formed by exactly $2m+2n$ edges of the grid squares.

Determine, with proof, in terms of $m$ and $n$, the number of up-right paths that divide $\mathcal R$ into two domino-tileable subsets.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

2025 USAJMO (Problems • Resources)
Preceded by
Problem 2 		Followed by
Problem 4
1 • 2 • 3 • 4 • 5 • 6
All USAJMO Problems and Solutions

These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. AMC Logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2025_USAJMO_Problems/Problem_3&oldid=245794"