Commit: f08e01af6b80b197a203f3c61b449905829e011d - GaloisField (hg)

A small kernel of code for playing with Galois fields of arbitrary characteristic

Commit MetaInfo

• Revision: f08e01af6b80b197a203f3c61b449905829e011d (tree)
• Zeit: 2021-07-19 05:32:33
• Autor: Eric Hopper <hopper@omni...>
• Commiter: Eric Hopper

Log Message

Fix comment. (Why did I use '^{' and not '*'?!?)}

Ändern Zusammenfassung

• modified: numtheory_utils.py

Diff

diff -r 54f6125563fe -r f08e01af6b80 numtheory_utils.py
--- a/numtheory_utils.py	Sun Mar 28 15:42:16 2021 -0700
+++ b/numtheory_utils.py	Sun Jul 18 13:32:33 2021 -0700
@@ -7,13 +7,15 @@
 
 def extended_gcd(x: int, y: int):
     """Return a tuple 't' with three elements such that:
-    t[0) * x + t[1] * y == t[2]
+    t[0] * x + t[1] * y == t[2]
 
     t[2] will be either 0 or 1. If it is zero, then x and y are not
     relatively prime. If it is one, then they are.
 
     This makes use of Euclid's algorithm for finding the GCD, but extends it
     to keep track of the extra data returned in t[0] and t[1].
+
+    GCD = Greatest Common Denominator
     """
     sx = 1 if x > 0 else -1
     x = abs(x)