[math-fun] partitions to pascal

The number of ordered partitions of n into exactly k parts corresponds to Pascal's triangle. This can be seen although not immediately proved by the PT property that each entry is the partial sum of the NE-diagonal beginning at it's NW predecessor, and with a simple transform. Jon Perry perry@globalnet.co.uk http://www.users.globalnet.co.uk/~perry/maths/ http://www.users.globalnet.co.uk/~perry/DIVMenu/ BrainBench MVP for HTML and JavaScript http://www.brainbench.com