From 7fa2aa32e1cfcaa7ae1855f2f4ab5dc52cafbdf8 Mon Sep 17 00:00:00 2001
From: Zhiyang Lu <103179313+alfaloo@users.noreply.github.com>
Date: Mon, 16 Jun 2025 08:29:13 +0800
Subject: [PATCH] Fix link in chapter 7.4

---
 content/english/hpc/number-theory/montgomery.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/content/english/hpc/number-theory/montgomery.md b/content/english/hpc/number-theory/montgomery.md
index 0eeef0b0..f23326d9 100644
--- a/content/english/hpc/number-theory/montgomery.md
+++ b/content/english/hpc/number-theory/montgomery.md
@@ -37,7 +37,7 @@ int faster_sum(int *a, int n) {
 }
 ```
 
-However, sometimes you only have a chain of modular multiplications, and there is no good way to eel out of computing the remainder of the division — other than with the [integer division tricks](../hpc/arithmetic/division/) requiring a constant modulo and some precomputation.
+However, sometimes you only have a chain of modular multiplications, and there is no good way to eel out of computing the remainder of the division — other than with the [integer division tricks](/hpc/arithmetic/division/) requiring a constant modulo and some precomputation.
 
 But there is another technique designed specifically for modular arithmetic, called *Montgomery multiplication*.