P = pascal(n)
P = pascal(n,1)
P = pascal(n,2)
P = pascal(___,classname)
P = pascal( returns the lower
triangular Cholesky factor (up to the signs of the columns) of the Pascal matrix.
P is involutary, that is, it is its own
P = pascal( returns a transposed and
permuted version of
pascal(n,1). In this case,
P is a cube root of the identity matrix.
P = pascal(___,
returns a matrix of class
classname using any of the input
argument combinations in previous syntaxes.
classname can be
Compute the fourth-order Pascal matrix.
A = pascal(4)
A = 1 1 1 1 1 2 3 4 1 3 6 10 1 4 10 20
Compute the lower triangular Cholesky factor of the third-order Pascal matrix, and verify it is involutary.
A = pascal(3,1)
A = 1 0 0 1 -1 0 1 -2 1
ans = 1 0 0 1 -1 0 1 -2 1
n— Matrix order
Matrix order, specified as a scalar, nonnegative integer.
classname— Matrix class
Matrix class, specified as either
Pascal’s triangle is a triangle formed by rows of numbers. The first row has entry
1. Each succeeding row is formed by adding adjacent entries
of the previous row, substituting a
0 where no adjacent entry
pascal function forms Pascal’s matrix by selecting
the portion of Pascal’s triangle that corresponds to the specified matrix
dimensions, as outlined in the graphic. The matrix outlined corresponds to the