Binomial theorem

induction 1− 1
( ) 1 1 1 ! 1
𝑎 +𝑏 =1 𝑎 𝑘+! ( 𝑘− ( 𝑗 −1 ) ) ! ( 𝑗 −1)! 𝑎 𝑏 𝑘! ( 𝑘− 𝑗 ) ! 𝑗 !
2-inductive
𝑘 !
+
𝑘!
= ( 1− 1 ) ! 1 ! +
1- Prove
( 𝑘− 𝑗 ! 𝑗the
) ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − ( 𝑗 −1 ) ) ! ( 𝑗 − 1 ) ! ( 𝑘− 𝑗 ) ! 𝑗 !
hypothesis
proposition is
(what the 𝑘 ! + 𝑘!
=
𝑘 ! ( 𝑘− 𝑗 +1 ) ! ( 𝑗 −1 ) !+ 𝑘! ( 𝑘 − 𝑗 ) ! 𝑗 !
true for n =( 𝑘− 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘− 𝑗 ) ! 𝑗 ! ( 𝑘 − 𝑗+1 ) ! ( 𝑗 −1)!
proposition
1(or any
asserts for the
initial value).
case n = k )
 Binomial theorem
induction
1− 1
( 𝑎 +𝑏 ) =1 𝑎1 + 1 ! 1 1
𝑎 𝑏
2-inductive 𝑘 ! ( 1− 1 ) !𝑗 +1
1 !
1- Prove the 𝑘! 𝑘 ! (
+
𝑘− ) ! ( 𝑗 −1 ) !+ 𝑘! ( 𝑘 − 𝑗 ) ! 𝑗 !
=
hypothesis ( 𝑘− 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘− 𝑗 ) ! 𝑗 ! ( 𝑘 − 𝑗+1 ) ! ( 𝑗 −1)!
proposition is
(what the
true for n =
proposition
𝑘! 𝑘! 𝑘 ! ( 𝑘− ( 𝑗 −1 ) ) ! ( 𝑗 −1)! 𝑘! ( 𝑘− 𝑗 ) ! 𝑗 !
( 𝑘−1(or
𝑗 ) ! 𝑗 !any
+ = +
asserts for( 𝑘−the ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − ( 𝑗 −1 ) ) ! ( 𝑗 − 1 ) ! ( 𝑘− 𝑗 ) ! 𝑗 !
initial value).
case n = k )
 Binomial theorem
induction
1− 1
( 𝑎 +𝑏 ) =1 𝑎1 + 1 ! 1 1
𝑎 𝑏
2-inductive ( 1− 1 ) ! 1 !
1- Prove the 𝑘! 𝑘! 𝑘 ! ( 𝑘− 𝑗 +1 ) ! ( 𝑗 −1 ) !+ 𝑘! ( 𝑘 − 𝑗 ) ! 𝑗 ( 𝑗 −1)!
hypothesis + =
proposition is ( 𝑘− 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘 − 𝑗+ 1 ) ! ( 𝑗 −1)!
(what the
true for n =
proposition
𝑘! 𝑘! 𝑘 ! ( 𝑘− ( 𝑗 −1 ) ) ! ( 𝑗 −1)! 𝑘! ( 𝑘− 𝑗 ) ! 𝑗 !
( 𝑘−1(or
𝑗 ) ! 𝑗 !any
+ = +
asserts for( 𝑘−the ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − ( 𝑗 −1 ) ) ! ( 𝑗 − 1 ) ! ( 𝑘− 𝑗 ) ! 𝑗 !
initial value).
case n = k )
 Binomial theorem
induction
1− 1
( 𝑎 +𝑏 ) =1 𝑎1 + 1 ! 1 1
𝑎 𝑏
2-inductive ( 1− 1 ) ! 1 !
1- Prove the
hypothesis( 𝑘 !) + 𝑘!
=
𝑘 ! ( 𝑘− 𝑗 +1 ) ! ( 𝑗 −1 ) !+ 𝑘! ( 𝑘 − 𝑗 ) ! 𝑗 ( 𝑗 −1)!
proposition 𝑘− is 𝑗 ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘 − 𝑗+ 1 ) ! ( 𝑗 −1)!
(what the
true for n =
proposition
𝑘! 𝑘! 𝑘 ! ( 𝑘− ( 𝑗 −1 ) ) ! ( 𝑗 −1)! 𝑘! ( 𝑘− 𝑗 ) ! 𝑗 !
( 𝑘−1(or
𝑗 ) ! 𝑗 !any
+ = +
asserts for( 𝑘−the ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − ( 𝑗 −1 ) ) ! ( 𝑗 − 1 ) ! ( 𝑘− 𝑗 ) ! 𝑗 !
initial value).
case n = k )
 Binomial theorem
induction
1− 1
( 𝑎 +𝑏 ) =1 𝑎1 + 1 ! 1 1
𝑎 𝑏
2-inductive ( 1− 1 ) ! 1 !
1- Prove the
hypothesis 𝑘!
+
𝑘!
=
𝑘 ! ( 𝑘− 𝑗 +1 ) !+ 𝑘! ( 𝑘− 𝑗 ) ! 𝑗
proposition is ( 𝑘− 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘 − 𝑗+1 ) !
(what the
true for n =
proposition
𝑘! 𝑘! 𝑘 ! ( 𝑘− ( 𝑗 −1 ) ) ! ( 𝑗 −1)! 𝑘! ( 𝑘− 𝑗 ) ! 𝑗 !
( 𝑘−1(or
𝑗 ) ! 𝑗 !any
+ = +
asserts for( 𝑘−the ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − ( 𝑗 −1 ) ) ! ( 𝑗 − 1 ) ! ( 𝑘− 𝑗 ) ! 𝑗 !
initial value).
case n = k )
 Binomial theorem
induction
1− 1
( 𝑎 +𝑏 ) =1 𝑎1 + 1 ! 1 1
𝑎 𝑏
2-inductive ( 1− 1 ) ! 1 !
1- Prove the 𝑘! 𝑘! 𝑘 !( 𝑘+ 1− 𝑗 ) ( 𝑘 − 𝑗 ) !+ 𝑘! ( 𝑘 − 𝑗 ) ! 𝑗
hypothesis + =
proposition is ( 𝑘− 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘 − 𝑗+ 1 ) !
(what the
true for n =
proposition
𝑘! 𝑘! 𝑘 ! ( 𝑘− ( 𝑗 −1 ) ) ! ( 𝑗 −1)! 𝑘! ( 𝑘− 𝑗 ) ! 𝑗 !
( 𝑘−1(or
𝑗 ) ! 𝑗 !any
+ = +
asserts for( 𝑘−the ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − ( 𝑗 −1 ) ) ! ( 𝑗 − 1 ) ! ( 𝑘− 𝑗 ) ! 𝑗 !
initial value).
case n = k )
 Binomial theorem
induction
2-inductive 𝑘! 𝑘! 𝑘 !( 𝑘+ 1− 𝑗 ) ( 𝑘 − 𝑗 ) !+ 𝑘! ( 𝑘 − 𝑗 ) ! 𝑗
1- Prove the ( 𝑘− 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)!
+ =
( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘 − 𝑗+ 1 ) !
hypothesis
proposition is
(what the
true for n =
proposition
𝑘! 𝑘! 𝑘 ! ( 𝑘− ( 𝑗 −1 ) ) ! ( 𝑗 −1)! 𝑘! ( 𝑘− 𝑗 ) ! 𝑗 !
( 𝑘−1(or
𝑗 ) ! 𝑗 !any
+ = +
asserts for( 𝑘−the ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − ( 𝑗 −1 ) ) ! ( 𝑗 − 1 ) ! ( 𝑘− 𝑗 ) ! 𝑗 !
initial value).
case n = k )
 Binomial theorem
induction
1− 1
( 𝑎 +𝑏 ) =1 𝑎1 + 1 ! 1 1
𝑎 𝑏
2-inductive 𝑘! ( 1−
𝑘! 1 ) ! 1 !
𝑘 !( 𝑘+ 1) −𝑘 ! 𝑗 +𝑘 ! 𝑗
1- Prove the + =
hypothesis ( 𝑘− 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! 𝑗 ! ( 𝑘− 𝑗 +1 ) !
proposition is
(what the
true for n =
proposition
𝑘! 𝑘! 𝑘 ! ( 𝑘− ( 𝑗 −1 ) ) ! ( 𝑗 −1)! 𝑘! ( 𝑘− 𝑗 ) ! 𝑗 !
( 𝑘−1(or
𝑗 ) ! 𝑗 !any
+ = +
asserts for( 𝑘−the ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − ( 𝑗 −1 ) ) ! ( 𝑗 − 1 ) ! ( 𝑘− 𝑗 ) ! 𝑗 !
initial value).
case n = k )
 Binomial theorem
induction
2-inductive 𝑘! 𝑘! 𝑘 !( 𝑘+ 1) −𝑘 ! 𝑗 +𝑘 ! 𝑗
1- Prove the +
( 𝑘− 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)!
=
𝑗 ! ( 𝑘− 𝑗 +1 ) !
hypothesis
proposition is
(what the
true for n =
proposition
𝑘! 𝑘! 𝑘 ! ( 𝑘− ( 𝑗 −1 ) ) ! ( 𝑗 −1)! 𝑘! ( 𝑘− 𝑗 ) ! 𝑗 !
( 𝑘−1(or
𝑗 ) ! 𝑗 !any
+ = +
asserts for( 𝑘−the ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − ( 𝑗 −1 ) ) ! ( 𝑗 − 1 ) ! ( 𝑘− 𝑗 ) ! 𝑗 !
initial value).
case n = k )
 Binomial theorem
induction
1− 1
( 𝑎 +𝑏 ) =1 𝑎1 + 11 ! 1
𝑎(𝑘+1)𝑏
2-inductive 𝑘 !
+ ( 1− 1 ) ! 1=!
𝑘! 𝑘!
1- Prove the ( 𝑘− 𝑗 ) ! 𝑗 ! 𝑗 ! ( 𝑘+1 − 𝑗 ) !
( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)!
hypothesis
proposition is
(what the
true for n =
proposition
𝑘! 𝑘! 𝑘 ! ( 𝑘− ( 𝑗 −1 ) ) ! ( 𝑗 −1)! 𝑘! ( 𝑘− 𝑗 ) ! 𝑗 !
( 𝑘−1(or
𝑗 ) ! 𝑗 !any
+ = +
asserts for( 𝑘−the ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − 𝑗 ) ! 𝑗 ! ( 𝑘− ( 𝑗 −1 ) ) !( 𝑗 −1)! ( 𝑘 − ( 𝑗 −1 ) ) ! ( 𝑗 − 1 ) ! ( 𝑘− 𝑗 ) ! 𝑗 !
initial value).
case n = k )