Mathematics: Proofs by induction

Mathematics from high school to university

Another difficult proof, Problem 7

Hania Uscka-Wehlou, Ph.D. (2009, Uppsala University: Mathematics)

University teacher in mathematics, Sweden
 a b = (a b) a b = (a b)(a a+ a bb + =
a (a
b + .b)
.. + a b a + ab b + b= (a
). b)(a +a b+a b + ...
ecalculus 1: Basic notions. k=0
tra material: This
notes from 11 Another difficult proof, Problem k=0
7.
formula will the iPad.
be very important in Calculus 1. Another proof (not by induction) is given in Video 31 in
Precalculus 1: Basic notions. Problem This7:formula
Show that will the
be veryfollowing
important formula holds for1.each
in Calculus integer
Another proof N : by i
n 2(not+
other difficultExtra
proof, Problem
material: notes from 7. the iPad. Precalculus 1: Basic notions.
Y n ✓ ◆ ✓ ◆ ✓ ◆ ✓ ◆ ✓ ◆ ✓
oblem 7: Show that the following formulaExtra
11 Another difficult proof, Problem 7. holdsmaterial:
for each4notes
integer n
from 2 theN +4
:
iPad. 4 4 4
Problem 7: Show that the following formula holds for1each integer n 2 N 2
+
: = 1 1 1 1 · . . . · 1
✓ ◆ ✓ ◆ ✓ ◆ ✓ (2n ◆ ✓1) ◆ 1✓ 9 ◆ 25 49
n
Y n ✓
4 1
Y 4
◆ ✓
4 4 11
◆ ✓ Another
k=1
44
◆✓ difficult
4
◆✓
4 4 proof,
◆ ✓Problem 7.
4 4
◆
1 + 2n 4 1 + 2n
1 = 1 = 1 1 1 1 1 1 · ... · 1
1 · . . . · =1 . = .
(2n k=1 1) 2 (2n 1) 2 1 Problem
9
1 Extra material:
9 7:
25 Show
notes
25
49 that
from 49 the following
(2n
the iPad. 1) 2
formula
1 2n
(2n 1) holds2 for each
1 2n integer n 2 N +
:
k=1
Extra material: notes from the iPad. n
Y ✓ ◆ ✓ ◆✓ ◆✓ ◆✓ ◆ ✓
12 Proofs by induction, Wrap-up. 4 4 4 4 4
xtra material: notes
12 Proofs from the
by induction, iPad.
Wrap-up. 1 = 1 1 1 1 · . . . ·
Examples showing that choosing aExamples showing that choosing a proof by induction is not always49 possible
(2k 1) 2 1about 9 25
proof by induction is not always possible (for statements natural
k=1
oofs by induction,
numbers)Wrap-up.
or not the best choice:
numbers) or not the best choice:
a) Prove that none of the numbers Sn for n > 2 is integer,
Extra where notes from the iPad.
material:
amples showing that choosing a proof by induction
a) Prove that noneis not
of always
the numbers possible
S n
(for
for n >statements
2 is about
integer, where natural
1 1 1
mbers) or not the best choice: 12 Proofs by2 induction,
Sn = 1 + + + . . . + .
3 n Wrap-up.
1 1 1
Prove that none ofthat
b) Prove thefornumbers
each natural number n>
Sn forn we have2nis+integer,
Examples 2
1 showing
> 2n. where
that choosing a proof Snby = induction
1 + + is+not ... +always
. possib
Extra material: an article with an advancednumbers) or not the best choice:
proof by induction, coming from the course Precalculus 2: 2 3 n
Polynomials and rational functions: Theorem about Polynomial
1 1 Division. 1
b) Prove
Sa)
n = that
Prove
1 + for
that
+ each
none
+ natural
. of
. . +the .number
numbers n
S nwe have
for n > n
2 2
1 > 2n.where
is+integer,
2 3 n
S3 Extras Extra material: an article with an advanced proof by induction, 1 1 coming1 from t
Prove that for each natural number n we have
Polynomials and n 2
> 2n.
+ 1 rational functions: Theorem Sn = 1 + Polynomial
about + + . . . +Division.
.
2 3 n
13 Bonus Lecture.
tra material: an article with an advanced proof by induction, coming from the course Precalculus 2:
b) Prove
Extra material: a pdf with all the links and coupon codes
lynomials and rational functions: Theorem about Polynomial Division. that
to all for
our each
Udemy natural
courses. number n we have n 2
+ 1 > 2n.
S3 Extras Extra material: an article with an advanced proof by induction, coming from