Update big-integer.md

manan-grover · adamant-pwn · commit 2cb831278b61 · 2024-01-04T12:19:26.000+01:00
Changed Hyperlink for Garners Algorithm.
diff --git a/src/algebra/big-integer.md b/src/algebra/big-integer.md
@@ -166,7 +166,7 @@ This method is often used for calculations modulo non-prime number M; in this ca
 
 The idea is to choose a set of prime numbers (typically they are small enough to fit into standard integer data type) and to store an integer as a vector of remainders from division of the integer by each of those primes.
 
-Chinese remainder theorem states that this representation is sufficient to uniquely restore any number from 0 to product of these primes minus one. [Garner algorithm](chinese-remainder-theorem.md) allows to restore the number from such representation to normal integer.
+Chinese remainder theorem states that this representation is sufficient to uniquely restore any number from 0 to product of these primes minus one. [Garner algorithm](garners-algorithm.md) allows to restore the number from such representation to normal integer.
 
 This method allows to save memory compared to the classical approach (though the savings are not as dramatic as in factorization representation). Besides, it allows to perform fast addition, subtraction and multiplication in time proportional to the number of prime numbers used as modulos (see [Chinese remainder theorem](chinese-remainder-theorem.md) article for implementation).
 
