Hostname: page-component-7c8c6479df-ws8qp Total loading time: 0 Render date: 2024-03-28T21:26:53.819Z Has data issue: false hasContentIssue false

Permutations: Alternative Proofs of Elementary Formulas

Published online by Cambridge University Press:  20 January 2009

Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The number of the r-permutations of n things is the same as the number of ways of adding r things to a row which originally contains n - r other things.

For suppose the n letters A, B, C … N to be placed in a row, then each permutation consisting of r letters may be indicated by placing below those r letters in the row, the digits 1, 2, 3 … r, to indicate the order they have in the permutation. We may suppose zeros placed below all the remaining n - r letters. Thus it is clear that the number of the r-permutations of n things is the same as the number of ways in which r numbers can be added to a row originally containing n - r zeros.

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 1897