Understand the problem

We have a rectangle whose sides are mirrors. A ray of light enters from one of vertices of the rectangle and after being reflected several times, exits via the vertex opposite to the initial one. Prove that at some point of time, the ray passed through the centre of rectangle (Intersection of the diagonals.)

Source of the problem
Iranian Mathematical Olympiad 2019 (second round)
Topic
Geometry/Combinatorics

Difficulty Level
Hard
Comments
It is interesting to note how Olympiads reflect the current state of mathematical research. This is not unexpected, because olympiad problems usually originate from elementary corollaries of advanced Mathematics. This particular problem has to do with the problem of billiards in the field of Dynamical Systems. The interested reader can learn more here.

Start with hints

Do you really need a hint? Try it first!

Instead of reflecting the ray and keeping the rectangle fixed, reflect the rectangle and keep the ray fixed.  

Following hint 1, you will get a grid of rectangles and a straight line representing the path of light. If this straight line passes through one of the reflections of the opposite vertex, then in our original representation it has to pass through the opposite vertex. Similarly, if it passes through one of the reflections of the centre then in the original representation, it has to pass through the centre.

Show that the reflections of (a,b) are of the form ((2m-1)a,(2n-1)b). Also, the reflections of the centre (a/2,b/2) are of the form ((p+1/2)a,(q+1/2)b.
Suppose that the line indeed passes through a reflection of the opposite vertex. Then it is of the form x(t)=(2m+1)at, y(t)=(2n+1)bt. Taking t=\frac{1}{2}, we see that it passes through ((m+1/2)a,(n+1/2)b), which is a reflection of the centre.

Watch the video (Coming Soon)

Connected Program at Cheenta

Math Olympiad Program

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year. Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.

Similar Problems

Area of Trapezoid | AMC 10A, 2018 | Problem 9

Try this beautiful problem from AMC 10A, 2018 based on area of trapezoid. You may use sequential hints to solve the problem.

Problem on Series and Sequences | SMO, 2012 | Problem 23

Try this beautiful problem from Singapore Mathematics Olympiad, 2012 based on Series and Sequences. You may use sequential hints to solve the problem.

Theory of Equations | AIME 2015 | Question 10

Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2015 based on Theory of Equations.

Trigonometry Problem | AIME 2015 | Question 13

Try this beautiful problem number 13 from the American Invitational Mathematics Examination, AIME, 2015 based on Trigonometry.

Problem from Probability | AMC 8, 2004 | Problem no. 21

Try this beautiful problem from Probability from AMC 8, 2004, Problem 21.You may use sequential hints to solve the problem.

Smallest Perimeter of Triangle | AIME 2015 | Question 11

Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2015 based on Smallest Perimeter of Triangle.

Intersection of two Squares | AMC 8, 2004 | Problem 25

Try this beautiful problem from Geometry based on Intersection of two Squares AMC-8, 2004,Problem-25. You may use sequential hints to solve the problem.

Probability | AMC 8, 2004 | Problem no. 22

Try this beautiful problem from Probability from AMC-8, 2004 Problem 22. You may use sequential hints to solve the problem.

Area of Rectangle Problem | AMC 8, 2004 | Problem 24

Try this beautiful problem from GeometryAMC-8, 2004 ,Problem-24, based on area of Rectangle. You may use sequential hints to solve the problem.

Radius of the Circle | AMC-8, 2005 | Problem 25

Try this beautiful problem from Geometry:Radius of the Circle from AMC-8(2005). You may use sequential hints to solve the problem