From 2-D to 3-D

Geometry Level 5

In a cubical room in 3-D coordinate space a ball is projected from point ( 1 4 , 0 , 1 2 \frac { 1 }{ 4 } ,0,\frac { 1 }{ 2 } ) such that it collides with the room at ( 5 13 , 3 13 , 1 \frac { 5 }{ 13 } ,\frac { 3 }{ 13 } ,1 ) and bounces of the walls repeatedly till it strikes one of the corners of room. Find the number of collisions the ball made with walls of the room before the ball finally strikes a corner.

Details and assumptions

1) The coordinates of the corners of the room are (0,0,0) ,(1,0,0) ,(0,1,0) ,(0,0,1) ,(0,1,1) ,(1,0,1) ,(1,1,0) ,(1,1,1).

2) The room is gravity free .

3) All collisions with the walls of the room are elastic.

4) The ball and corners of the room are point sized i.e. ball must strike the corner exactly.No near cases must be considered.

5) While counting the number of collisions also count the first collision i.e. collision at ( 5 13 , 3 13 , 1 \frac { 5 }{ 13 } ,\frac { 3 }{ 13 } ,1 )

This problem is original and is inspired by This problem .


The answer is 9.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Ayush Garg
Mar 14, 2015

The problem which looks complicated can be solved easily by a specific approach which I found after solving Let`s play carrom.

Let`s assume that there are no walls and the ball is following a straight path instead of being reflected.

Also assume that there are infinite rooms,coordinates of whose corners are integers and they too have no walls!.

Now,when the ball strike corner of imaginary room then it will also strike corner of real room.

Here is an example to show my point.

So,the equation of line along which ball will travel will be given by joining

( 1 4 , 0 , 1 2 ) \left( \frac { 1 }{ 4 } ,0,\frac { 1 }{ 2 } \right) and ( 5 13 , 3 13 , 1 ) \left( \frac { 5 }{ 13 } ,\frac { 3 }{ 13 } ,1 \right)

x 1 4 7 = y 12 = z 1 2 26 = r ( s a y ) \frac { x-\frac { 1 }{ 4 } }{ 7 } =\frac { y }{ 12 } =\frac { z-\frac { 1 }{ 2 } }{ 26 } =r(say)

Now, only thing left to do is to find smallest integer coordinates which will be satisfied by line.

We have x=7r+ 1 4 \frac { 1 }{ 4 } , y=12r , z=26r+ 1 2 \frac { 1 }{ 2}

By finding smallest integer solution which satisfy above condition we`ll have r= 1 4 \frac { 1 }{ 4 } (It is easy to find try yourself)

\therefore Coordinates are (2,3,7) and number of collisions will be equal to number of planes crossed =

2 1 + 3 1 + 7 1 = 9 \boxed{2-1+3-1+7-1 =9} (since we do not have to count the corner in collision)

For those who are not convinced by above solution ,coordinates of points of collision are ( 5 13 , 3 13 , 1 ) , ( 17 26 , 9 13 , 0 ) , ( 5 6 , 1 , 2 3 ) , ( 12 13 , 11 13 , 1 ) , ( 1 , 5 7 , 5 7 ) \left( \frac { 5 }{ 13 } ,\frac { 3 }{ 13 } ,1 \right) ,\left( \frac { 17 }{ 26 } ,\frac { 9 }{ 13 } ,0 \right) ,\left( \frac { 5 }{ 6 } ,1,\frac { 2 }{ 3 } \right) ,\left( \frac { 12 }{ 13 } ,\frac { 11 }{ 13 } ,1 \right) ,\left( 1,\frac { 5 }{ 7 } ,\frac { 5 }{ 7 } \right) , ( 21 26 , 5 13 , 0 ) , ( 7 12 , 0 , 5 6 ) , ( 7 13 , 1 13 , 1 ) , ( 7 26 , 7 13 , 0 ) , ( 0 , 1 , 1 ) \left( \frac { 21 }{ 26 } ,\frac { 5 }{ 13 } ,0 \right) ,\left( \frac { 7 }{ 12 } ,0,\frac { 5 }{ 6 } \right) ,\left( \frac { 7 }{ 13 } ,\frac { 1 }{ 13 } ,1 \right) ,\left( \frac { 7 }{ 26 } ,\frac { 7 }{ 13 } ,0 \right) ,\left( 0,1,1 \right)

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...