Consider two point-like balls with masses m and M placed as in the figure, where the larger ball is given an initial velocity towards the smaller ball. The balls will move along the positive x -axis and collide with each other at every encounter, with the smaller ball repeatedly reflecting off of the vertical wall located at x = 0 .
If M = 1 0 8 m , what is the total number of hits in the system—the sum of the ball-ball collisions and the ball-wall collisions?
Assume that each collision is absolutely elastic and that gravitational forces are negligible.
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.
What is the answer after all?!
@Daniel Xiang , can you tell some books for Physics from where you take these good problems?
Can you explain it more extensively? Thanks
This problem is based on a paper authored by Gregory Galperin, "Playing Pool With π (The number π from a billiard point of view)", REGULAR AND CHAOTIC DYNAMICS, V. 8, №4, 2003. It can be found here http://www.turpion.org/php/paper.phtml?journal id=rd&paper id=252 or elsewhere on the WEB. (The Figure presented in the problem is cut-and-paste from Figure 1 of the paper. We may have a copyright problem here.)
Log in to reply
Thanks for the precisions! The link appears not to be working, a better one is this one , found on the same website.
The number of collisions is always an odd number (except if there is an extreme coincidence with the velocities). Therefore Π ( 2 ) = 3 1 4 must be incorrect. Indeed, for M=10000m a simple computer program yields 313 collisions.
Log in to reply
This is not true. In the notation of my solution to your posted problem, there will be n ball-ball collisions if ( 2 n − 1 ) α < π ≤ ( 2 n + 1 ) π where tan α = M m . In the subcase that 2 n α < π ≤ ( 2 n + 1 ) π , the m particle will hit the wall, but not the M particle after the n th ball-ball collision, so that there will be 2 n collisions altogether.
As a concrete example, suppose that m = 4 M , so that tan α = 2 . Then 3 1 π < α < 2 1 π , so 2 α < π < 3 α , and my formula says that there should be 2 collisions. Before the first collision, the M particle has velocity v , and the m particle has velocity 0 , towards the wall. After the first ball-ball collision, the M particle has velocity − 5 3 v , and the m particle has velocity 5 2 v , towards the wall.. After the ball-wall collision, the particles have velocities − 5 3 v , − 5 2 v towards the wall, and so the m particle will not catch up with the M particle as it heads away from the wall. There have been exactly 2 collisions.
After the final ball-ball collision, the M particle will always be headed away from the wall (since ( 2 n + 1 ) α ≥ π , 2 n α > 2 1 π , and so cos 2 n α < 0 ). The m particle might have velocity away from the wall (and therefore not hit the wall again), but it might have velocity towards the wall, and hit the wall, but not bounce back fast enough to catch the M particle.
Log in to reply
You are right, my sweeping statement is not true.
Referring to my solution to what is basically the same problem , there will be a total of n collisions (either ball-ball or ball-wall) provided that n α < π ≤ ( n + 1 ) α where tan α = M m . In this case α = tan − 1 1 0 − 4 and α π is not an integer, and so the number of collisions is ⌊ α π ⌋ = 3 1 4 1 5 .
Problem Loading...
Note Loading...
Set Loading...
The number of hits in the system actually has a very interesting connection with π .
Let Π ( n ) denote the number of hits in the system if
M = 1 0 0 n m
then Π ( 0 ) = 3 , Π ( 1 ) = 3 1 , Π ( 2 ) = 3 1 4 , Π ( 3 ) = 3 1 4 1 , Π ( 4 ) = 3 1 4 1 5 , and so on.
The number of hits coincide with the first n + 1 decimal digits of π