Tutorial 2, Discrete Structures for Computer Science, 2020

1. Prove that ∀n ∈ N, √ √ √ √
4n + 1 < n+ n+1< 4n + 2.

2. Prove that ∀n ∈ N,
 √ 2n+1  √ 2n+1 
5 5 + 11 5 5 + 11 = 42n+1 ,

where {x} denotes the fractional part of the positive number x: {x} = x − bxc.
3. Prove or disprove that if you have an 8 gallon jug of water and two empty jugs with capacities
of 5 gallons and 3 gallons, respectively, then you can measure 4 gallons by successively pouring
some of or all of the water in a jug into another jug.
4. (Study the Defective Chessboard Problem to solve this problem)
Prove that ∀n ∈ N, given any 2n × 2n −defective chessboard, it can be tiled with the trionimoes.
5. Prove that ∀(p, n) ∈ N2 , pn+1 + (p + 1)2n−1 is divisible by p2 + p + 1.
n
6. Prove that ∀n ∈ N, 32 − 1 is divisible by 2n+2 but not by 2n+3 .
7. Prove that ∀n ∈ N,
(2n)! 1
≤√ .
22n (n!)2 3n + 1
8. ∀(a, b, c) ∈ R+3 , such that b2 − 4ac > 0 and α1 = c, prove by induction that ∀n ∈ N,
aαn2
αn+1 =
b2 − 2a nj=1 αj
P

is well defined (denominator is non-zero), and

αn
αn+1 < .
2
9. Prove that ∀n ∈ N,
 
 n 
 [  X

 A j
=
 |Aj |
j=1  { j }∈[1..n]
X
− |Aj ∩ Ak |
{ j,k }∈[1..n]
X
+ |Aj ∩ Ak ∩ Al |
{ j,k,l }∈[1..n]
.
+ ..
 
 \ 
n+1 
 
+ (−1)  Aj
.

j∈[1..n] 

10. (Study the Euclid’s Extended GCD Algorithm to solve this problem)
Lucas numbers are defined as: L1 = 1, L2 = 3, and for n > 2, Ln = Ln−1 + Ln−2 . Prove both
the parts using mathematical induction.
(a) Find gcd(Ln , Ln−1 ) using Euclid’s GCD algorithm.
(b) Find integers xn and yn so that gcd(Ln , Ln−1 ) = xn Ln + yn Ln−1 using Euclid’s Extended
GCD algorithm.