algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

pre-commit autoupdate 2025-09-11 (#12963)

Browse Source 
* pre-commit autoupdate 2025-09-11

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2025-09-13 00:56:14 +02:00
committed by GitHub
parent 18c853d301
commit 63180d7e24
16 changed files with 33 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
maths/chinese_remainder_theorem.py
View File

@@ -65,7 +65,7 @@ def invert_modulo(a: int, n: int) -> int:
1
"""
(b, x) = extended_euclid(a, n)
(b, _x) = extended_euclid(a, n)
if b < 0:
b = (b % n + n) % n
return b

4
maths/modular_division.py
View File

@@ -31,7 +31,7 @@ def modular_division(a: int, b: int, n: int) -> int:
assert n > 1
assert a > 0
assert greatest_common_divisor(a, n) == 1
(d, t, s) = extended_gcd(n, a) # Implemented below
(_d, _t, s) = extended_gcd(n, a) # Implemented below
x = (b * s) % n
return x
@@ -47,7 +47,7 @@ def invert_modulo(a: int, n: int) -> int:
1
"""
(b, x) = extended_euclid(a, n) # Implemented below
(b, _x) = extended_euclid(a, n) # Implemented below
if b < 0:
b = (b % n + n) % n
return b