Scribd
Upload
138 views3 pages

Math - 1200 - Assignment 6

This document contains the solutions to two questions from a math assignment. Question 1 involves finding elements in Z15 that satisfy xy=0 but x≠0 and y≠0, and determining the condition on m such that xy=0 in Zm implies x=0 or y=0. Question 2 evaluates whether two relations are equivalence relations and describes their equivalence classes. The first relation where x-y is rational is an equivalence relation, while the second where x|y is not due to lacking symmetry.

Uploaded by

Hikari Aoi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
138 views3 pages

Math - 1200 - Assignment 6

This document contains the solutions to two questions from a math assignment. Question 1 involves finding elements in Z15 that satisfy xy=0 but x≠0 and y≠0, and determining the condition on m such that xy=0 in Zm implies x=0 or y=0. Question 2 evaluates whether two relations are equivalence relations and describes their equivalence classes. The first relation where x-y is rational is an equivalence relation, while the second where x|y is not due to lacking symmetry.

Uploaded by

Hikari Aoi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Math 1200 Assignment 6

Due December 2nd, 2019


My Luu, ID: 216927683
December 2, 2019

Question 1. For any positive intergers m, let Zm = {0, 1, 2, . . . , m − 1}, and


define addition and multiplication of elements of Zm as follows: For any
x, y ∈ Zm , x + y = k, where k ∈ Zm such that x + y ≡ k mod m and xy = l,
where l ∈ Zm such that xy ≡ l mod m.
• a) Find x, y ∈ Z15 such that xy = 0 but x 6= 0, y 6= 0
We need to find x, y ∈ Z∗15 = {1, 2, 3, . . . , 14} such that xy ≡ 0 mod 15
This also means that we need to find x, y ∈ Z∗15 such that 15|xy
We can see that 15 is a composite by 15 = 5 · 3
Because both x and y are positive integers and less than 15, then neither
of x or y are divisible by 15.
Therefore, we can take 5|x and 3|y since x, y play the same role in
multiplication.
Then we can find x ∈ {5, 10} and y ∈ {3, 6, 9, 12} satisfy the above
conditions.
Therefore, the solutions for the original condition are:

(5, 3), (5, 6), (5, 9), (5, 12), (10, 3), (10, 6), (10, 9), (10, 12)

• b) Find a condition on m so that the equality xy = 0 in Zm implies


that x = 0 or y = 0
Conjecture: m must be prime numbers.
Proof: We need to show that if m is prime, and x, y ∈ Zm , xy = 0 then
x = 0 or y = 0
Let m be a prime number, x, y ∈ Zm such that xy = 0
Then xy ≡ mod m by definition of multiplication in Zm
Therefore m|xy
By Euclid’s Lemma: if p|ab for any prime numbers p and any integers
a, b then p|a or p|b, we can conclude that either m|x or m|y because m

1
is prime as assumption.
Since both x, y ≥ 0 and less than m, then m|x or m|y if and only if
x = 0 or y = 0 respectively. ( x = m · p or y = m · q for some p, q ∈ Z
then p = 0 or q = 0)
Therefore, if m is prime then xy = 0 in Zm for x, y ∈ Zm implies x = 0
or y = 0
Note: We can also show that this is the only condition of m that can
draw the same conclusion from the assumption of xy = 0 in Zm
In this case, we need to show that if m is not prime, then xy = 0 in
Zm has the solution where x 6= 0 and y 6= 0
Assume that m 6= 0 is a composite and x, y ∈ Zm such that xy = 0
Then we can write m = a · b for some a, b ∈ Zm and a, b 6= 0
Because xy = 0 in Zm means m|xy, we can take x = a and y = b.
Therefore there always exists at least 1 solution of xy = 0 where x, y 6= 0
This show that if m is a composite, xy = 0 in Zm does not implies x = 0
or y = 0.

Question 2. Determine whether the following are equivalence relation and


describe equivalence classes

• a) For any x, y ∈ R, x ∼ y if and only if x − y is rational.


We need to check reflexive, symmetry and transitivity
Reflexive:
For any x ∈ R, x − x = 0 ∈ Q, then x ∼ x
Reflexive holds.
Symmetry:
For any x, y ∈ R, assume that x ∼ y, we need to show that y ∼ x
Since x ∼ y then x − y = q for some q ∈ Q
Thus y − x = −(x − y) = −q ∈ Q (Rational numbers are closed under
addition, multiplication and division.)
Therefore, y ∼ x
Hence, Symmetry holds.
Transitivity:
For any x, y, z ∈ R, assume that x ∼ y, y ∼ z, we need to show that
x∼z
Since x ∼ y, y ∼ z then x − y = q and y − z = r for some q, r ∈ Q
Then x − z = (x − y) + (y − z) = q + r ∈ Q (Rational numbers are
closed under addition, multiplication and division.)
Therefore x ∼ z
Hence, transitivity holds.

2
Since this relation is reflexive, symmetric and transitive, it is an equiv-
alence relation.
Equivalence classes:

cl(y) = [y] = {x ∈ R : x ∼ y}

= {x ∈ R : x − y ∈ Q}
= {x ∈ R : x = y + q, for some q ∈ Q}

We also have another notation for this class as [y] = y + Q

• b) For any x, y ∈ Z, x ∼ y if and only if x|y


Conjecture: We can see that this is not an equivalence relation because
it is not symmetric.
Proof: We need to show that there exist some integers x, y such that
x ∼ y and y 6∼ x
Let x, y be positive integers such that x < y and x|y
By definition of the relation, x ∼ y
Since y > x and they are both positive, then y 6 |x ( this is equivalent
with if y|x , then y ≤ x)
Therefore, in this case, x ∼ y but y 6∼ x
Symmetry fails.
Then this is not an equivalence relation.

You might also like