0% found this document useful (0 votes)
599 views14 pages

University of Waterloo MATH 135 SAMPLE Final Examination: Instructions

This document appears to be a sample final exam for an algebra course at the University of Waterloo. It consists of 14 questions testing various algebra concepts. The exam instructions state that students must show their work, justify their answers, and may use established results from a provided reference sheet without proof. The questions cover topics like greatest common divisors, modular arithmetic, roots of polynomials, and proofs involving integers, congruences, and polynomials.

Uploaded by

Salman Habib
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
0% found this document useful (0 votes)
599 views14 pages

University of Waterloo MATH 135 SAMPLE Final Examination: Instructions

This document appears to be a sample final exam for an algebra course at the University of Waterloo. It consists of 14 questions testing various algebra concepts. The exam instructions state that students must show their work, justify their answers, and may use established results from a provided reference sheet without proof. The questions cover topics like greatest common divisors, modular arithmetic, roots of polynomials, and proofs involving integers, congruences, and polynomials.

Uploaded by

Salman Habib
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/ 14

University of Waterloo

MATH 135 SAMPLE Final Examination


Algebra for Honours Mathematics Winter 2017
Instructors: L. Haykazyan, J. Pretti, R. Kim, M. Satriano, L. Narins,
D. Sharma, J. Stephenson, M. Pei, R. Moosa

Instructions
1. Fill in your ID number and User ID above.
2. Write your answers in the space provided. If you need more room, use the last two pages, and
clearly indicate this on the question page.
3. You must justify all of your answers. Your writing needs to be legible. Your arguments must be
logical, clear and easy to understand.
4. There is a reference sheet supplied 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 list without
proof. Make sure to clearly state the name or the acronym of the result you are using.
5. There are 14 questions. The total marks available in this exam is 50.

1
For each of Questions 1 to 6, 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. What is the greatest common divisor of 1239 and 735? [2 marks]

2. What is the units digit (also known as the ones digit) of 6789 ? [2 marks]

2
3. Give all the solutions to z 3 + 27 = 0 in polar form. [3 marks]

4. You are eavesdropping on a conversation between Alice and Bob protected by the RSA system. Alice
sends Bob a public encryption key (e, n) and receives a ciphertext C. You are able to determine that
88 < n < 92 and 26 < e < 30. What are the values of n and e? [3 marks]

3
5. Determine all integers x and y such that [3 marks]

• 6x + 10y = 14, and


• x ≡ 3 (mod 7), and
• 20 < y < 40.

6. Consider the polynomial p(x) = x5 + 2x4 + 6x3 + 12x2 − 27x − 54. One root of this polynomial is 3i.
Express p(x) as a product of five linear polynomials in C[x]. [3 marks]

4
For each part below, in the box provided, indicate whether the given statement [1 mark each]
is true (T) or false (F). No justification is required.

7. (a) ¬(A ⇒ B) is logically equivalent to (¬A) ⇒ (¬B).

(b) ¬(∀x ∈ S, P (x)) is logically equivalent to ∀x ∈ S, (¬P (x)).

(c) If a, b, c, d ∈ Z, a | b, b | c, and c | d, then a | d.

(d) If a, b, c ∈ Z, and a | bc, then a | b or a | c.

(cos π4 + i sin π4 )4 1 i
(e) = +
1−i 2 2

(f) A polar form of the complex number z = −18i is 18(cos ( 3π 3π


2 ) + i sin ( 2 )).

(g) gcd(299 3100 5101 , 298 3100 5102 ) = 298 3100 5101

5
The remaining questions require proofs. Write clearly and justify your steps. Do NOT use the
amount of available space as an indication of how long your answer “should be”.

8. Let a, b, c and d be integers. Prove or disprove each of the following statements. [4 marks]

(a) If ax + by = d has an integer solution, then ax + by + cz = d has an integer solution.

(b) If ax + by + cz = d has an integer solution, then ax + by = d has an integer solution.

6
9. Prove that if w is an nth root of unity, then w1 is also an nth root of unity.
(Recall: The nth roots of unity are the nth roots of 1.) [4 marks]

7
10. Let a ∈ Z. Prove that if gcd(a, 65) = 1, then a12 ≡ 1 (mod 65). [3 marks]

8
az+b
11. Let a, b, c, d ∈ Z such that ad − bc = 1. Let f (z) : C → C be given by f (z) = cz+d . Suppose that z is a
complex number such that Im(z) > 0. Prove that Im(f (z)) > 0. [4 marks]

9
12. Suppose a, b and n are integers.
Prove that n | gcd(a, n) · gcd(b, n) if and only if n | ab. [4 marks]

10
n
X
13. Let f (x) = xk be a polynomial in Z2 [x]. [5 marks]
k=0
n
X
Prove by mathematical induction that for all n ∈ N, [f (x)]2 = x2k .
k=0

11
14. Let a and b be coprime positive integers.
Prove that {(s, t) ∈ N × N : as + bt = ab} = ∅. [3 marks]

12
This page was intentionally left blank.
You may use this space if you run out of room for a particular question.
If you do, be sure to indicate this clearly here on this page and also on the question page.

13
This page was intentionally left blank.
You may use this space if you run out of room for a particular question.
If you do, be sure to indicate this clearly here on this page and also on the question page.

14

You might also like