A matrix approach to the binomial theorem
Motivated by the formula $x^n = \sum_{k=0}^n\left(n \atop k\right) (x - 1)^k$ we investigate factorizations of the lower triangular Toeplitz matrix with $(i, j)$th entry equal to $x^{i-j}$ via the Pascal matrix. In this way, a new computational approach to a generalization of the binomial theorem is...
Saved in:
| Date: | 2012 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics, NAS of Ukraine
2012
|
| Online Access: | https://umj.imath.kiev.ua/index.php/umj/article/view/2684 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Ukrains’kyi Matematychnyi Zhurnal |
| Download file: |  |
Institution
Ukrains’kyi Matematychnyi Zhurnal| Summary: | Motivated by the formula $x^n = \sum_{k=0}^n\left(n \atop k\right) (x - 1)^k$ we investigate factorizations of the lower triangular Toeplitz matrix
with $(i, j)$th entry equal to $x^{i-j}$ via the Pascal matrix. In this way, a new computational approach to a generalization of the binomial theorem is introduced.
Numerous combinatorial identities are obtained from these matrix relations. |
|---|