The extended Pascal triangle \(T_ m\) has as its entries in its \(n\)th row the \((m-1)n+1\) coefficients \(C_ m(n,k)\) of \(x^ k\), \(0\leq k\leq (m- 1)n\), in the expansion of \((1+ x+ x^ 2+\cdots + x^{m-1})^ n\). Properties of \(T_ m\) are discussed, as are some counting problems which give rise to it. As is observed in a postscript, a conjecture concerning \(T_ m\) and primality has recently been proved by \textit{W. W. Adams}, \textit{D. Shanks} and \textit{E. Liverance} [Bull. Inst. Comb. Appl. 3, 69-76 (1991)].
Recommendations
Cited in
(11)- Congruence properties for \(\mathrm{bi}^s\)nomial coefficients and like extended Ram and Kummer theorems under suitable hypothesis
- Spin multiplicities
- Bandwidth of the product of paths of the same length
- Singular solutions, repeated roots and completeness for higher-spin chains
- scientific article; zbMATH DE number 4101290 (Why is no real title available?)
- scientific article; zbMATH DE number 1890842 (Why is no real title available?)
- Large primes in generalized Pascal triangles
- scientific article; zbMATH DE number 6739378 (Why is no real title available?)
- On the composition of an arbitrary collection of \(\mathrm{SU}(2)\) spins: an enumerative combinatoric approach
- Chebyshev polynomials involved in the Householder's method for square roots
- A simple algorithm for trimmed multipoint evaluation
This page was built for publication: Extended Pascal Triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138061)