Jump to content

Pascal matrix

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Peskydan (talk | contribs) at 04:04, 8 November 2006 (The beginnings of an article which will grow as I (and hopefully you!) have time...). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The Pascal matrix is an infinite matrix containing the binomial coefficients as its elements. There are 3 ways this can be achieved - either as an upper-triangular matrix, a lower-triangular matrix, or as a symmetric matrix. The 5×5 truncations of these are shown below.


Upper triangular: lower triangular: symmetric:


These matrices have the pleasing relationship Sn = LnUn. From this it is easily seen that all three matrices have determinant 1, as the determinant of a triangular matrix is simply the product of its diagonal elements, which are all 1 for both Ln and Un.


See also

References

  • G. S. Call and D. J. Velleman, Pascal's matrices, American Mathematical Monthly 100 (April 1993) pp 372-376.