From 075683cdf4588fe16f41d9f7b46b9720b42b2553 Mon Sep 17 00:00:00 2001
From: Prefetch
Date: Wed, 17 Jul 2024 10:01:43 +0200
Subject: Improve knowledge base

---
 source/know/concept/bernstein-vazirani-algorithm/index.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'source/know/concept/bernstein-vazirani-algorithm/index.md')

diff --git a/source/know/concept/bernstein-vazirani-algorithm/index.md b/source/know/concept/bernstein-vazirani-algorithm/index.md
index 884cca3..4f36d3c 100644
--- a/source/know/concept/bernstein-vazirani-algorithm/index.md
+++ b/source/know/concept/bernstein-vazirani-algorithm/index.md
@@ -24,8 +24,8 @@ of $$x$$ with an unknown $$N$$-bit string $$s$$:
 
 $$\begin{aligned}
     f(x)
-    = s \cdot x \:\:(\bmod \: 2)
-    = (s_1 x_1 + s_2 x_2 + \:...\: + s_N x_N) \:\:(\bmod \: 2)
+    \equiv s \cdot x \:\bmod 2
+    = (s_1 x_1 + s_2 x_2 + \:...\: + s_N x_N) \:\bmod 2
 \end{aligned}$$
 
 The goal is to find $$s$$.
-- 
cgit v1.2.3