« previous section    next section »


Exercises


  1. Give examples of the elements of the following sets:
  2. How many elements are there in the following sets?
  3. Let U={n ∈ N : n<20} be a fixed universe and let A and B be their two subsets such that, A = {2n+1 : n ∈ N and n<6}, B = {3n+2 : n ∈ N and n<6}. List all elements of the sets: A ∪ B, A ∩ B, Ac ∪ B, A\B, B\A, A ⊕ B.
  4. Let A={x ∈ R : |x| ≥ 5} and B = {x ∈ R : -6 ≤ x<0}. Illustrate the sets as intervals and indicate their elements: A ∪ B, A ∩ B, A c , A\B, B\A.
  5. Let U = {a,b}* be the universe, the subsets of which are sets A, B, C such that,
    A= {a, b, aa, bb, aaa, bbb} B = {w ∈ U : length(w) ≥ 2} C = { w ∈ U : length(w) ≤ 2}. Point out the sets: Bc ∩ Cc, (B ∩ C)c, (B ∪ C)c, Bc ∪ Cc, Ac ∩ Bc.
  6. Are the following sentences valid or not? Justify your answer.

  7. List all elements of the set P(A), where A is the set of all zeros (roots) of the equation x2 -7x + 6 = 0.
    Prove that P(A ∩ B) = P(A) ∩ P(B) for arbitrary A and B.

  8. Explain under which assumptions the equalities {a, b, c} = {b, c, d}, {{a,b}, c, {d}} = {{a}, c} could be valid.

  9. Prove using two different methods:
  10. Prove that the following equations are not valid. Point out the counterexamples.
  11. Prove the following equations:
  12. Find the solutions to the equations:
13. Find out an algorithm that allows to compute a set-theoretic sum of two finite sets. Consider the following cases:

« previous section   next section »