Web-Projects/blog-static
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix a few typos (thanks, Arthur)

Browse Source
This commit is contained in:
Danila Fedorin 2021-12-31 19:32:37 -08:00
parent 97c989e465
commit 1b35ca32ac
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
content/blog/modulo_patterns/index.md
View File

@ -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: so it must be divisible). Thus, we can write:
{{< latex >}} {{< latex >}}
(b-r)|a a|(b-r)
{{< /latex >}} {{< /latex >}}
There's another notation for this type of statement, though. To say that the difference between 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 ### Sequences of Remainders
So now we know what the digit-summing algorithm is really doing. But that algorithm isn't all there 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 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? from the center?
First, let's take a closer look at our sequence of multiples. Suppose we're working with multiples First, let's take a closer look at our sequence of multiples. Suppose we're working with multiples