CS 381 Homework 9



Same question numbers for 6th and 7th eds. but on different pages.

Hand in the following questions:

  1. Textbook p. 527 (p. 581 for 7th ed.)
      1 a, b, f

    The questions below are NOT from the textbook.
  2. Recursively define the relation {< a, b > | 3a = b }, where a and b are natural numbers.
  3. List all binary relations on { 0, 2 }.
  4. A unary relation is a set of 1-tuples. Prove that there are 2n unary relations on a set of cardinality n .

Due November 21, 2011, end of the day. No late hand-ins are accepted.

You may discuss these questions among yourselves and/or with me. But you must write the answers in your own words.