text: # Probability of Drawing Enough Numbers (Combinatorics)
  
  Maybe you could help me with the following problem.
  
  Given a series of incremental numbers that is split in two, so $$s = 1, 2, 3, ..., n_1$$, $$n_1 + 1, n_1 +2 ,..., n_2$$. Also given a integer number $$0 < x < n_2$$.
  
  Now take a random combination of $$x$$ numbers out of $$s$$ (so without replacement and order does not matter).
  
  Two questions:
  
  • What is the probability that the random combination contains all numbers between and including $$1$$ and $$n_1$$? The combination might include numbers larger than $$n_1$$.
  • What is the probability that the random combination contains all numbers between and including $$n_1 + 1$$ and $$n_2$$? The combination might include numbers smaller than or equal to $$n_1$$.
  
  Both probabilities would be ideally expressed in terms of $$n_1, n_2$$ and $$x$$.
  
  • How many ways of choosing $$x$$ numbers without replacement from $$n_2$$ numbers
  • How many ways of choosing $$n_1$$ numbers without replacement from $$n_1$$ numbers and $$x-n_1$$ numbers without replacement from $$n_2-n_1$$ other numbers
  • The answer to your second question is the same as the answer to your first but replacing $$n_1$$ by $$n_2-n_1$$
metadata: {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 21, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}