The document provides a series of modular arithmetic problems and their solutions, demonstrating calculations such as finding the modulus of numbers and performing addition in modular systems. It includes specific examples with detailed steps, including the use of a Python interpreter for larger calculations. Additionally, it offers tips for further mathematical inquiries and resources for understanding hexadecimal addition.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0 ratings0% found this document useful (0 votes)
17 views9 pages
Coursera
The document provides a series of modular arithmetic problems and their solutions, demonstrating calculations such as finding the modulus of numbers and performing addition in modular systems. It includes specific examples with detailed steps, including the use of a Python interpreter for larger calculations. Additionally, it offers tips for further mathematical inquiries and resources for understanding hexadecimal addition.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 9
CS MTC :
Teta MTEC Fey]
a 17
" x >
icate lu time Y (3
Kilkavali Poowe Ue i)
Lee Teel 1g Ingredients: Pen, Paper, Python interpreter
QI: Compute 500 mod 31. Give your answer as the smallest positive integer that is
congruent with 500modulo 31, and call this number A.
‘As part of the calculation to find the answer, write 500=BxC+D, note down the values of
A,B,C,D
Process:
Substitute ur values in the process
A=500 modulo 31=4 ,, D is same as a for every q ,So D=4
Cis 31,,as it is given in the equation,C=31
Substitute C and D in the eq 500=BxC+D ,,, to obtain B
Ans is :
4,16,31,4 2: This question is about addition in modular arithmetic in the given modulus.Compute
229 + 184 (mod 36). As part of the calculation write 229+184=A+B=C(mod 36), where
A, B and Care integers between 0) and 35,
Here the actual question is 229+184(mod 36)=A+B(mod 36)=C(mod 36)
All the three equations should get the same modular div answer.
Ans:
First solve the given eq:
229+184=413
Find the mod of it,, its mod of 36 in this case
413(mod 36)=17
So C=17
U should add A and B in such a way that it equals 17
Here a can be 13 and b can be 4
So ans is
13,4,17
Ref: 3: simple logic no confusion
QQ: Find the smallest positive integer that is congruent with —37 modulo 59.
As part of the calculation write -37=A-37=B(mod 59 ).
Ans: | am writing this in pov of this question
lam taking A as 59 and B as 37(ignore the neg- sign)
The answer is AA-B
ie 59,22
ref:
2. Find the smallest pos
vith —37 modulo 59
As partof the calculation w
(mod 59).
value of crave of >
without any spaces.
For example, fA=1 and B-2enter3.2
* Correct 4)calaculate it in the same way as ques 2 ... as it has
bigger values use python interpreter ...the only diff
is that multiplication is used...
5) If
168 the ans is 13,1
181 the ans is 30,1
1814-1 (181 inverse) the ans is 25,1
MrT LCN c)
question undhi 6) compute 50266(mod 29)
Look at the first option:
504266=21415(mod 29),,,,
The actual option is
504266(mod 29)=21415(mod 29)
Ippudu such a huge values ki answer kavali
So use python compiler(sare neeke vachu le python
interpreter adhi) Use this code:
X=pow(a,b)
Y=X%c
Print(y)
For the first option:
X=pow(50,266)
Y=X%29
Print(y)
Output:28
X=pow(21,15)
Y=X%29
Print(y)
Output:8
Outputs match kaaledh kabatti wrong option For 2" option:
50“266(mod 29)=28
28(mod 29)=28
So second option correct anamata
Question lo inverse ani unte
Use multiplicative inverse modulo calculator
Online lo chala unnayi
Ikkada ee ques lo 21 inverse (mod 29 ) undhi
A ett 2 sy
(ignore modi bro) For 1%t and 24 weeks consult ur concerned did
faculty,,, did basics avi....
Tip:Mad for math hexadecimal addition ani search
cheyyandi,,, carry kuda vasthundi.....
Ee pdf pettaka kuda ,,, ye BAKARA gaadiki iddham
ani alochisthunnav kadha....
