A new way of counting n^ m

DOI10.1016/0898-1221(95)00060-CMaRDI QIDQ1903757zbMATH OpenFDO

Authors Young-Ching Deng, Yue-Li Wang, Jou-Ming Chang

Publication date 1 February 1996

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(95)00060-C

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

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\).

Recommendations

Cites work

Cited in

(9)

This page was built for publication: A new way of counting \(n^ m\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903757)