Induction (1 Viewer)

[Unovan]

Can somebody help lmao I'm not computing part ii

 

[carrotsss]

In the k+1 step they all turn into (k+1)C1 which means you can split them into kC1+kC0 etc repeatedly until you’ll find you’ve got double the assumption, which is 2*2^k which is 2^(k+1)

 

[Unovan]

In the k+1 step they all turn into (k+1)C1 which means you can split them into kC1+kC0 etc repeatedly until you’ll find you’ve got double the assumption, which is 2*2^k which is 2^(k+1)

Thanks, I got 2*2^k+1 in the rhs but couldn't figure out how to take n=k into the induction step