Sei sulla pagina 1di 14

University of Waterloo

Sample MATH 135 Final Examination


Term: Fall

Year: 2014

Provide the following identifying information. Please print legibly using CAPITAL letters.
Family name:

Given name:
USERNAME

SECTION

ID number:

Course abbreviation and number:

MATH 135

Course title:

Algebra for Honours Mathematics

Date of exam:

December 09, 2014

Exam period:

12:30 PM to 3:00 PM

Duration of exam:

2 hours 30 minutes

Number of exam pages:

14 (includes cover page)

Exam type:

Closed book

Materials allowed:

No additional materials are allowed


Additional instructions:

1. Complete the identity section above.


2. Write your answers in the space provided. If you need more room, use pages 13 - 14, and indicate this
on the question.
3. Do NOT detach any paper from this exam.
4. Your writing needs to be legible. Your arguments must be logical, clear and easy to understand.
5. There is a Proposition Sheet page provided separately from this exam booklet. There you will find some
of the major propositions that were covered in class. You may use any result from the proposition sheet
without proof. Make sure to clearly state the name or the acronym of the result you are using.
6. There are 13 questions. The total marks available in this exam is 50.

For each of Questions 1 to 4, full marks will be given for a correct answer which is placed in the box
provided. Part marks will only be awarded if relevant work is shown in the space provided.
1. Find integers x and y so that 27x + 35y = 1.

[3 marks]

2. Find all complex number solutions to the equation x4 16 = 0. Give your answers in standard form.
[2 marks]

3. Find real numbers


r 0 and 0 < 2 such that 1

number 1 3i)

4. Find all solutions to the equation x2 = [1] in Z5 .

3i = rei (this is the exponential form of the complex


[2 marks]

[2 marks]

For each part of Question 5 in the box provided, indicate whether the given statement is true (T) or false (F).
No justification is required.
1.5 marks will be given for each correct answer.
0.5 marks will be deducted for each incorrect answer.
If you choose not to answer a part (i.e. you leave the box for that part empty), you will receive 0.5
marks for that part.
The minimum mark for this question will be 0.
5.

[9 marks]

(a) The negation of A B is A (B).

(b) The polynomial x3 3x2 + x + 2 has a rational root.

(c) 75 is a valid n in the RSA encryption scheme.

(d) If f (z) is a polynomial with complex coefficients and z = i is a root of f (z), then z = i must also be a
root of f (z).

(e) A B is logically equivalent to (B) (A).

(f) 1 + i is an eighth root of unity.

Questions 6 and 7 involve more computation.


For full marks, you must show work that justifies your final answer.
6. Find all solutions z C to the equation z =

1+8i
2z .

Express your answers in standard form.

[5 marks]

7.

(a) Find the prime factorization of gcd(5! , 2880).

[2 marks]

(b) How many positive divisors does gcd(5! , 2880) have?

[2 marks]

The remaining questions require you to write proofs. Write clearly and justify your steps.
Do NOT use the amount of space provided as an indication of how long your answer should be.
8. Let p be a prime and a be an integer such that p - a. Consider the two sets
S = {x N | ax 1 (mod p) },
T = {n(p 1) | n N }.
Prove that T S.

[2 marks]

9. Let p be any prime number. Prove that the linear congruence


px 6
has a solution x Z.

(mod 18)
[3 marks]

10. Prove the following proposition:


Proposition 1. Let p, q N be coprime and let x be an integer satisfying
xp

(mod q)

x q (mod p)
then x p + q (mod pq).

[3 marks]

11. Let c = a + bi be a complex number in standard form, with b , 0, and let f (x) C[x] be a polynomial.
Suppose further that all of the coefficients of f (x) are real numbers. Prove that f (c) = 0 if and only if
(x2 2ax + a2 + b2 ) is a factor of f (x).
[5 marks]

12. Let p and q be distinct odd primes. Prove that gcd(p + q, p q) = 2.

[5 marks]

13. Prove that there are no integers x and y that satisfy x2 + 3y2 = 8.

[5 marks]

This page has been left blank for rough or overflow work.
Do not tear this page off.

This page has been left blank for rough or overflow work.
Do not tear this page off.

Potrebbero piacerti anche