High Quality
Open the downloaded document, and select print from the file menu (PDF reader required).
CSE 150 Fall 2009: Homework #2
Chao Xu
Problem 1
Proof by induction. define
F
0
= 0 for convenienceLet
P
(
n
) be the predicate
F
3
n
≡
0 (mod 2)
F
3
n
+1
≡
F
3
n
+2
≡
1 (mod 2)
Base case:
P
(0) is true.
F
0
≡
0 (mod 2)
F
1
≡
F
2
≡
1 (mod 2)
Inductive step:
Assume
P
(
n
) is true, then
P
(
n
+ 1) is true.
F
3(
n
+1)
≡
F
3
n
+1
+
F
3
n
+2
≡
0 mod 2
F
3(
n
+1)+1
≡
F
3
n
+2
+
F
3(
n
+1)
≡
1 mod 2
F
3(
n
+1)+2
≡
F
3(
n
+1)
+
F
3(
n
+1)+1
≡
1 mod 2Therefore
P
(
n
) is true for all
n
by induction.
Problem 2
Proof by induction. Let
P
(
n
) be the predicate
n
i
=1
i
3
=
n
(
n
+ 1)2
2
Base case:
P
(1) is true.1
3
= (
1(1+1)2
)
2
Inductive step:
Assume
P
(
n
) is true, then
P
(
n
+ 1) is true.
n
+1
i
=1
i
3
=
n
(
n
+ 1)2
2
+ (
n
+ 1)
3
=4 + 12
n
+ 13
n
2
+ 6
n
3
+
n
4
4=
(
n
+ 1)(
n
+ 2)2
2
Therefore
P
(
n
) is true for all
n
by induction.
Problem 3
Proof by induction. Let
P
(
n
) be the predicate
n
i
=0
x
i
=
x
n
+1
−
1
x
−
11
Base case:
P
(0) is true. 1 =
x
−
1
x
−
1
Inductive step:
Assume
P
(
n
) is true, then
P
(
n
+ 1) is true.
n
+1
i
=0
x
i
=
x
n
+1
−
1
x
−
1+
x
n
+1
n
+1
i
=0
x
i
=
x
n
+1
−
1 + (
x
n
+1
)(
x
−
1)
x
−
1
n
+1
i
=0
x
i
=
x
n
+2
−
1
x
−
1Therefore
P
(
n
) is true for all
n
by induction.
Problem 4
a
is irrational,
p,q,m,n
are integers.
n,q
= 0
Lemma 1.
Rational numbers are closed under addition and multiplication Proof.
pq
+
mn
=
pn
+
qmqn
, which is rational because
pn
+
qm,qn
are integers.
pqmn
=
pmqn
, which is rational, because
pm,qn
are integers.Note this also shows a square of rational number is never irrational, hence irrationals can’t have rationalsquare roots.
Lemma 2.
The sum of a irrational number and a rational number is irrational.Proof.
Proof by contradiction.
pq
+
a
=
mn
a
=
mn
+ (
−
pq
)
a
is rational, a contradiction. Thus prove the lemma.
Proof for the original problem
Proof by induction.Let
P
(
n
) be the predicate
x
n
is irrational.
Base case:
P
(1) is true.
Inductive step:
Assume
P
(
n
) is true, then
P
(
n
+ 1) is true.
x
n
+1
=
√
1 +
x
n
is irrational due to the above lemmas.Therefore
P
(
n
) is true for all
n
by induction.
Problem 5
The problem can be restated as below, where each team is a vertex, and
v
i
lose to
v
j
is directed edge (
v
j
,v
i
).Given a directed graph, where each vertex has a directed edge to or from every other vertex, prove thereexist a Hamiltonian path.
Lemma 3.
If there exist a hamiltonian path
H
in directed graph
G
which goes though vertices
v
1
,v
2
,...,v
n
in order. Add another vertex
v
into
G
, where there is a directed edge between
v
and any other vertex. Let the new graph be
G
. Then
G
contains a hamiltonian path
H
that contains
{
(
v
i
,v
)
,
(
v,v
i
+1
)
}
,
(
v
n
,v
)
or
(
v,v
1
)
as edges.
Add a Comment