From 8b2995f5935fc1d6b0c8c05b8122a3dd38c551dc Mon Sep 17 00:00:00 2001
From: Abhik Banerjee <106070541+abhik-wil@users.noreply.github.com>
Date: Thu, 5 Jan 2023 14:10:34 +0530
Subject: [PATCH] Updated background.md

Please refer to this issue: https://github.com/iden3/circom/issues/137
---
 mkdocs/docs/background/background.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/mkdocs/docs/background/background.md b/mkdocs/docs/background/background.md
index bc94e7b7f..788f1f324 100644
--- a/mkdocs/docs/background/background.md
+++ b/mkdocs/docs/background/background.md
@@ -59,7 +59,7 @@ If we have an arithmetic circuit with signals `s_1,...,s_n`, then we define a **
 
 `(a_1*s_1 + ... + a_n*s_n) * (b_1*s_1 + ... + b_n*s_n) + (c_1*s_1 + ... + c_n*s_n) = 0`
 
-Note that constraint **must be quadratic, linear or constant equations**, and sometimes, by doing small modifications \(like a change of variable or gathering two constraints\), it is possible to reduce the number of constraints or variables. In general, circuits will have several constraints \(typically, one per multiplicative gate\). The set of constraints describing the circuit is called **rank-1 constraint system** \(R1CS\):
+Note that constraint **must be quadratic, linear or constant equations**, and sometimes, by doing small modifications \\( like a change of variable or gathering two constraints \\), it is possible to reduce the number of constraints or variables. In general, circuits will have several constraints \\( typically, one per multiplicative gate \\). The set of constraints describing the circuit is called **rank-1 constraint system** \\( R1CS \\):
 
 `(a_11*s_1 + ... + a_1n*s_n)*(b_11*s_1 + ... + b_1n*s_n) + (c_11*s_1 + ... + c_1n*s_n) = 0 `