Raw

3. Classroom tasks and solutions / Аудиторні задачі та розв’язання

Source of tasks. The eleven problems below are taken exactly from the practical-class assignment for this topic (set operations, Venn diagrams, and set algebra); only the wording has been translated to English. Each task is followed by a complete worked solution so the whole class can check every step. The theory used is in 2method.md.

Throughout, AA, BB, CC are sets inside a universe UU; recall the difference law AB=ABA \setminus B = A \cap \overline{B}.

A. Illustrating operations with diagrams (Tasks 1–3)

Task 1

Illustrate the set E=A(BC)E = A \setminus (B \cup C) with Euler/Venn circles.

Solution. Draw three overlapping circles AA, BB, CC inside the universe rectangle. Shade inside-out:

  1. First mark BCB \cup C — everything lying inside circle BB or circle CC.
  2. E=A(BC)E = A \setminus (B \cup C) keeps the part of AA that is outside that marked area.

So the answer is the “petal” of circle AA that overlaps neither BB nor CC — the portion of AA separate from the other two circles. Everything of AA that it shares with BB or with CC is excluded.

Shade B ∪ C, then keep the part of A outside it to obtain A  (B ∪ C)

Task 2

Using Venn diagrams, verify the identity

A(BC)=(AB)(AC).A \cap (B \cup C) = (A \cap B) \cup (A \cap C).

Solution. Shade each side on its own diagram and compare.

  • Left side A(BC)A \cap (B \cup C). First shade BCB \cup C (both circles BB and CC); then intersect with AA, keeping only the part of that region lying inside AA. The result is the portion of AA that overlaps BB or CC.
  • Right side (AB)(AC)(A \cap B) \cup (A \cap C). Shade the lens ABA \cap B and the lens ACA \cap C, then take their union. The result is again the portion of AA overlapping BB, together with the portion of AA overlapping CC.

Both sides shade the same region — the part of A that overlaps B or C

The two shaded regions coincide exactly, so the identity holds. (This is the distributive law of \cap over \cup.)

Task 3

Write the formula for the shaded region of the given Venn diagram, where the shading covers the parts of circles AA and BB that lie outside circle CC.

The given diagram: the parts of A and B lying outside C are shaded

Solution. Read the region inside-out:

  1. The shaded area covers everything in AA or BB — that is ABA \cup B.
  2. …except whatever lies inside CC, which is removed.

Removing CC from ABA \cup B gives

E=(AB)C.E = (A \cup B) \setminus C.

B. Proving identities (Tasks 4–5)

Task 4

Prove that A(AB)=AB.A \setminus (A \setminus B) = A \cap B.

Solution (algebraic).

A(AB)=A(AB)(difference law)=A(AB)(AB=AB)=A(AB)(De Morgan)=A(AB)(double complement)=(AA)(AB)(distributivity)=(AB)(complement law)=AB.(identity law)\begin{aligned} A \setminus (A \setminus B) &= A \cap \overline{(A \setminus B)} && \text{(difference law)} \\ &= A \cap \overline{(A \cap \overline{B})} && \text{(}A \setminus B = A \cap \overline{B}\text{)} \\ &= A \cap (\overline{A} \cup \overline{\overline{B}}) && \text{(De Morgan)} \\ &= A \cap (\overline{A} \cup B) && \text{(double complement)} \\ &= (A \cap \overline{A}) \cup (A \cap B) && \text{(distributivity)} \\ &= \varnothing \cup (A \cap B) && \text{(complement law)} \\ &= A \cap B. && \text{(identity law)} \end{aligned}

Hence A(AB)=ABA \setminus (A \setminus B) = A \cap B. \blacksquare

Task 5

Prove that A=(AB)(AB),A = (A \cap B) \cup (A \setminus B), where AA and BB are sets.

Solution. Start from the right-hand side and use AB=ABA \setminus B = A \cap \overline{B}:

(AB)(AB)=(AB)(AB)(difference law)=A(BB)(distributivity)=AU(complement law, BB=U)=A.(identity law)\begin{aligned} (A \cap B) \cup (A \setminus B) &= (A \cap B) \cup (A \cap \overline{B}) && \text{(difference law)} \\ &= A \cap (B \cup \overline{B}) && \text{(distributivity)} \\ &= A \cap U && \text{(complement law, } B \cup \overline{B} = U\text{)} \\ &= A. && \text{(identity law)} \end{aligned}

Thus (AB)(AB)=A(A \cap B) \cup (A \setminus B) = A. Intuitively, every element of AA either is in BB (so it lands in ABA \cap B) or is not (so it lands in ABA \setminus B); the two pieces together rebuild AA. \blacksquare

C. Computing sets (Tasks 6–9)

For Tasks 6–9 let

A={2,4,6,8,10,12},B={3,6,9,12}.A = \{2, 4, 6, 8, 10, 12\}, \qquad B = \{3, 6, 9, 12\}.

Task 6

Write the set E=ABE = A \cup B.

Solution. The union collects every element that is in AA or in BB (each listed once):

E=AB={2,3,4,6,8,9,10,12}.E = A \cup B = \{2, 3, 4, 6, 8, 9, 10, 12\}.

Task 7

Write the set E=ABE = A \cap B.

Solution. The intersection keeps only the elements in both sets. Comparing the lists, 66 and 1212 occur in each:

E=AB={6,12}.E = A \cap B = \{6, 12\}.

Task 8

Write the set E=ABE = A \setminus B.

Solution. The difference keeps the elements of AA that are not in BB. Removing the shared elements 66 and 1212 from AA:

E=AB={2,4,8,10}.E = A \setminus B = \{2, 4, 8, 10\}.

Task 9

Write the set E=ABE = \overline{A \setminus B}, the complement of ABA \setminus B taken relative to the universe U=ABU = A \cup B.

Solution. From Task 8, AB={2,4,8,10}A \setminus B = \{2, 4, 8, 10\}, and from Task 6 the universe is U=AB={2,3,4,6,8,9,10,12}U = A \cup B = \{2, 3, 4, 6, 8, 9, 10, 12\}. The complement removes ABA \setminus B from UU:

E=AB=U(AB)={3,6,9,12}.E = \overline{A \setminus B} = U \setminus (A \setminus B) = \{3, 6, 9, 12\}.

(Notice this is exactly BB — consistent with Task 5, since U=ABU = A \cup B and U(AB)=BU \setminus (A \setminus B) = B here.)

D. Set-builder and power set (Tasks 10–11)

Task 10

List the elements of the following sets (with N={1,2,3,}\mathbb{N} = \{1, 2, 3, \dots\}):

D={xxN and x is a divisor of 15},E={xxN and 15<x<30 and x is prime}.D = \{\, x \mid x \in \mathbb{N} \ \text{and}\ x \ \text{is a divisor of } 15 \,\}, \qquad E = \{\, x \mid x \in \mathbb{N} \ \text{and}\ 15 < x < 30 \ \text{and}\ x \ \text{is prime} \,\}.

Solution. Apply each defining property to the candidates.

  • DD: the natural-number divisors of 1515 are 1,3,5,151, 3, 5, 15 (since 15=115=3515 = 1\cdot 15 = 3 \cdot 5). Hence D={1,3,5,15}D = \{1, 3, 5, 15\}.
  • EE: test each integer strictly between 1515 and 3030 for primality. The composites are ruled out (16,18,16,18,\dots even; 21=3721 = 3\cdot 7; 25=5225 = 5^2; 27=3327 = 3^3), leaving the primes 17,19,23,2917, 19, 23, 29. Hence E={17,19,23,29}E = \{17, 19, 23, 29\}.

Task 11

List the elements of the power set P(G)\mathcal{P}(G), where G={1,2,3}G = \{1, 2, 3\} (P(G)\mathcal{P}(G) is the set of all subsets of GG).

Solution. Since G=3|G| = 3, there are 23=82^{3} = 8 subsets. Enumerate them by size so none is missed:

  • size 00: \varnothing;
  • size 11: {1},{2},{3}\{1\}, \{2\}, \{3\};
  • size 22: {1,2},{1,3},{2,3}\{1,2\}, \{1,3\}, \{2,3\};
  • size 33: {1,2,3}\{1,2,3\}.

Therefore

P(G)={, {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3}}.\mathcal{P}(G) = \big\{\, \varnothing,\ \{1\},\ \{2\},\ \{3\},\ \{1,2\},\ \{1,3\},\ \{2,3\},\ \{1,2,3\} \,\big\}.

E. Counting and products (Tasks 12–13)

Task 12

In a group of 3030 students, 1818 study French and 1515 study German, and 77 study both. How many study (a) at least one of the two languages, (b) neither?

Solution. By inclusion–exclusion, FG=F+GFG=18+157=26|F\cup G| = |F| + |G| - |F\cap G| = 18 + 15 - 7 = 26. So (a) 2626 study at least one language, and (b) 3026=430 - 26 = 4 study neither. The FG-|F\cap G| corrects the double-count of the 77 students who are inside both F|F| and G|G|.

Task 13

For A={1,2}A = \{1, 2\} and B={x,y,z}B = \{x, y, z\}: (a) list A×BA \times B and give A×B|A\times B|; (b) compute the symmetric difference {1,2,3}{2,3,4}\{1,2,3\}\triangle\{2,3,4\}.

Solution. (a) The Cartesian product pairs each element of AA with each of BB:

A×B={(1,x),(1,y),(1,z),(2,x),(2,y),(2,z)},A×B=AB=23=6.A\times B = \{(1,x),(1,y),(1,z),(2,x),(2,y),(2,z)\},\qquad |A\times B| = |A|\cdot|B| = 2\cdot 3 = 6.

(b) The symmetric difference keeps the elements lying in exactly one set: {1,2,3}{2,3,4}={1,4}\{1,2,3\}\triangle\{2,3,4\} = \{1,4\} (the shared 2,32,3 drop out).

Practical/Practical1/3classroom.md · 7.6 KB · updated 2026-08-01 17:52