Professional Documents
Culture Documents
Slides Proving Divisibility Problem 4
Slides Proving Divisibility Problem 4
: Show
m 6. that the following formula holds for all real numbers
k=0 a and b and for each integer n > 2:
he following formula
n holds for all This
real formula
numbers will
a be
andvery
b important
and for in
each Calculus
integer n1.
> Another
2: proof (not by inductio
X1 Precalculusn 1:1 Basicn notions.
n n 1 k k 2 n 3 2 2 n 3 n 2 n 1
b1 = (a b) a b = (a b)(a +a b+a b + ... + a b + ab +b ).
n
X Extra material: notes from the iPad.
n 1 k k k=0 n 1 n 2 n 3 2 2 n 3 n 2 n 1
a b = (a b)(a +a b+a b + ... + a b + ab +b ).
11 Another difficult proof, Problem 7.
ula will be very important in Calculus
k=0
Problem 7:1.Show
Another proof
that the (notformula
following by induction) is given
holds for each integerinn Video
2 N+ : 31 in
sy 1: Basic notions.
important in Calculus 1. Another proof
✓ (not by induction)
◆ ✓ is given
◆ ✓ in Video
◆ ✓ 31 ◆in✓ ◆ ✓
Yn
4 4 4 4 4
ons. notes from the iPad.
erial: 1 2
= 1 1 1 1 · ... · 1
(2n 1) 1 9 25 49 (2