Determine whether ##125## is a unit in ##\mathbb{Z_471}##

  • Context: Undergrad 
  • Thread starter Thread starter chwala
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on determining whether the element ##125## is a unit in the ring ##\mathbb{Z_{471}}##. It is established that an element is a unit if and only if the greatest common divisor (gcd) of the element and the modulus is 1. The Euclidean algorithm is employed to find the gcd, leading to the conclusion that the multiplicative inverse of ##121## modulo ##471## is ##109##. The back-substitution method is highlighted as a valid approach to derive the solution.

PREREQUISITES
  • Understanding of modular arithmetic in ##\mathbb{Z_n}##
  • Familiarity with the Euclidean algorithm for computing gcd
  • Knowledge of back-substitution techniques in number theory
  • Basic concepts of multiplicative inverses in modular systems
NEXT STEPS
  • Study the properties of units in modular arithmetic
  • Learn advanced techniques for the Euclidean algorithm
  • Explore applications of multiplicative inverses in cryptography
  • Investigate the Chinese Remainder Theorem and its relation to modular systems
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in modular arithmetic and its applications in cryptography and algorithm design.

chwala
Gold Member
Messages
2,828
Reaction score
420
TL;DR
Allow me to post the screen shot of what the text has indicated as the steps, ...which i cannot follow fully as they have talked of back-substitution.
This is the question,

1757886540613.webp


I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1.
My understanding of backwards substitution,

...
i have using Euclidean algorithm,

##471 = 3⋅121 + 108##
##121 = 1⋅108 + 13##
##108 =8⋅13+4##
##13=3⋅4+1##
##4=4⋅1+0##

using back-substitution,

##1=13-3⋅4##
##=(121-1⋅108)-3(108-8⋅13)##
...
##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121##
##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##
##=109⋅121 - 28.471##

## 109⋅ 28 ≡ 1 (\mod 471)##

Thus, the multiplicative inverse of 121 mod 471 is 109.

I want to understand the approach that the text used. Hence, my post. Cheers.
 
Last edited:
  • Like
Likes   Reactions: Gavran
Physics news on Phys.org
The back-substitution in the context of the Euclidean algorithm is:
1=9-4⋅2,
2=29-3⋅9,
1=9-4⋅(29-3⋅9)=-4⋅29+13⋅9,
9=96-3⋅29,
1=-4⋅29+13⋅(96-3⋅29)=13⋅96-43⋅29,
29=125-1⋅96,
1=13⋅96-43⋅(125-1⋅96)=-43⋅125+56⋅96,
96=471-3⋅125,
1=-43⋅125+56⋅(471-3⋅125)=56⋅471-211⋅125=260⋅125.
 
  • Like
Likes   Reactions: chwala
chwala said:
i have using Euclidean algorithm,

##471 = 3⋅121 + 108##
##121 = 1⋅108 + 13##
##108 =8⋅13+4##
##13=3⋅4+1##
##4=4⋅1+0##

using back-substitution,

##1=13-3⋅4##
##=(121-1⋅108)-3(108-8⋅13)##
...
##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121##
##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##
##=109⋅121 - 28.471##
Although you have not used the standard step-by-step approach, your solution is also correct.
 
Thks @Gavran ,I will check on your approach...
 
  • Like
Likes   Reactions: Gavran

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 18 ·
Replies
18
Views
13K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 48 ·
2
Replies
48
Views
16K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
2
Views
700
  • · Replies 7 ·
Replies
7
Views
3K