text: All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
   perplexus dot info
  
   Rack-O (Posted on 2006-10-10)
  Take a deck of cards labeled 1-60. Shuffle well and flip over the first 10 cards in a row from left to right.
  
  Let x represent the number of cards in a row from the left that are in ascending order.
  
  For example if the cards were 3 15 22 59 40 7 19 30 33 34 then x=4. The streak ends with the 59 because 40 is less.
  
  Find a formula for p(x), the probability the first x cards are in ascending order and card x+1 is lower than card x, where x={1,...,10}
  
  Generalize: For a deck of c cards labeled 1 to c and flipping over a row of n cards. Find a formula for p(x) where x={1,...,n}
  
   See The Solution Submitted by Jer Rating: 4.6667 (3 votes)
  
  Comments: ( Back to comment list | You must be logged in to post comments.)
   Solution | Comment 1 of 4
  I'll just give the general solution:
  
  p(x)=x/(x+1)!
  
  why?
  
  suppose you asked for the probability that the first x+1 cards were in order.  That would be 1/(x+1)!.  Now, for each of those, take one of the first x cards and move it to the last position.  Those are all of the possibilities for first x in order and next one lower given some set of x+1 cards to start.  Thus, x/(x+1)!
  
   Posted by Joel on 2006-10-10 12:46:53
  
   Search: Search body:
  Forums (0)
metadata: {"found_math": false, "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": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}