MATH1081 T3 Assignment Draft

Author: Will Aching - z5204932

October 26, 2020

1 Question 1
Consider the following Sets:

X = {112n + 71|n ∈ Z}
X = {16n − 9|n ∈ Z}
X = {14n + 1|n ∈ Z}

1.1 Show that X is a proper subset of Y

To define a proper subset, if set X is a proper subset of set Y , X ⊂ Y , then all the elements
of set X are in set Y but set Y contains at least one element that is not in set X, so that
set X is not equal to set Y , X 6= Y .

Proof:
We can use algebra to find the intersection of where set X and set Y equal each other,
by changing one of the variables, X : 112n + 71 and Y : 16k − 9

By setting X = Y we are asking for what values of ’k’ does set Y equal X and vice versa.
Hence:

112n + 71 = 16k − 9
112n + 80 = 16k
7n + 5 = k

1
 Will Aching

Hence, for k values {..., −7, −2, 5, 12, 19, ...}, that is k = 7n + 5 for n ∈ Z, then set Y
will contain all values of set X, this can be seen by subbing k = 7n + 5 into Y : 16k − 9:

16 ∗ (7n + 5) − 9
112n + 80 − 9
112n + 80

This is the definition of set X. Further, we can see that when n = 0 then Y = −9 and it is
easily checked that X 6= −9 for n ∈ Z, as such X ⊂ Y

1.2 Show that X is a proper subset of Z

In a similar way to the previous question, we can use algebra to find the intersection of
where set X and set Y equal each other, by changing one of the variables, X : 112n + 71
and Z : 114m + 1

By setting X = Z we are asking for what values of ’m’ does set Z equal X and vice
versa. Hence:

112n + 71 = 14m + 1
112n + 70 = 14m
8n + 5 = m

Hence, for m values {..., −11, −3, 5, 13, 21, ...}, that is m = 8n + 5 for n ∈ Z, then set Z will
contain all values of set X, this can be seen by subbing m = 8n + 5 into Z : 14m + 1:

14 ∗ (8n + 5) + 1
112n + 70 + 1
112n + 71

This is the definition of set X. Further, we can see that when n = 0 then Z = 1 and it is
easily checked that X 6= 1 for n ∈ Z, as such X ⊂ Z

Page 2
 Will Aching

1.3 Show that there is no containment relation between Y and Z

To define a containment relation then either Y ⊂ Z or Z ⊂ Y or Z = Y and we can test
each one of these relations by simply pugging in some numbers. For example, n = 0 then
Y = −9 and Z = 1.

If Y ⊂ Z then all elements of set Y are contained in set Z, hence −9 would have to be
included in set Z but it is obvious that there is no solution for Z = −9 for n ∈ Z. As such
set Y is not a proper subset of set Z

If Z ⊂ Y then all elements of set Z are contained in set Y , hence 1 would have to be
included in set Y but it is also obvious that there is no solution for Y = 1 for n ∈ Z. As
such set Z is not a proper subset of set Y .

It is also clear that these two sets are not equal to each other hence set Y and set Z
hace no containment relation.

2 Question 2
A relation ∼ is defined on (Z)2 − {(0, 0)} by

(x1 , x2 ) ∼ (y1 , y2 )

if and only if
x 1 ∗ y 2 = x2 ∗ y 1
Prove that ∼ is an equivalence relation equivalence.

To prove this we must prove it was reflexivity, symmetry and transitivity.

2.1 Reflexivity
We can see that for (x1 , x2 ) ∼ (x1 , x2 ) then x1 ∗ x2 = x2 ∗ x1 .
Hence it is reflective

2.2 Symmetry
We can see that for (x1 , x2 ) ∼ (y1 , y2 ) then x1 ∗ y2 = x2 ∗ y1 . Then
x2 ∗ y 1 = x1 ∗ y 2
y1 ∗ x2 = y2 ∗ x1
So that, (y1 , y2 ) ∼ (x1 , x2 )
Hence it is symmetrical.

Page 3
 Will Aching

2.3 Transitivity
For transitivity we must show that if (x1 , x2 ) ∼ (y1 , y2 ) and (y1 , y2 ) ∼ (z1 , z2 ) then (x1 , x2 ) ∼
(z1 , z2 )

For, (x1 , x2 ) ∼ (y1 , y2 ) then x1 ∗ y2 = x2 ∗ y1 .

For, (y1 , y2 ) ∼ (z1 , z2 ) then y1 ∗ z2 = y2 ∗ z1

take x1 ∗ y2 and times this by z2 so that it equals z2 ∗ x1 ∗ y2 then:

z2 ∗ (x1 ∗ y2 ) = z2 ∗ (x2 ∗ y1 ) = x2 ∗ (y1 ∗ z2 ) = x2 ∗ (y2 ∗ z1 )

thus, considering that y2 cannot be 0 from the definition of the relation

z2 ∗ (x1 ∗ y2 ) = x2 ∗ (y2 ∗ z1 )

x1 ∗ z2 = x2 ∗ z1
Resulting in (x1 , x2 ) ∼ (z1 , z2 ), as required hence transitivity is proven.

Therefore, the relation ∼ is defined on (Z)2 − {(0, 0)} by

(x1 , x2 ) ∼ (y1 , y2 )

if and only if
x1 ∗ y2 = x2 ∗ y1
is equivalent.

3 Question 3
Prove that 7|82n+2 + 113n+3 + 5 for all n ∈ N

In order to prove this statement we can use induction where we can assume that
82n+2 + 113n+3 + 5 is divisible by 7 for k and then prove it is for k + 1. We assume that:

82n+2 + 113n+3 + 5 = 7 ∗ M
where M ∈ N

First we have to prove 7|82n+2 + 113n+3 + 5 for n = 1 which is the beginning of set N

= 82∗1+2 + 113∗1+3 + 5
= 84 + 116 + 5
= 1, 775, 662

Page 4
 Will Aching

= 7 ∗ 253, 666
= 7 ∗ M, M = 253, 666

Then we assume 7|82n+2 + 113n+3 + 5 is true for n = k

82k+2 + 113k+3 + 5 = 7 ∗ M

Now we can prove true for n = k + 1

= 82k+4 + 113k+6 + 5

= 82 ∗ (82k+2 ) + 113 ∗ (113k+3 ) + 5

= 82 ∗ (82k+2 ) + 113 ∗ (113k+3 ) + 5
= 82 ∗ (82k+2 ) + 82 ∗ (113k+3 ) − 82 ∗ (113k+3 ) + 113 ∗ (113k+3 ) + 82 ∗ 5 − 82 ∗ 5 + 5
= 82 ∗ (82k+2 + 113k+3 + 5) − 82 ∗ (113k+3 ) + 113 ∗ (113k+3 ) − 82 ∗ 5 + 5

2k+2
From our assumption + 113k+3 + 5 = 7 ∗ M , hence:

= 82 ∗ (7 ∗ M ) + (113 − 82 ) ∗ (113k+3 ) − 320 + 5

= 82 ∗ (7 ∗ M ) + (1267) ∗ (113k+3 ) − 315

Now, 1267 = 7*181 and 315 = 7*45, therefore

= 82 ∗ (7 ∗ M ) + (7 ∗ 181) ∗ (113k+3 ) − 7 ∗ 45

= 7 ∗ (82 ∗ (M ) + 181 ∗ (113k+3 ) − 45)

Since M ∈ N and integer raised to the power of an integer and integer multiplication equals
another integer which will be in N. We can see that for n = k + 1

=7∗Q
Q = (82 ∗ (M ) + 181 ∗ (113k+3 ) − 45)
where Q ∈ N

Thus since 82n+2 + 113n+3 + 5 is divisible by 7 when n = 1 and by induction it is also

divisible by 7 for n = 2 and n = 3 and so on. Thus 82n+2 + 113n+3 + 5 is divisible by 7 for
all n ∈ N.

Page 5