Respuesta :

LammettHash

Use the binomial theorem:

[tex](1+1)^{16}=\displaystyle\sum_{k=0}^{16}\binom{16}k1^{16-k}1^k[/tex]

So

[tex]\dbinom{16}0+\dbinom{16}1+\cdots+\dbinom{16}{16}=\boxed{2^{16}}[/tex]

More generally,

[tex]\displaystyle\sum_{k=0}^n\binom nk=2^n[/tex]

Otras preguntas