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

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

Discussion Overview

The discussion revolves around determining whether the element 125 is a unit in the modular arithmetic system ##\mathbb{Z_{471}}##. Participants explore the concept of units in this context, specifically through the use of the Euclidean algorithm and back-substitution methods.

Discussion Character

  • Exploratory
  • Technical explanation
  • Mathematical reasoning

Main Points Raised

  • One participant explains that an element is a unit in ##\mathbb{Z_n}## if and only if the greatest common divisor (gcd) of the element and n equals 1, and they demonstrate this using the Euclidean algorithm.
  • Another participant provides a detailed back-substitution process to show how to express 1 as a linear combination of 125 and 471, suggesting that 125 may be a unit.
  • A third participant reiterates their own use of the Euclidean algorithm and back-substitution, confirming the correctness of the second participant's approach while noting the difference in presentation style.
  • One participant expresses gratitude and indicates they will review the second participant's method.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the status of 125 as a unit in ##\mathbb{Z_{471}}##, as the discussion focuses on methods rather than definitive conclusions about the unit status.

Contextual Notes

The discussion includes various approaches to the problem, and the correctness of the mathematical steps is not established as a consensus. There may be limitations in the clarity of assumptions or definitions used by participants.

chwala
Gold Member
Messages
2,828
Reaction score
425
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
834
  • · Replies 7 ·
Replies
7
Views
3K