Scribd
Upload
194 views

Math 300 WK 2

This worksheet contains problems involving concepts from chapters 2, 3 and 5 of MATH 300.1 such as using the Euclidean algorithm and extended Euclidean algorithm to find greatest common divisors and integer solutions to linear Diophantine equations. It also contains problems involving properties of integers modulo n, Fermat's little theorem, Euler's theorem, and determining whether given relations on integers are reflexive, symmetric or transitive.

Uploaded by

Hazel Clemente Carreon
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
194 views

Math 300 WK 2

This worksheet contains problems involving concepts from chapters 2, 3 and 5 of MATH 300.1 such as using the Euclidean algorithm and extended Euclidean algorithm to find greatest common divisors and integer solutions to linear Diophantine equations. It also contains problems involving properties of integers modulo n, Fermat's little theorem, Euler's theorem, and determining whether given relations on integers are reflexive, symmetric or transitive.

Uploaded by

Hazel Clemente Carreon
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/ 1

MATH 300.

WORKSHEET 2

Chapters 2, 3 and 5:
Use the Euclidean Algorithm in the following problems.
1. Find the quotient and remainder when b is divided by a.
(a) a = 11, b = 231,
(b) a = 17, b = 182.
2. Find the greatest common divisor gcd(a, b).
(a) a = 598, b = 132,
(b) a = 432, b = 282.
Use the Extended Euclidean Algorithm in the following problems.
3. Write gcd(100, 35) in the form 100x + 35y for some x, y Z.
4. Find one integer solution, if there is one, of the linear Diophantine equations:
(a) 14x + 18y = 9,
(b) 11x + 15y = 5.
5. Find all integer solutions of the linear Diophantine equation 15x 24y = 9.
6. Find all positive integer solutions of the linear Diophantine equation 20x + 25y = 200.
7. Solve the linear congruences:
(a) 4x 6 (mod 14)
(b) 29x 43 (mod 128).
Miscellaneous (use properties of Zm , Fermats little, Euler-Fermat, street smart, etc.)
8. If 2p2 = q 3 ,where p, q Z, show that 2 is a common divisor of p and q.
9. Show that 3 4 and 1 2 are not rational numbers.
10. Construct the addition and multiplication tables for Z5 .
11. Solve for x Z: x6 6x (mod 7).
12. Find the multiplicative inverse of [3] in Z41 .
13. Find the remainder when 14181 is divided by 99.
Problems involving the concepts relation and equivalence relation.
14. Determine whether the following relations on Z are reflexive, symmetric, or transitive.
(a) aRb if and only if a + b 6= 1.
(b) aRb if and only if a b 0.
(c) aRb if and only if a 6= b.
15. Show that the following relation is an equivalence relation: for any non-zero real
numbers a and b, aRb if and only if ab1 Q.

You might also like