Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?

Re: An Apology for Puncish

by BrowserUk (Pope)
on Jan 27, 2009 at 22:16 UTC ( #739368=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download

    Log In?

    What's my password?
    Create A New User
    Node Status?
    node history
    Node Type: note [id://739368]
    [Discipulus]: karl you says the same of my mom: in your place I'd been
    [Discipulus]: preoccupied.. ;=)
    Discipulus stopped with turkisk spices anyway.. but better hashes than arrays!
    [oiskuu]: Discipulus, from the edge or from the top?
    [Discipulus]: oiskuu from the top aka 0-0 coords
    [LanX]: edge or node?
    [oiskuu]: from each height difference, there's a fixed number of "moves right" - "moves left". So it's a number of combinations.
    [Discipulus]: I already know how much distinct paths exists but to demonstrate the property i want to have them all
    [oiskuu]: ie C(n, k); where n is height difference, k is position in the line

    How do I use this? | Other CB clients
    Other Users?
    Others making s'mores by the fire in the courtyard of the Monastery: (11)
    As of 2018-03-19 11:01 GMT
    Find Nodes?
      Voting Booth?
      When I think of a mole I think of:

      Results (239 votes). Check out past polls.