Binomio fórmulas

http://www.uam.es/personal_pdi/ciencias/gallardo/capitulo3a.pdf
http://tlapixqui.izt.uam.mx/Mat-Fin/Mat_Fin-5.pdf

C(2,2)+C(3,2)+C(4,2)+C(5,2)=C(6,3)
C(2,0)+C(3,1)+C(4,2)+C(5,3)+C(6,4)=C(7,4)
(C(3,0))^2+(C(3,1))^2+(C(3,2))^2+(C(3,3))^2=C(6,3)--->C(2m,n)

(1+x)^n= C(n,0)+C(n,1)*x+C(n,2)+... =2^n (para x=1)
Derivando n*(1+x)^(n-1) o integrando obtenemos
C(n,1)+2C(n,2)+3C(n,3)+...+nC(n,n)=n*2^(n-1)
C(n,0)+1/2*C(n,1)+1/3C(n,2)+...+1/(n+1)*C(n,n)=(2^(n+1)-1)/(n+1)
C(2n,0)+C(2n-1,1)+C(2n-2,2)+...+C(n,n)=a_2n+1 que es el 2n+1 número de Fibonacci

EXTENDED BINOMIAL THEOREM
C(-m,r) = (-m)*(-m-1)*(-m-2)*...*(-m-r+1)/r!
C(-1/3,3)= (-1/3)(-4/3)(-7/3)/3! = -14/81

http://www.mathematicsonline.co.in/iitjee.htm

Un buen formulario para Discreta de Princenton:
http://www.cs.princeton.edu/courses/archive/fall04/cos341/cheat.pdf

Este lo voy a poner por nostalgia...

http://www.thiel.edu/mathproject/atps/tbloc.htm