Pascal's triangle

Pascal's triangle
Name	Pascal's triangle
Field	Mathematics
Introduced	Ancient mathematics
Notable	Blaise Pascal, Yang Hui, Omar Khayyam

Pascal's triangle

Pascal's triangle is a triangular array of binomial coefficients constructed so each entry is the sum of the two directly above. It appears across algebra, combinatorics, number theory and geometry and connects to figures such as Blaise Pascal, Isaac Newton, Pierre de Fermat, Omar Khayyam and Yang Hui. The array encodes coefficients for binomial expansions, combinatorial counts, and fractal-like patterns linked to primes and modular arithmetic.

Definition and construction

Each row of the triangle starts and ends with 1 and interior entries are obtained by summing the two neighboring entries from the previous row. The nth row (starting with n = 0) lists coefficients that appear in the expansion studied by Isaac Newton and used by Gottfried Wilhelm Leibniz in series manipulations; combinatorial interpretations were central to work by Blaise Pascal and Pierre de Fermat. Construction is often illustrated in presentations associated with École Polytechnique lectures and educational texts from institutions such as University of Cambridge, University of Paris, and Princeton University.

Algebraic properties and identities

Rows correspond to coefficients in the binomial theorem introduced by Isaac Newton and applied in works by Pierre de Fermat; the kth entry in row n equals n choose k, given by factorials attributed to notation popularized by Adrien-Marie Legendre and used by scholars at École Normale Supérieure. The triangle satisfies recurrence relations used in identities by Leonhard Euler and Joseph-Louis Lagrange; generating functions connected to the triangle appear in research at University of Göttingen and in treatments by Augustin-Louis Cauchy. Symmetry of rows relates to involutive maps studied by Évariste Galois and convolution identities connect to results from Srinivasa Ramanujan and Carl Friedrich Gauss. Rows sum to powers of two, a fact used in combinatorial proofs from seminars at Harvard University and Massachusetts Institute of Technology.

Combinatorial interpretations

Entries count combinations central to problems addressed by Blaise Pascal and Pierre de Fermat; the kth entry in row n equals the number of k-element subsets of an n-element set, a concept used in correspondence involving Christiaan Huygens and in applications at Royal Society. The triangle encodes paths on lattice grids studied in work by George Pólya and appears in enumerative problems pursued at Institute for Advanced Study. Connections to Catalan numbers and ballot problems link to research by Dénes Kőnig and William Feller; combinatorial proofs using the triangle appear in curricula at University of Oxford and Columbia University.

Number-theoretic properties and patterns

Prime-related patterns such as Lucas's theorem and Sierpiński-like fractals in mod 2 rows were investigated following correspondence between Édouard Lucas and contemporaries; divisibility properties feature in work by Srinivasa Ramanujan and Bernhard Riemann's circle-method descendants. The triangle exhibits periodicity and p-adic patterns studied in publications from University of Cambridge and Princeton University; triangular entries reveal arithmetic progressions and polynomial congruences used in research by Andrew Wiles and Gerd Faltings influences. Patterns such as central binomial coefficients relate to estimates by Paul Erdős and analytic techniques from Atle Selberg.

Applications and extensions

Applications include probability computations in studies by Thomas Bayes, polynomial expansions central to Isaac Newton's calculus, and moments analysis in statistical work influenced by Karl Pearson. Extensions include multinomial arrays used in combinatorics curricula at Massachusetts Institute of Technology and generalized triangles arising in studies by Émile Borel and John von Neumann. Connections to orthogonal polynomials and special functions reference contributions from Sophie Germain-era explorations, Niels Henrik Abel's theory, and later work at Institute for Advanced Study and California Institute of Technology. Computational implementations and algorithmic uses appear in resources at Bell Labs and AT&T research divisions.

Historical development and notation

Triangular arrangements equivalent to the modern triangle appeared in works by Yang Hui in China, Omar Khayyam in Persia, and in manuscripts from Indian mathematicians such as those associated with Brahmagupta; later European development involved Blaise Pascal and correspondence between Pierre de Fermat and Blaise Pascal. Notation for binomial coefficients evolved through contributions by Abraham de Moivre, Adrien-Marie Legendre, and standardization in mathematical texts from École Polytechnique and universities like University of Göttingen and University of Paris. The triangle's role in probability theory, combinatorics, and algebra ensured its presence in curricula at University of Cambridge, Harvard University, and Princeton University from the 18th century onward.

Category:Mathematics