Balls and vase problem

From Wikipedia, the free encyclopedia

The balls and vase problem (also known as the Ross-Littlewood paradox or the ping pong ball problem) is a hypothetical problem in abstract mathematics and logic designed to illustrate the seemingly paradoxical, or at least non-intuitive, nature of infinity.

The problem starts with an empty vase and an infinite supply of balls at a starting time before noon. At each step in the procedure, balls are added and removed from the vase. The question is then posed: How many balls are in the vase at noon?

At each step, balls are inserted into and removed from the vase in a particular order:

  • In the first step, ten balls (numbered 1 through 10) are added to the vase, and then the first ball (numbered 1) is removed from the vase.
  • At each subsequent step, ten more balls are added to the vase (numbered 10(n−1)+1 through 10(n−1)+10 at step n), and then the lowest numbered ball (n) is removed from the vase.

As part of the problem statement, it is assumed that an infinite number of steps is performed. This is allowed by the following conditions:

  • The first step is performed at one minute before noon.
  • The second step is performed at 30 seconds before noon.
  • The third step is performed at 15 seconds before noon.
  • Each subsequent step n is performed at 2n+1 minutes before noon.

This guarantees that a countably infinite number of steps is performed by noon.

Contents

[edit] Solutions

Answers to the puzzle fall into several categories.

[edit] Vase is empty

Since by noon every ball n that is inserted into the vase (at step n10) is eventually removed in a subsequent step (step n), the vase is empty at noon.

[edit] Vase contains infinite balls

Since at each step ten balls are inserted but only one is removed, a net nine balls are added at every step before noon. Clearly, the number of balls (as a function of the step) equals 9 times the step: B = 9n for all n. So as n tends to infinity, B likewise diverges towards infinity. Therefore, the vase is filled with an infinite number of balls by noon.

[edit] Problem has no unique solution

Another approach considers the solution as the sum of the infinite series 10−1+10−1+10−1+…, which can be rearranged into the equivalent series 1−1+1−1+1−1+…. Such a sum is indeterminate, and according to Bolzano's Paradoxien des Unendlichen (Paradoxes of the Infinite), the series can be arranged to produce any integer sum we like. Therefore, the problem has no unique mathematical solution.

[edit] Answer to problem depends

Some people say that the number of balls that one ends up with depends on the order in which the balls are removed from the vase.

The following procedure outlines exactly how to get n balls remaining in the vase.

Let i denote the number of the operation currently taking place. Let n denote the desired final number of balls in the vase. for i = 1 to +infinity

  if i <= n, then remove the ball at position 2i.
  if i > n, then remove the ball at position n + i.

Clearly, the first (n) odd balls are not removed, while all balls greater than or equal to 2n are. Therefore, exactly n balls remain in the vase.

[edit] Problem is underspecified

Some point out that although the state of the balls and the vase is well-defined at every moment in time prior to noon, no conclusion can be made about any moment in time at or after noon. Thus, for all we know, at noon, the vase just magically disappears, or something else happens to it. But we don't know, as the problem statement says nothing about this. Hence, like the previous solution, this solution states that the problem is underspecified, but in a different way than the previous solution.

[edit] Problem is ill-formed

Finally, some people contend that the problem is ill-posed, requiring us to provide an answer to a question that has an inherent contradiction contained within it. To be precise, according to the problem statement, an infinite number of operations will be performed before noon, and then asks us about the state of affairs at noon. But, as in Zeno's paradox, if infinitely many operations have to take place (sequentially) before noon, then noon is a point in time that can never be reached. On the other hand, to ask us how many balls will be left at noon, is to assume that noon will be reached. Hence the contradiction.


[edit] References

  • "On Some Paradoxes of the Infinite", Victor Allis and Teunis Koetsier, The British Journal for the Philosophy of Science, v.42 n.2, Jun 1991, pp. 187-194
  • "Ross' Paradox Is an Impossible Super-Task", Jean Paul Van Bendegem, The British Journal for the Philosophy of Science, v.45 n.2, Jun 1994, pp. 743-748

[edit] See also

[edit] External links

This problem and its variations appear frequently on the sci.math newsgroup. A sampling of some of these discussions:

  • sci.math, infinity, 2005-08-03
  • sci.math, INFINITY Revisited, 2005-08-26
  • sci.math, Marble problem - put in 10 marbles, then remove 1, 2005-10-21
  • sci.math, Calculus XOR Probability, 2006-03-13
  • sci.math, Infinity: An interesting variant, 2006-03-18