Difference between revisions of "2020 USAMO Problems/Problem 2"
m (→Problem: bulleted list) |
(→Solution: newbox) |
||
Line 11: | Line 11: | ||
{{Solution}} | {{Solution}} | ||
− | {{USAMO | + | {{USAMO newbox|year=2020|num-b=1|num-a=3}} |
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 09:15, 31 July 2023
Problem
An empty cube is given, and a grid of square unit cells is drawn on each of its six faces. A beam is a rectangular prism. Several beams are placed inside the cube subject to the following conditions:
- The two faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are possible positions for a beam.)
- No two beams have intersecting interiors.
- The interiors of each of the four faces of each beam touch either a face of the cube or the interior of the face of another beam.
What is the smallest positive number of beams that can be placed to satisfy these conditions?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
2020 USAMO (Problems • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.