Question One

Question

How does the graph of the function change under the following transformations (where is a constant)? That is, how to obtain the graph of from the graph of , where…

  1. ;
  2. ;
  3. .

Solution

Question Two

Question

Assume the mapping , , is a bijection. Apply transformations from the previous question to the mapping to produce a bijection .

Solution

Question Three

Question

Prove that the set of all finite sequences (‘words) composed of two letters is countable.

Hints: One method is to use a theorem in the lectures by which it is sufficient to produce an injective mapping to . Another method is to describe a systematic enumeration of all such words, that is, to show that the set can be represented as a sequence.

Solution