Answer:
<h3>d. 1, 2, 4, 8, 16, 32</h3>
Step-by-step explanation:
Pascal's triangle is the a triangular array of binomials coefficient of equations of each degree.
<h3>n=0 1 </h3><h3>n=1 1 1</h3><h3>n=2 1 2 1</h3><h3>n=3 1 3 3 1</h3><h3>n=4 1 4 6 4 1</h3><h3>n=5 1 5 10 10 5 1</h3><h3 />
An easy way to list Pacsal's triangles is the number below Two numbers is the sum of those two numbers.
for example look at the number 10 at the triangle it is actually the sum of Two numbers above it 6 and 4
after listing pascals triangle we can calculate sum as 1,2,4,8,16,32
<u>Method 2</u>
Sum of numbers in nth row is ![2^{n}](https://tex.z-dn.net/?f=2%5E%7Bn%7D)
so sums are
,
,
,
,
,![2^{5}](https://tex.z-dn.net/?f=2%5E%7B5%7D)
or, 1,2,4,8,16,32