A rabbit lives on an ordinary chessboard 8x8. The rabbit located over the cell (1.1) (lower left, the upper right corner is (8.8), the lower right corner is (8,1)). At any time the rabbit jumps either to the right or upwards.(adsbygoogle = window.adsbygoogle || []).push({});

How many different ways can move the rabbit to reach the cell (3.4)?

I have a problem here.I think all the moves in the chessboard is (64 C 8) like (n C k) combinations, but i can not think how to move from the cell (1.1) to (3.4) maybe someone can give me any suggestion how?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Combinatorial question

Loading...

Similar Threads - Combinatorial question | Date |
---|---|

Combinatorial algorithm | May 22, 2015 |

Combinatorial question: permutation, binomial coefficient | Mar 4, 2013 |

Combinatorial Question | Sep 10, 2012 |

Question about probabilistic combinatorial maximization | Jul 28, 2011 |

Help for combinatorial question? | Mar 18, 2009 |

**Physics Forums - The Fusion of Science and Community**