Difference between revisions of "2020 USAMO Problems/Problem 2"

(make boilerplate page)
 
m (Problem: bulleted list)
Line 2: Line 2:
 
An empty <math>2020 \times 2020 \times 2020</math> cube is given, and a <math>2020 \times 2020</math> grid of square unit cells is drawn on each of its six faces. A beam is a <math>1 \times 1 \times 2020</math> rectangular prism. Several beams are placed inside the cube subject to the following conditions:
 
An empty <math>2020 \times 2020 \times 2020</math> cube is given, and a <math>2020 \times 2020</math> grid of square unit cells is drawn on each of its six faces. A beam is a <math>1 \times 1 \times 2020</math> rectangular prism. Several beams are placed inside the cube subject to the following conditions:
  
<math>\bullet</math> The two <math>1 \times 1</math> faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are <math>3 \cdot 2020^2</math> possible positions for a beam.)
+
*The two <math>1 \times 1</math> faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are <math>3 \cdot 2020^2</math> possible positions for a beam.)
 
+
*No two beams have intersecting interiors.
<math>\bullet</math> No two beams have intersecting interiors.
+
*The interiors of each of the four <math>1 \times 2020</math> faces of each beam touch either a face of the cube or the interior of the face of another beam.
 
 
<math>\bullet</math> The interiors of each of the four <math>1 \times 2020</math> 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?
 
What is the smallest positive number of beams that can be placed to satisfy these conditions?

Revision as of 09:06, 31 July 2023

Problem

An empty $2020 \times 2020 \times 2020$ cube is given, and a $2020 \times 2020$ grid of square unit cells is drawn on each of its six faces. A beam is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions:

  • The two $1 \times 1$ faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are $3 \cdot 2020^2$ possible positions for a beam.)
  • No two beams have intersecting interiors.
  • The interiors of each of the four $1 \times 2020$ 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 (ProblemsResources)
Preceded by
Problem 1
Followed by
Problem 3
1 2 3 4 5
All USAMO Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png