Appendix A5

A Second Year Abstract Algebra

Examination Paper
ABSTRACT ALGEBRA
Duration one hour 30 minutes
Answer 3 out of 5 questions
Instructions to candidates
1. Normal university regulations apply
2. The use of calculators is NOT permitted
3. All questions carry equal marks
4. Show all working and explain your reasoning at all times
Materials provided
1. Script answer book
2. Formulae sheet 2
1. For the sets
A = {1, 3, 7, 9}
B = {1, 2, 4, 7, 8, 11, 13, 14}
verify the equality
(A\ B) (B \ A) (A B) = A B
Prove this result for general sets, A, B. Show that A\B, B\A, and AB are disjoint sets and hence
show that
|A B| = |A| +|B| |A B|
Describe briey an application of this result.
(Total: 20 marks)
2. Explain what is meant by an equivalence relation and equivalence classes.
For m, n Z show that the relation R dened by
mRn if m n(mod 6) (i.e.: mn is divisible by 6)
213
214
is an equivalence relation, and describe the corresponding equivalence classes.
If m and n belong to the same equivalence class of R show that m + n is in the same equivalence
class for all m, n and describe this equivalence class, illustrating the result with a particular choice
of m and n.
(Total: 20 marks)
3. Dene what is meant by an associative commutative binary operation, giving an example.
Prove that , dened on Q (The set of rational numbers) by
a b = a +b + 3ab
is a commutative binary operation. Is it associative?
Determine an identity element admitted by and show that it is unique. Show that with respect to
this identity the inverse a
1
of a is given by
a
1
=
a
1 + 3a
Give an element a Q that has no inverse with respect to .
Show that the set of rational numbers is a not a group with respect to the binary operation . Find
a subset S of Q that is a group with respect to .
(Total: 20 marks)
4. Prove Lagranges Theorem- the order of every subgroup H of a nite group Gof order n is a divisor
of n.
Show that the set
G = {1, 1, i, i} (i =

1)
forms a group with respect to multiplication of complex numbers. Obtain a non-trivial subgroup
H, justifying your choice, and use it to illustrate Lagranges Theorem.
(Total: 20 marks)
5. Describe, in about 150 - 200 words, the method of encryption and decryption in the RSA algo-
rithm, dening any notation used.
If the message 11 is transmitted using modulus 33 and encryption integer e = 7, determine the
coded message sent and check your result by decoding.
Comment on the security of this message.
(Total: 20 marks)
END OF EXAMINATION PAPER