Scribd
Upload
17 views

Assignment Week 8

The purpose of the document is to assess understanding of division algorithm and modular arithmetic. Students are asked to find the greatest common divisor of two two-digit numbers, choose a modular arithmetic operation and find identities and inverses, and solve an equation modulo 3.

Uploaded by

johnnydepp4208
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views

Assignment Week 8

The purpose of the document is to assess understanding of division algorithm and modular arithmetic. Students are asked to find the greatest common divisor of two two-digit numbers, choose a modular arithmetic operation and find identities and inverses, and solve an equation modulo 3.

Uploaded by

johnnydepp4208
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Purpose of this assignment:

The purpose of this assignment is to assess your understanding of Division algorithm and

modular arithmetic. Through this assignment, you will be able to demonstrate your knowledge

and problem-solving skills in these areas.

Tasks:

This week you have learned about the concepts of Division algorithm and modular arithmetic.

To demonstrate your understanding of these concepts, please answer the following questions.

Please ensure that you do not use the same examples discussed in the textbooks and resources.

1. Choose a pair of two-digit numbers and find their greatest common divisor. Show the steps.

Solution:

In order to determine the greatest common divisor for a pair of two positive integers (a, b),
follow the steps listed below:
 Write the factor of positive integer “a”.
 Write the factor of positive integer “b”.
 Identify the common divisor of “a” and “b”.
 Find the divisor that is the largest among the common divisors of “a” and “b”.
Let’s find the GCD of (12, 24) as follows:
 Factor of 12 =1, 2, 3, 4, 6, and 12
 Factor of 24= 1, 2, 3, 4, 6, 8, 12, and 24
 Common factor of 12 and 24= 1, 2, 3, 4, 6, and 12
 GCD(12, 24)= 12
2. Choose any one modular arithmetic operation (addition modulo or multiplication

modulo n X ) from the set of positive integers ℤ (for example, ℤ5= {0,1,2,3,4} do not use the

same example with your choice of n. Find the identities and inverses of all elements with respect
to the operation you choose. If they do not exist, explain why. You can use an operation table to

explain your reasoning. (The table can be drawn using MS Word.)

Solution:

Let Z 6={ 0 , 1 ,2 , 3 , 4 , 5 } .

Fora , b ∈ Z 6, define “addition modulo 6” as

a ⊕ 6 b=a+ b(mod 6)= remainder obtained on dividing a+ b by 6.

The Cayley table is

⊕6 0 1 2 3 4 5
0 0 1 2 3 4 5
1 1 2 3 4 5 0
2 2 3 4 5 0 1
3 3 4 5 0 1 2
4 4 5 0 1 2 3
5 5 0 1 2 3 4

The identity element is zero. The inverse of 0 and 3 is itself. The inverse of 1 is 5, inverse of 2 is 4,
inverse of 4 is 2, and the inverse of 5 is 1.

3. Find and explain solution for the equation x2+ 5x +1 = 0 in ℤ3, the integers modulo 3.

In Z3 we have 3 integers {0, 1, 2}.

1- For x=0, the equation becomes as ( 0 )2 +5 ( 0 )+1=1≠ 0


2- For x=1, the equation becomes as ( 1 )2 +5 ( 1 )+ 1=7 ≡1 ( mod 3 ) ≠ 0
3- For x=2, the equation becomes as( 2 )2 +5 ( 2 ) +1=15 ≡0 ( mod 3 ).

The solution of the equation x 2+ 5 x +1=0 in Z3 is x=2.

You might also like