Can a problem like this be solved exactly and without fuzzy computer logic/approximations?

No.12707062 ViewReplyOriginalReport
If there is a massless sphere in total vacuum with 10 identical spheres, differentiated only by a massless numeric identifier (e.g. 1, 2, 3, 4,..., n) evenly spaced throughout the sphere, and one sphere is removed at random (no bias to position, timing, or translation within the outer sphere), how many times would the single sphere removal at random have to occur until the probability of removing a given sphere is precise and exact?