Scribd
Upload
20 views

Exercises 01

This document provides exercises for week 1 of a course on discrete structures. It includes exercises on sets, induction, functions, and properties of functions. Some key exercises are to describe unions and intersections of sets; prove properties of sequences, sums, and divisibility using induction; find bijective mappings between sets; and determine whether example functions are injective, surjective, or bijective.

Uploaded by

georg
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Exercises 01

This document provides exercises for week 1 of a course on discrete structures. It includes exercises on sets, induction, functions, and properties of functions. Some key exercises are to describe unions and intersections of sets; prove properties of sequences, sums, and divisibility using induction; find bijective mappings between sets; and determine whether example functions are injective, surjective, or bijective.

Uploaded by

georg
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Central Exercise

for Discrete Structures 2022


Bokelavadze, Imerlishvili & Neuhauser

1. Exercises for week 1


1.1. Sets.
1.1.1. Let S denote the set of students enrolled in KIU. Lets further define following sets
A = {s ∈ S : s is registered for “Discrete Structures 2022” course},
B = {s ∈ S : s is studying on computer science program},
C = {s ∈ S : s is studying on math program},
D = {s ∈ S : s is studying on math or computer science programs}.
Now, try to describe A ∪ B, C ∩ N, D \ B and N \ A.
1.1.2. Given A = {a ∈ N : a is odd}, B = Z, C = {x ∈ R : 2 ≤ x < 7} and D = {2, 14 , 7, π} find

(1) A ∩ C; (5) (B \ A) ∩ D;
(2) A ∪ D; (6) D \ (A ∩ B ∩ C ∩ D);
(3) C ∩ D ∩ A; (7) P(D);
(4) (A ∩ D) ∪ C; (8) P(D) ∩ D.

1.2. Induction.
1.2.1. Triangle sequence is a sequence of natural numbers Tn , geometrically given by

T1 = 1 T2 = 3 T3 = 6 T4 = 10

Show that
n(n + 1)
Tn = .
2
1.2.2. By the principle of mathematical induction for ∀n ∈ N prove, the following:
2 2
(1) 13 + 23 + 33 + . . . + n3 = n (n+1)
4 ;
n(n+1)(n+2)
(2) 1 × 2 + 2 × 3 + 3 × 4 + . . . + n(n + 1) = 3 ;
(3) n(n + 1)(n + 2) is divisible by 6;
(4) 32n − 1 is divisible by 8.
1.3. Functions.
1.3.1. Vectors and numbers. Let V denote the set of all arrows originating from a single point on a plane (see
Figure 1). Can you find a bijection between V and ordered pairs of real numbers (that is, R × R)? Can you
find another one?
Hint: Consider a Cartesian plane and corresponding coordinates for each arrow.
1
Central Exercise Discrete Structures 2022

Figure 1. Some elements of set V of all arrows originating from a single point on a plane

1.3.2. Properties of functions. Let f : X −→ Y be a function between sets X and Y .


(1) Recall the definition of the preimage of Y under f .
(2) Show that there is a bijection between X and a range of f if f is injective.
(3) Can f be surjective if X and Y are finite and |X| < |Y |?
(4) Can f be injective but not bijective if X and Y are finite and |X| = |Y |?
1.3.3. Finding functions.
(1) Can you find an injective function from N to N? Can you find another one?
(2) Can you find a bijective function from N to Z?
(3) This might be tricky: Can you find a surjective function from Z to Q?
(4) This is actually hard: Can you find a bijective function from R to R × R?
1.3.4. Functions.
(1) How many functions are there from {1, 2} to {3, 4, 5}?
(2) Explain how all possible functions from the set {6} to the set D from Exercise 1.1.2 look like? What
about to the set of all natural numbers? To the set of all real numbers?
(3) Define a function f : Z → Z by f (n) = n2 . Is f surjective? Injective? Why or why not?
(4) Find the pre-image of the set {k ∈ Z : k is even} under f from Exercise 1.3.4.(3).

You might also like