Difference between revisions of "2025 IMO Problems/Problem 6"
| Line 5: | Line 5: | ||
==Video Solution== | ==Video Solution== | ||
https://www.youtube.com/watch?v=fgXg9CdCDcs | https://www.youtube.com/watch?v=fgXg9CdCDcs | ||
| + | |||
| + | ==See Also== | ||
| + | * [[2025 IMO]] | ||
| + | * [[IMO Problems and Solutions, with authors]] | ||
| + | * [[Mathematics competitions resources]] | ||
| + | {{IMO box|year=2025|num-b=5|after=Last Question}} | ||
Latest revision as of 19:55, 19 July 2025
Consider a 2025 x 2025 grid of unit squares. Matlida wishes to place on the grid some rectangular tiles, possibly of different sizes, such that each side of every tile lies on a grid line and every unit square is covered by at most one tile.
Determine the minimum number of tiles Matlida needs to place so that each row and each column of the grid has exactly one unit square that is not covered by any tile.
Video Solution
https://www.youtube.com/watch?v=fgXg9CdCDcs
See Also
| 2025 IMO (Problems) • Resources | ||
| Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Question |
| All IMO Problems and Solutions | ||
