Machine Translated by Google
Theoretical Computer Science Prof. Dr. H. Peter Gumm Philipps
winter semester 2020 University of Marburg
¨
0. Exercise sheet
Deadline: Saturday, October 19, 2024 until 10 p.m. via Ilias.
This worksheet is primarily intended to test your basic mathematical knowledge in the areas of
set theory,
functions,
Logical language and
Prove
to test. The lecture builds on these areas. If you have weaknesses in one of the areas, you should try to compensate for them as early as
possible in the lecture so that you are not left behind.
Task 1 (Set Theory).
(a) How many elements does the following set have: {{},{{}},{a},{b},{a,a},{a,b},{b,a},{b,b}}
¨
(b) For every set M let P(M) be the power set of M. Which of the following sets is not an element of P(P({a,
b})) :
i) {{a}, {a, b}, {b}} ii)
{{a}, {a, b}} iii)
{a, b, {a, b}} iv)
{{a, b}} }, P({a, b})}
(c) Given A = {x ÿ N | x mod 3 = 0} and B = {2 ÿ y | y ÿ N}. Determine A ÿ B.
¨
(d) A subset T of N is called “large” if N \ T is finite. Explain or find a
Counterexample to the following statements
i) Every infinite subset of N is large. ii) Every
large subset of N is infinite. iii) The intersection
of two large subsets is large.
1
Machine Translated by Google
(a) We have {a, b} = {b, a} and {a} = {a, a},{b} = {b, b} so the set has 5 elements.
(b) U ÿ P(P({a, b})) ÿÿ U ÿ P({a, b}) ÿÿ ÿu ÿ Uu ÿ P({a, b}) ÿÿ ÿu ÿ Uu ÿ {away}.
Thus (c) and (d) are correct answers, because a ÿÿ {a, b}. The second correct answer is (d), because
P({a, b}) ÿÿ {a, b}, because {a, b} ÿ P({a, b}), but {a, b} ÿ { / a, b}.
(c) x ÿ A ÿÿ x mod 3 = 0 and x ÿ B ÿÿ ÿy : Nx = 2 ÿ y ÿÿ x mod 2 = 0, i.e
x ÿ A ÿ B ÿÿ x ÿ A ÿ x ÿ B ÿÿ x mod 6 = 0.
(d)
i) {x ÿ N | x mod 2 = 0} is infinite, but not large, because its complement {x ÿ N | x mod 2 = 1} is itself
infinite. ii) If M ÿ N is large,
then N \M is finite, so N \M = {n1, ..., nk} ÿ {0, ..., nmax}, where nmax is the largest element of
{n1, ..., nk} . Therefore M = N \ (N \ M)) ÿ N \ {0, ..., nmax} = {x ÿ N | x ÿ nmax} which is an infinite
set.
iii) Let A = N \ E1 and B = N \ E2 with finite sets E1 and E2. Then E1 ÿ E2
finite and thus A ÿ B = N \ E1 ÿ N \ E2 = N \ (E1 ÿ E2) large.
(4 points)
Task 2 (mappings). Let A = {0, 1, 2, 3} and B = {1, 2, 3}. Which of the following¨ f defines a mapping from A
to B? If one of the suggestions is not a function, explain why not. If f is a function, say whether f is injective
or surjective.
(a) f := {(0, 3),(1, 1),(2, 3),(3, 2)}
(b) f := {(3, 0),(1, 1),(3, 2),(2, 3)}
(c) f(x) := min{x + 1, 3}
(d) f(x) := max{x + 1, x}.
(a) f : A ÿ B is left-total and right-unique, thus a mapping. f is even right-total and thus
surjective
(b) f : A ÿ B is left-total but not right-unique, because (3, 0) ÿ f and (3, 2) ÿ f.
(c) f = {min(x + 1, 3) | x ÿ A} ÿ A × B is left total and right unique. f is surjective, but not injective, since f(2) = f(3). f(x ÿ B ÿÿ ÿy :
Nx = 2 ÿ y ÿÿ x mod 2 = 0, so x ÿ A ÿ B ÿÿ x ÿ A ÿ x ÿ B ÿÿ x mod 6 = 0.
(d) f = {max(x + 1, x) | x ÿ A} ÿÿ A × B is not a map f : A ÿ B.
(4 points)
2
Machine Translated by Google
Task 3 (Grammar). It is about people like Otto, Eva, Ida, you and me, and fans of football clubs like Bayern, Schalke, BvB. We look at
the relations knows ÿ people × people as well as fans ÿ people × clubs
(a) What do the following formulas mean in colloquial language. Please do not use them literally – try to use expressions-
¨
show how ” there is” and ” for all”.
i) ÿxf an(x, Bayern) ÿ ÿyf an(y, Schalke) ÿ kennt(x, y) ii) ÿxf
an(x, Bayern) ÿ ¬kennt(x, otto)
¨
(b) Write a formula that is as simple as possible and expresses the following statements. Please use the
quantifiers as above only in the pure form ÿxP or ÿyQ and not as qualified quantifiers such as
ÿx:fan(x,Bayern) .P or ÿy:kennt(y,otto) .Q. In other words: After the quantifier comes exactly one variable,
then a point, then a formula, as in part (a) or in ÿx.ÿyx > 0 ÿ x = y + 1.
i) Every Bayern fan knows a Schalke fan. ii)
Anyone who doesn't know Eva or Ida can't be a BvB fan.
(a)
i) At least one Bayern fan knows every Schalke fan. ii)
Everyone who knows Otto is a Bayern fan.
(b)
i) ÿxf an(x, Bayern) ÿ ÿyf an(y, Schalke) ÿ kennt(x, y). ii)
ÿx.¬kennt(x,
¨ eva) ÿ ¬kennt(x, ida) ÿ ¬f an(x, BvB). ÿxf an(x,
Equivalent to: BvB) ÿ kennt(x, eva) ÿ kennt(x, eva).
(4 points)
Task 4 (Proof). We want to show that there are infinitely many prime numbers. If successful, what procedure
would be a mathematically acceptable proof?
(a) We assume that there is a largest prime number and show that 0 = 1.
(b) We show by complete induction: ÿn. n ÿ N ÿ ÿkk ÿ N ÿ k ÿ n! + 1 ÿ prim(k).
(c) We show that there exists an infinite prime number.
¨
p is
pÿ1 (d) We show that for every prime number ÿ 1also the Mersenne number 22
is prime.
3
Machine Translated by Google
(a) Correct. This is a proof by contradiction
¨
(b) The condition n < k is missing to be useful. With k = 2 the condition would be trivially
fulfilled. ¨
(c) There are infinitely many numbers, but no prime number. ” infinite number”, certainly not an infinite
The statement is undefined.
(d) It is¨ unlikely that this can be proven. But if it could be proven,
It would actually follow that there are infinitely many prime numbers.
(4 points)
