Enough information?

In the diagram below, a SuperBall is continuously bouncing down a gigantic staircase numbered 1, 2, 3,..., where

  • the (vertical) rise and (horizontal) run of each step are both 1 meter long, and
  • the rise and run segments are perpendicular to each other.

It is launched at the midpoint of Step 1, the highest step of the staircase, then lands on the midpoint of Step 3, and then on the midpoint of Step 6, and so on. For each bounce, the ball approaches the same maximum height h max h_{\text{max}} .

Will the ball land exactly on the midpoint of Step 10?


Details and Assumptions:

  • Neglect air resistance, drag, and friction.
  • Assume that the staircase is positioned upright, as shown in the diagram.

Extra: Prove or disprove the numbered step pattern.

Yes No Not enough information

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

Michael Huang
Sep 27, 2017

Set the initial position of the superball be at the origin on the Cartesian plane. The set of projectile equations is h ( t ) = 1 2 g t 2 + v sin θ t d ( t ) = v cos θ t \begin{array}{rl} h(t) &= -\dfrac{1}{2}gt^2 + v\sin\theta t\\ d(t) &= v\cos\theta t \end{array} where θ \theta denotes the launch angle, g g the gravity and v v the launch velocity. Combining these equations altogether, we have h ( d ) = 1 2 g d 2 v 2 cos 2 θ + d tan θ h(d) = -\dfrac{1}{2} \dfrac{gd^2}{v^2\cos^2 \theta} + d\tan\theta


Bouncing Function


For each Step n n of the staircase, the position of its midpoint is ( n 1 , n + 1 ) (n - 1, n + 1) . At Step 3 3 and 6 6 , their respective positions are ( 2 , 2 ) (2,-2) and ( 5 , 5 ) (5,-5) . Since there is no change in the ball's path, we can assume that the ball travels in the similar manner for each bounce. In this case, we can use the above function to construct the piecewise function of the bounces.

For the first bounce, we have the graph of h ( d ) h(d) bounded at 0 d 2 0 \leq d \leq 2 . Substituting the first coordinates ( 2 , 2 ) (2,-2) , we have 1 + tan θ = g v 2 cos 2 θ 1 + \tan\theta = \dfrac{g}{v^2 \cos^2 \theta} For the second bounce, we determine another part of the function by symmetry about d = d 1 f = 2 d = d_{1f} = 2 , which is the endpoint of the first bounce. Since the reflection of h ( d ) h(d) about the vertical is h ( 2 d 1 f d ) h(2d_{1f} - d) , then the equation of the second bounce is h ( d ) = h ( 4 d ) = 1 2 g ( 4 d ) 2 v 2 cos 2 θ + ( 4 d ) tan θ h^{*}(d) = h(4 - d) = -\dfrac{1}{2}\dfrac{g(4 - d)^2}{v^2\cos^2\theta} + (4 - d)\tan\theta where if h ( 5 ) = 5 h^{*}(5) = -5 , 5 = 1 2 g v 2 cos 2 θ tan θ 5 = 1 2 ( 1 + tan θ ) tan θ \begin{array}{rl} -5 &= -\dfrac{1}{2}\dfrac{g}{v^2\cos^2\theta} - \tan\theta\\ -5 &= -\dfrac{1}{2}\left(1 + \tan\theta\right) - \tan\theta \end{array} So tan θ = 3 \tan\theta = 3 , where 0 < θ < 9 0 0^{\circ} < \theta < 90^{\circ} . With some algebra and trigonometry, we discover that the equations of two first bounces are h ( d ) = { 2 d 2 + 3 d 0 d 2 2 ( 4 d ) 2 + 3 ( 4 d ) 2 < d 5 h(d) = \left\{ \begin{array}{rl} -2d^2 + 3d & 0 \leq d \leq 2\\ -2(4 - d)^2 + 3(4 - d) & 2 < d \leq 5 \end{array} \right. where the endpoint of the second bounce is exactly at ( 5 , 5 ) (5,-5) . By the similar method, the equation of the third bounce is h ( d ) = 2 ( d 6 ) 2 + 3 ( d 6 ) h^{**}(d) = -2(d - 6)^2 + 3(d - 6) where it is bounded at 5 < d 9 5 < d \leq 9 . Since h ( 9 ) = 9 h^{**}(9) = -9 , this shows that the ball lands on the midpoint of Step 10 \boxed{\text{lands on the midpoint of Step 10}} .

Note: The equation verifies that since the ball misses Step 2 2 and instead lands on the midpoint of Step 3 3 , there is no calculation conflict in missing any step.


Bonus


Since the reflection about the vertical affects the values of d d , the general equation of the bounce is h ( D b ) = 2 ( D b ) 2 + 3 D b h\left(D_b\right) = -2\left(D_b\right)^2 + 3D_b where for each positive bounce integer b b ,

  • the bounds are b ( b + 1 ) 2 2 d ( b + 1 ) ( b + 2 ) 2 2 \frac{b(b + 1) - 2}{2} \leq d \leq \frac{(b + 1)(b + 2) - 2}{2}
  • D b = d ( 1 ) b 1 + n = 1 b ( 1 ) n ( n 2 + n 2 ) D_b = d(-1)^{b - 1} + \sum\limits_{n=1}^b (-1)^n \left(n^2 + n - 2\right) is the recurrence relation

The numbered step pattern is that

For each bounce integer b 2 b \geq 2 , given that the initial position is at the midpoint of Step 1 1 , the ball exactly lands on the midpoint of Step b ( b + 1 ) 2 \frac{b(b + 1)}{2} .

The proof, which involves mathematical induction , is left for the readers to work out.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...