Expand knowledge base, change text alignment

1 files changed, 1 insertions, 1 deletions

diff --git a/content/know/concept/shors-algorithm/index.pdc b/content/know/concept/shors-algorithm/index.pdc
index 0700408..3e3c05a 100644
--- a/content/know/concept/shors-algorithm/index.pdc
+++ b/content/know/concept/shors-algorithm/index.pdc
@@ -243,7 +243,7 @@ which is $\mathcal{O}(q^2 (\log{q}) \log{\log{q}})$
 and therefore worse than the QFT,
 yielding a total complexity of $\mathcal{O}(q^2 (\log{q})^2 \log{\log{q}})$.
 
-OK, but what does $s$ have to do factorizing integers?
+OK, but what does $s$ have to do with factorizing integers?
 Well, recall that $f$ is given by:
 
 $$\begin{aligned}