Scribd
Upload
34 views

Multiplicative Inverse

Uploaded by

sakshi.ghadigaonkar17618
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
34 views

Multiplicative Inverse

Uploaded by

sakshi.ghadigaonkar17618
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

2.1.

4 Continued

Note Greatest Common Divisor

The greatest common divisor of two


positive integers is the largest integer
that can divide both integers.

Note Euclidean Algorithm

Fact 1: gcd (a, 0) = a


Fact 2: gcd (a, b) = gcd (b, r), where r is
the remainder of dividing a by b
2.1
2.1.4 Continued
Figure 2.7 Euclidean Algorithm

Note

When gcd (a, b) = 1, we say that a and b


are relatively prime.
2.2
2.1.4 Continued

Note

When gcd (a, b) = 1, we say that a and b


are relatively prime.

2.3
2.1.4 Continued
Example 2.7
Find the greatest common divisor of 2740 and 1760.
Solution
We have gcd (2740, 1760) = 20.

2.4
2.1.4 Continued
Example 2.8
Find the greatest common divisor of 25 and 60.

Solution
We have gcd (25, 65) = 5.

2.5
2.2.5 Continue
Multiplicative Inverse
In Zn, two numbers a and b are the multiplicative inverse of each
other if

Note

In modular arithmetic, an integer may or


may not have a multiplicative inverse.
When it does, the product of the integer
and its multiplicative inverse is
congruent to 1 modulo n.
2.6
2.2.5 Continued

Example 2.22
Find the multiplicative inverse of 8 in Z10.
Solution
There is no multiplicative inverse because gcd (10, 8) = 2 ≠ 1. In
other words, we cannot find any number between 0 and 9 such
that when multiplied by 8, the result is congruent to 1.
Example 2.23
Find all multiplicative inverses in Z10.

Solution
There are only three pairs: (1, 1), (3, 7) and (9, 9). The numbers
0, 2, 4, 5, 6, and 8 do not have a multiplicative inverse.
2.7
2.2.5 Continued
Example 2.24
Find all multiplicative inverse pairs in Z11.
Solution
We have seven pairs: (1, 1), (2, 6), (3, 4), (5, 9), (7, 8), (9, 5), and
(10, 10).

2.8
2.2.5 Continued

Note

The extended Euclidean algorithm finds


the multiplicative inverses of b in Zn
when n and b are given and
gcd (n, b) = 1.
The multiplicative inverse of b is the
value of t after being mapped to Zn.

2.9
2.2.5 Continued
Figure 2.15 Using extended Euclidean algorithm to
find multiplicative inverse

2.10
2.2.5 Continued
Example 2.25
Find the multiplicative inverse of 11 in Z26.
Solution

The gcd (26, 11) is 1; the inverse of 11 is −7 or 19.


2.11
2.2.5 Continued
Example 2.26
Find the multiplicative inverse of 23 in Z100.
Solution

The gcd (100, 23) is 1; the inverse of 23 is −13 or 87.


2.12
2.2.5 Continued
Example 2.27
Find the inverse of 12 in Z26.
Solution

The gcd (26, 12) is 2; the inverse does not exist.

2.13
2.2.6 Addition and Multiplication Tables
Figure 2.16 Addition and multiplication table for Z10

2.14
1. Find the inverse of 17 in Z26
2. Find the inverse of 43 in Z75

You might also like