Kaip apskaičiuoti Pascal's Triangle

Kas yra Pascal's Triangle?

Pascal's Triangle is a triangular array where each number is the sum of the two numbers directly above it. It encodes binomial coefficients, combinatorics, and the coefficients of binomial expansions. Named after Blaise Pascal (1623–1662) though known much earlier.

Žingsnis po žingsnio vadovas

1. 1Row 0: 1 | Row 1: 1, 1 | Row 2: 1, 2, 1 | Row 3: 1, 3, 3, 1
2. 2Entry C(n,k) = entry in row n, position k = n! / (k!(n−k)!)
3. 3Binomial expansion: (a+b)^n coefficients are row n of the triangle
4. 4Sum of row n = 2^n; diagonal sums give Fibonacci numbers

Worked Examples