Mathematical Induction
Theorem 1.1 Archimedean Property - If a and b are postive integers, then there exists a positive integer n such that na>= b
Theorem 1.1 First Principle of Finite Induction -
The Binomial Theorem
!)} "\binom{n}{k} = \frac{n!}{k! (n-
k)!)}")
Pascal's Rule
The so-called binomial theorem is in reality a formula for the complete expansion of (a+b)^n
&space;^&space;n&space;=&space;\binom{n}{0}&space;a^n&space;+&space;\binom{n}{1}&space;a^n^-^1&space;b&space;+&space;\binom{n}{2}&space;a^n^-^2&space;b^2&space;+&space;..&space;+&space;\binom{n}{n-1}&space;ab^n^-^1&space;+&space;\binom{n}{n}&space;b^n "(a+b) ^ n = \binom{n}{0} a^n + \binom{n}{1} a^n^-^1 b + \binom{n}{2} a^n^-^2 b^2 + .. + \binom{n}{n-1} ab^n^-^1 + \binom{n}{n} b^n")
Theorem 1.1 Archimedean Property - If a and b are postive integers, then there exists a positive integer n such that na>= b
Theorem 1.1 First Principle of Finite Induction -
The Binomial Theorem
Pascal's Rule
The so-called binomial theorem is in reality a formula for the complete expansion of (a+b)^n