Shamster
Reputation
Next privilege 250 Rep.
 May 29 awarded Supporter May 28 comment Using a markov chain to calculate the expected value of conditional/constrained choices (TopCoder PancakeStack) By the time we've made the $j^{th}$ selection, wouldn't we have fewer than N pancakes from which to choose? May 28 comment Using a markov chain to calculate the expected value of conditional/constrained choices (TopCoder PancakeStack) Thanks for clarifying. One more: there is the constraint that every pancake chosen before the $j^{th}$ is larger than it, and also chosen in a descending order. I'm still not quite understanding how the descending order constraint is upheld here. May 28 comment Using a markov chain to calculate the expected value of conditional/constrained choices (TopCoder PancakeStack) Thanks for the detailed answer! I followed along until the 2nd-to-last line where a factor of $\frac 1 N$ snuck in somehow. Where did that come from? May 28 awarded Scholar May 28 accepted Using a markov chain to calculate the expected value of conditional/constrained choices (TopCoder PancakeStack) May 28 awarded Student May 28 asked Using a markov chain to calculate the expected value of conditional/constrained choices (TopCoder PancakeStack) May 15 revised How many ways to win this ternary row-game? edited title May 15 answered How many ways to win this ternary row-game? May 13 revised How many ways to win this ternary row-game? edited title May 13 awarded Editor May 13 revised How many ways to win this ternary row-game? Formatting MathJax equations May 13 asked How many ways to win this ternary row-game? Sep 2 awarded Teacher Sep 2 answered Find the Frequency Components of a Time Series Graph