Grinstead-Snell-Probability · Problem 36

Combinatorics

Mathematics · combinations-sample-space

Problem

Let jj and nn be positive integers, with j≤nj \leq n. An experiment consists of choosing, at random, a jj-tuple of positive integers whose sum is at most nn. ((a)) Find the size of the sample space. Hint: Consider nn indistinguishable balls placed in a row. Place jj markers between consecutive pairs of balls, with no two markers between the same pair of balls. (We also allow one of the nn markers to be placed at the end of the row of balls.) Show that there is a 1-1 correspondence between the set of possible positions for the markers and the set of jj-tuples whose size we are trying to count. ((b)) Find the probability that the jj-tuple selected contains at least one 1.

Related theory

Browse the problem library