Discrete Mathematics I

Solution sheet 3 2023

Exercise 1. Use induction to prove that for all n ≥ 1:

 2
n(n + 1)
13 + 23 + ... + n3 =
2

Solution:  2
3 3 3 n(n + 1)
We prove using induction that 1 + 2 + ... + n = is true for all n ∈ N.
2
Let P (n), will be the equation:
 2
n(n + 1)
P (n) ::= 13 + 23 + ... + n3 =
2

Base Case: First, we must show that P (0) is true:

 2
0(0 + 1)
03 = .
2

Induction Hypothesis: We assume that for some n ≥ 0 the equation P (n) is true.

Inductive Step: Next, we must show that P (n) implies P (n + 1) for all n ≥ 1. We assumed that
P (n) is true, we can reason as follows:
 2
3 3 3 3 n(n + 1)
1 + 2 + ... + n + (n + 1) = + (n + 1)3
2
 n 2
= (n + 1)2 + (n + 1)2 × (n + 1)
2
 2 
2 n + 4n + 4
= (n + 1) ( )
4
 2
2 n+2
= (n + 1)
2
 2
(n + 1)(n + 2)
=
2

This shows that P (n) implies P (n + 1).

We conclude by the principle of mathematical induction that P (n) holds for all n ≥ 1. □

2023 1
Discrete Mathematics I
Solution sheet 3 2023

Exercise 2. During the lecture last week we proved the fact that that there are irrational numbers
a, b such that ab is rational using a proof by cases. Unfortunately, that proof was nonconstructive: √
it didn’t reveal a specific pair a, b with this property. But in fact, it’s easy to do this: let a := 2
and b := 2 log2 (3).√
We know a = 2 is irrational, and ab = 3 by definition. Finish the proof that these values for
a, b work, by showing that 2 log2 (3) is irrational using a proof by contradiction.

Solution:
We prove that 2 log2 (3) is irrational using proof by contradiction.
p
Suppose for a contradiction that 2 log2 (3) is rational. Thus, there exists p, q ∈ Z∗ s.t. 2 log2 (3) = .
q
By dividing both side of the equation by 2 we get:
p
log2 (3) =
2q

2q × log2 (3) = p
log2 (32q ) = p
32q = 2p
We’ve reached a contradiction because we have concluded that a power of 3 is even (which it isn’t)
and a power of 2 is divisible by 3 (which is also not possible).
Thus, we reject our assumption and we have to conclude that 2 log2 (3) is irrational. □

2023 2
Discrete Mathematics I
Solution sheet 3 2023

Exercise 3. Find a formula for the sum:

1 1 1
+ + ... +
1×2 2×3 n × (n + 1)
Then prove it is correct by induction.
Hint: Start by computing the first few values of the sum.

Solution:
By following the pattern we can find the formula:
1 1
=
1×2 2
1 1 1 1 2
+ = + =
1×2 2×3 2 6 3
1 1 1 1 1 1 3
+ + = + + =
1×2 2×3 3×4 2 6 12 4
...

1 1 1 1 n
+ + + ... + =
1×2 2×3 3×4 n × (n + 1) n+1

1 1 1 1 n
We use a proof by induction to prove that + + + ... + =
1×2 2×3 3×4 n × (n + 1) n+1
holds for n ≥ 1:
Pn 1 n
Let P (n) ::= i=1 =
n × (n + 1) n+1
1 1
Base Case: for n = 1 , = .
1×2 2
Induction Hypothesis: We assume that P (n) holds for some arbitrary positive integer k ≥ 1.

Inductive Step: Now we must prove that P (k + 1) also holds true, i.e. that:
1 1 1 1 k+1
+ + ... + + =
1×2 2×3 k × (k + 1) (k + 1) × (k + 2) k+2
k
We substitute the first k terms with by the induction step. Thus, we have:
k+1
1 1 1 1
+ + ... + +
1×2 2×3 k × (k + 1) (k + 1) × (k + 2)
k 1
= +
k + 1 (k + 1) × (k + 2)
(k)(k + 2) + 1
=
(k + 1)(k + 2)
k 2 + 2k + 1
=
(k + 1)(k + 2)
(k + 1)2 k+1
= =
(k + 1)(k + 2) k+2
1 1 1
We conclude that we have proven by mathematical induction that + +...+ =
1×2 2×3 n × (n + 1)
n
holds for every n ∈ N+ . □
n+1

2023 3
Discrete Mathematics I
Solution sheet 3 2023

√ √
Exercise 4. Prove by contradiction that 3+ 2 is irrational.
√ √ √ √
Hint: ( 3 + 2)( 3 − 2) = 1

Solution: √ √
We use proof by contradiction to prove that 3+ 2 is irrational.
√ √ √ √ p
Suppose for a contradiction that 3 + 2 is rational. Then ∃p, q ∈ Z∗ s.t. 3 + 2 =
√ √ √ √ q
Also, we know that ( 3 + 2)( 3 − 2) = 1.
p √ √ √ √ q
So, × ( 3 − 2) = 1 and thus 3 − 2 = .
q p
√ √ √ √ √ p q p2 − q 2 p2 − q 2 √
( 3 + 2) − ( 3 − 2) = 2 2 = − = , then = 2.
q p √ pq 2pq
p2 − q 2 is an integer, and so is 2pq. Hence, 2 is rational. This is a contradiction, since we have
shown in class that it is irrational. √ √
Thus, we have proven by contradiction that 3 + 2 is irrational. □

2023 4