Ask your own question, for FREE!
Mathematics 19 Online
OpenStudy (anonymous):

Predict the sum of the entries in row n of Pascal’s triangle.

OpenStudy (anonymous):

Does this make sense: \[\sum Tn= 2 \sum Tn-1\]

OpenStudy (anonymous):

What I was trying to get a with that formula was to get the sum of the nth row, you simply multiply the sum of the previous row by 2.

OpenStudy (aum):

Is it \[ \sum T_n= 2 \sum T_{n-1} \]

OpenStudy (anonymous):

yes, so that makes sense right?

OpenStudy (aum):

If the first row is 1, then the sums of subsequent rows will be 2, 4, 8, .... The sum for the nth row will be \(\large 2^{n-1} \)

OpenStudy (anonymous):

I get that, so is my method wrong cuz when i try it for myself it works. is the formula i posted the same thing as \[2^{n-1}\]

OpenStudy (aum):

Yes, except, the n and (n-1) must be subscripts like I posted in my first reply.

OpenStudy (anonymous):

alright thanks

OpenStudy (aum):

\(\large T_n\) is the sum of the \(n^{th}\) row of the Pascal's triangle.

OpenStudy (aum):

Then, \(T_n = 2*T_{n-1}\). The sigma is not necessary now because we have already defined \(T_n\) as the sum.

OpenStudy (anonymous):

so i dont have to put a sigma? just leave it as \[T_{n}=2T _{n-1}\]

OpenStudy (anonymous):

oh okay

OpenStudy (aum):

correct.

OpenStudy (anonymous):

alright thanks :)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!