Is there a concise, easily calculable way to count the sum of all the paths from the lower left corner of a square of integer size to the upper right corner where you only move up or right in steps of 1 unit, PLUS all the partial paths? i.e. if you have a city with roads in a 10x10 grid (100 intersections/corners) how many shortest paths are there from one corner of the grid to any other intersection or corner on the grid?(adsbygoogle = window.adsbygoogle || []).push({});

**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!

# Counting paths

Loading...

Similar Threads - Counting paths | Date |
---|---|

Counting on your fingers | Jun 1, 2017 |

What Does Your Post and Like Count Say About You? | Dec 14, 2016 |

News Terrorist Attack in France 84 dead and counting | Jul 14, 2016 |

Einstein quote? "That would be double counting." | Apr 16, 2016 |

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