Number Systems: Problem Sheet 9

Here are some hints for Problem Sheet 9, as given in office hours or by email.

Question 2. In (b) we want to find all z \in \mathbb{C} such that z \sim \mathrm{e}^{\pi i/4}. Clearly we can’t get far unless we use the definition of \sim. Substituting this ‘deflates’ the problem, by turning a statement involving the unfamiliar relation \sim into a more concrete problem about arguments. The principal argument of \mathrm{e}^{\pi i/4} is \pi/4, so, by definition of \sim, we have

z \sim \mathrm{e}^{\pi i /4} \Longleftrightarrow \mathrm{Arg} z = \pi/4.

Now try to find all z \in \mathbb{C} such that \mathrm{Arg}(z) = \pi/4. It will useful to put z into exponential form. (This should seem like a sensible thing to do, since \mathrm{e}^{\pi i /4} was given in exponential form.)

Once you’ve done (b) you should find (c) is very similar.

Question 3. For (a), you need to find a relation on \{1,2,3\} that is reflexive, symmetric but not transitive. So there must exist x,y,z such that x \sim y, y \sim z but x \not\sim z. You could start by making sure this is the case, by defining \sim so that 1 \sim 2 and 2 \sim 3, but 1 \not\sim 3. You will now need to make some further pairs relate in order to satisfy the reflexive and symmetric conditions.

Note that there is no need to define your relation by some sort of ‘natural’ condition, such as ‘a-b is even’. A diagram, as in Example 8.2, or a list of pairs (x,y) such that x \sim y is also entirely acceptable as a definition.

Question 4. For (b) you need to find some pairs (m,n) such that m \in \mathbb{Z}, n \in \mathbb{N} and (m,n) \equiv (3,2). Substituting the definition of \equiv, this means that 2m = 3n. Try putting m=0,1,2,3, \ldots: for some values of m you will get a suitable n \in \mathbb{Z}

Note that in Question 4, m and m' (read ‘m prime’ or ‘m dash’) will usually be different numbers. We use primes to show that while these numbers are different, they play a similar role in the equation.

Question 5. The congruence relation is defined in Definition 9.1. We haven’t covered this in lectures yet, but it is the same relation defined in Example 8.7. So for instance m \equiv 2012 \bmod 5 if and only if 2012 - m is divisible by 5. Clearly 2010 is divisible by 5 (since 2010/5 = 402), so for 5(a) you can take m=2.

Question 6. It might help to look again at Example 8.7. The Part C Slides on Moodle have the specific case of this example where n=3. In this question you should take n=5. For example, to find [0], use that b \equiv 0 mod 5 if and only if 0-b is divisible by 5. So

[0] = \{ b \in \mathbb{Z} : 5 \mid -b \}.

Now 5 divides -b if and only if -b = 5q for some q\in \mathbb{Z}. So

[0] = \{ 5q : q \in \mathbb{Z} \} = \{ \ldots, -10,-5,0,5,10, \ldots \}.

Note that we can obtain [0] from [3] by subtracting 3 from each element of [3]. This might help you to check your answers to the other parts.


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: