From 1b35ca32ac2066deab1a6cc9c0c2f2b475d7e4fb Mon Sep 17 00:00:00 2001 From: Danila Fedorin Date: Fri, 31 Dec 2021 19:32:37 -0800 Subject: [PATCH] Fix a few typos (thanks, Arthur) --- content/blog/modulo_patterns/index.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/blog/modulo_patterns/index.md b/content/blog/modulo_patterns/index.md index 8fb4307..9fd5add 100644 --- a/content/blog/modulo_patterns/index.md +++ b/content/blog/modulo_patterns/index.md @@ -115,7 +115,7 @@ deduce that \\(b-r\\) is divisible by \\(a\\) (it's literally equal to \\(a\\) t so it must be divisible). Thus, we can write: {{< latex >}} - (b-r)|a + a|(b-r) {{< /latex >}} There's another notation for this type of statement, though. To say that the difference between @@ -203,7 +203,7 @@ The results are similarly cool: ### Sequences of Remainders So now we know what the digit-summing algorithm is really doing. But that algorithm isn't all there is to it! We're repeatedly applying this algorithm over and over to multiples of another number. How -does this work, and why does it always loop around? Why don't we ever spiral further and further +does this work, and why does it always loop around? Why don't we ever spiral farther and farther from the center? First, let's take a closer look at our sequence of multiples. Suppose we're working with multiples