1 Row 0
1 1 Row 1
1 2 1 Row 2
1 3 3 1 Row 3
1 4 6 4 1 Row 4 etc.
Each number in the triangle is the sum of the two directly above it. The value of a row, if each entry is considered a decimal place, is a power of 11. So, in row 2, '1,2,1' becomes 112, and '1,5,10,10,5,1' (which will be in row 5) becomes, after carrying , 161,051 which is 115.
The Sierpinski Triangle
depends. If you start Pascals triangle with (1) or (1,1). The fifth row with then either be (1,4,6,4,1) or (1,5,10,10,5,1). The sums of which are respectively 16 and 32.
Fibonacci lived about 400 years before Pascal did.
Omar Khayyam discovered Pascal's triangle.
The number of odd numbers in the Nth row of Pascal's triangle is equal to 2^n, where n is the number of 1's in the binary form of the N. In this case, 100 in binary is 1100100, so there are 8 odd numbers in the 100th row of Pascal's triangle.
pascals triangle is used to solve math problems that have chance of 2 different outcomes, such as flipping a coin
Pascal's triangle
pascal
The Sierpinski Triangle
in the 11th century...
(a+b)7
35
1,4,6,4,1
Blaise Pascal.
Pascal didn't invent pascals triangle, he just made It popular. A Chinese mathematician invented it in about 1015.
The expanded binomial is another name for Pascal's triangle.
No, use java.