Skip to content
Snippets Groups Projects
Commit 032a0098 authored by quentin.fasler's avatar quentin.fasler
Browse files
parents eda87239 ef565b96
Branches
No related tags found
No related merge requests found
...@@ -121,6 +121,19 @@ def compute_bachet_bezout(a, b): ...@@ -121,6 +121,19 @@ def compute_bachet_bezout(a, b):
return x[-1], y[-1] return x[-1], y[-1]
def modular_inverse(a, n):
res = -1
inverse = -1
i = 0
while res != 1:
if a * i % n == 1:
res = a * i % n
inverse = i
break
i += 1
return inverse
def compute_lagrange_polynomial(points, prime_number): def compute_lagrange_polynomial(points, prime_number):
pass pass
...@@ -145,6 +158,11 @@ def main(): ...@@ -145,6 +158,11 @@ def main():
print("Pour les chiffres " + str(a) + " et " + str(b) + print("Pour les chiffres " + str(a) + " et " + str(b) +
". Les coéfficients de Bachet-Bézout sont : " + str(x) + " et " + str(y)) ". Les coéfficients de Bachet-Bézout sont : " + str(x) + " et " + str(y))
a = 3
b = 7
print("Inverse modulaire de " + str(a) + " % " +
str(b) + " est " + str(modular_inverse(a, b)))
with open("messages.json") as f: with open("messages.json") as f:
messages = json.load(f) messages = json.load(f)
print(len(messages)) print(len(messages))
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment