Difference between revisions of "TDSM 5.17"
From The Data Science Design Manual Wikia
Ouyangzhibo (talk | contribs) |
|||
| Line 1: | Line 1: | ||
If the ant can move without any restriction <math> \Rightarrow </math> There are <math>2^{2n}</math> posibilities it can move. | If the ant can move without any restriction <math> \Rightarrow </math> There are <math>2^{2n}</math> posibilities it can move. | ||
| − | The ant returns to its starting points after <math>2n</math> steps <math>\Rightarrow</math> It has to move <math>n</math> steps up and <math>n</math> steps down <math>\Rightarrow</math> There are <math>C^{ | + | The ant returns to its starting points after <math>2n</math> steps <math>\Rightarrow</math> It has to move <math>n</math> steps up and <math>n</math> steps down <math>\Rightarrow</math> There are <math>C^{n}_{2n}</math> posibilities it can move. |
| − | <math>\Rightarrow</math> The posibility that the ant returns to its starting points after <math>2n</math> steps is <math>\frac{C^{ | + | <math>\Rightarrow</math> The posibility that the ant returns to its starting points after <math>2n</math> steps is <math>\frac{C^{n}_{2n}}{4^n}</math> |
Latest revision as of 21:39, 11 December 2017
If the ant can move without any restriction ⇒ There are 22n posibilities it can move.
The ant returns to its starting points after 2n steps ⇒ It has to move n steps up and n steps down ⇒ There are Cn2n posibilities it can move.
⇒ The posibility that the ant returns to its starting points after 2n steps is Cn2n4n
