diff --git a/src/string/prefix-function.md b/src/string/prefix-function.md index 63c681771..ae89912b2 100644 --- a/src/string/prefix-function.md +++ b/src/string/prefix-function.md @@ -225,7 +225,7 @@ As a result, it turns out that all blocks are equal, therefore we can compress t Of course we still need to show that this is actually the optimum. Indeed, if there was a smaller compression than $k$, than the prefix function at the end would be greater than $n - k$. -Therefore $k$ has is really the answer. +Therefore $k$ is really the answer. Now let us assume that $n$ is not divisible by $k$. We show that this implies that the length of the answer is $n$. pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy