From e4787a3a03fbe819e28e7dc438fa2388537c9419 Mon Sep 17 00:00:00 2001 From: gui martins Date: Sun, 7 Dec 2025 12:33:12 -0300 Subject: [PATCH] fix montgomery.md typo --- 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..fede0c3b 100644 --- a/content/english/hpc/number-theory/montgomery.md +++ b/content/english/hpc/number-theory/montgomery.md @@ -290,4 +290,4 @@ int inverse(int _a) { While vanilla binary exponentiation with a compiler-generated fast modulo trick requires ~170ns per `inverse` call, this implementation takes ~166ns, going down to ~158ns we omit `transform` and `reduce` (a reasonable use case is for `inverse` to be used as a subprocedure in a bigger modular computation). This is a small improvement, but Montgomery multiplication becomes much more advantageous for SIMD applications and larger data types. -**Exercise.** Implement efficient *modular* [matix multiplication](/hpc/algorithms/matmul). +**Exercise.** Implement efficient *modular* [matrix multiplication](/hpc/algorithms/matmul).