how many ways, can this be done?
Consider a random walk where steps are decided based on coin tosses. A head is a positive step and a tail is a negative step. After 16 steps, the random walker finds himself at the same position as where he started.In how many ways, can this be done?
Number of combinations= N!/NH!NT!
Number of combinations=16!/(8!*8!)
Number of combinations=12870
PLACE THIS ORDER OR A SIMILAR ORDER WITH BEST NURSING TUTORS TODAY AND GET AN AMAZING DISCOUNT
The post how many ways, can this be done? appeared first on BEST NURSING TUTORS .