Let S be your student number
Ask Expert

  • Your study cart is empty!

Be Prepared For The Toughest Questions

Practice Problems

Let S be your student number

Section B

Q 6. (a) Let S be your student number. Calculate the following:

R5(S)     RS(42)     R25(S)     RS(−2022)

(b) Calculate the following:

9 ⊗11 7     11 ⊗9 7     9 ⊗7 11     221 ⊗11 43

(c) Use Euclid’s Algorithm to calculate gcd(135, 189). 

(d) Use (c) to find integers x and y such that gcd(135, 189) = x·135+y·189. 

(e) Use (c) to find lcm(135, 189).

(f) Use Euclid’s algorithm to show that gcd(70, 221) = 1. Thus find the multiplicative inverse of 70 in U221.

Hint
Computerf. The Euclidean Algorithm for finding GCD(A,B) is as follows: If A = 0 then GCD(A,B)=B, since the GCD(0,B)=B, and we can stop. If B = 0 then GCD(A,B)=A, since the GCD(A,0)=A, and we can stop. Write A in quotient remainder form (A = B⋅Q + R). The Euclidean algorithm is a way to find the greatest common divisor of two positive integers, a and b. First let me show the computations for a=210 ...
Related questions

Know the process

Students succeed in their courses by connecting and communicating with
an expert until they receive help on their questions

1
img

Submit Question

Post project within your desired price and deadline.

2
img

Tutor Is Assigned

A quality expert with the ability to solve your project will be assigned.

3
img

Receive Help

Check order history for updates. An email as a notification will be sent.

img
Unable to find what you’re looking for?

Consult our trusted tutors.

Ask a Question

Developed by Versioning Solutions.