A new way of counting \(n^ m\) (Q1903757)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 825375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new way of counting \(n^ m\) |
scientific article; zbMATH DE number 825375 |
Statements
A new way of counting \(n^ m\) (English)
0 references
1 February 1996
0 references
This paper gives a combinatorial proof of the formula \[ n^m= \sum {m!\over k_1! k_2!\cdots k_{n- 1}!}, \] where \(m\) and \(n\) are positive integers, \(m\leq n\), and \(k_1, k_2,\dots, k_{n- 1}\) are nonnegative integers satisfying \(0\leq k_1+\cdots+ k_i\leq \min(i, m)\) for all \(i\).
0 references
0 references
0 references
0 references
0.8545628
0 references
0.8501212
0 references
0 references
