Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?

Re: compute paths in Pascal's triangle (aka Tartaglia's one)

by hdb (Monsignor)
on Mar 22, 2018 at 13:58 UTC ( #1211524=note: print w/replies, xml ) Need Help??

in reply to compute paths in Pascal's triangle (aka Tartaglia's one)

The property you mention is simple to prove: "the number in a specific tile is also the number of different shortest path from the top tile". In any path to a tile n-k, you have (n-k) (n minus k) moves left, and k moves right. Only the order of these moves determine the specific path. The number of possible permutations of (n-k) and k identical elements each is n! / k! / (n-k)! which is the number in the tile.

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1211524]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (4)
As of 2022-05-22 23:49 GMT
Find Nodes?
    Voting Booth?
    Do you prefer to work remotely?

    Results (81 votes). Check out past polls.