Pascal's Triangle: How would I write a direct proof if I had this number pattern

Favorites|Homepage
Subscriptions | sitemap

HOME > > Pascal's Triangle: How would I write a direct proof if I had this number pattern

Pascal's Triangle: How would I write a direct proof if I had this number pattern

[From: ] [author: ] [Date: 11-12-13] [Hit: ]

Id really appreciate your help! Thanks!-The successive numbers in the nth row of the Pascals triangle are the terms in the binomial expansion of (1+1)^n. That is why the sum is 2^n.The sequence that you have provided is a GP with common ratio r = 2.It is not understood as to what has to be proved here.......

1,2,4,8,16,32,64,128 ?

What I have as a conjecture is "The sum of the elements in the nth row is 2^n (2 to the nth power)."

I'd really appreciate your help! Thanks!

-

The successive numbers in the nth row of the Pascal's triangle are the terms in the binomial expansion of (1+1)^n. That is why the sum is 2^n.
The sequence that you have provided is a GP with common ratio r = 2.
It is not understood as to what has to be proved here.

1

keywords: this,Pascal,proof,pattern,How,direct,would,Triangle,039,if,number,had,write,Pascal's Triangle: How would I write a direct proof if I had this number pattern

New

Hot