From ea201d990941c26ef522c820fbb9d46cf66cdd9a Mon Sep 17 00:00:00 2001
From: Vasu Jain <47535291+jainvasu631@users.noreply.github.com>
Date: Wed, 15 Jul 2020 06:10:26 +0530
Subject: [PATCH] [SolveSATWithGrover] Fix minor indexing error (#404)

The clause index for 1 clause k-sat problem should simply be $y_{k}$ instead of $y_{ik}$. There is no iteration over i here - that occurs in Task 1.6 where there are more than one clause and $i$ is and index over those.
---
 SolveSATWithGrover/SolveSATWithGrover.ipynb | 2 +-
 SolveSATWithGrover/Tasks.qs                 | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/SolveSATWithGrover/SolveSATWithGrover.ipynb b/SolveSATWithGrover/SolveSATWithGrover.ipynb
index 3d8b9cd3b13..1f78b5199f7 100644
--- a/SolveSATWithGrover/SolveSATWithGrover.ipynb
+++ b/SolveSATWithGrover/SolveSATWithGrover.ipynb
@@ -233,7 +233,7 @@
     "> For SAT problems, $f(x)$ is represented as a conjunction (an AND operation) of several clauses on $N$ variables,\n",
     "and each clause is a disjunction (an OR operation) of **one or several** variables or negated variables:\n",
     ">\n",
-    "> $$clause(x) = \\bigvee_k y_{ik},\\text{ where }y_{ik} =\\text{ either }x_j\\text{ or }\\neg x_j\\text{ for some }j \\in \\{0, \\dots, N-1\\}$$\n",
+    "> $$clause(x) = \\bigvee_k y_{k},\\text{ where }y_{k} =\\text{ either }x_j\\text{ or }\\neg x_j\\text{ for some }j \\in \\{0, \\dots, N-1\\}$$\n",
     ">\n",
     "> For example, one of the possible clauses on two variables is:\n",
     ">\n",
diff --git a/SolveSATWithGrover/Tasks.qs b/SolveSATWithGrover/Tasks.qs
index 33c3710d3a7..615757dbe59 100644
--- a/SolveSATWithGrover/Tasks.qs
+++ b/SolveSATWithGrover/Tasks.qs
@@ -103,7 +103,7 @@ namespace Quantum.Kata.GroversAlgorithm {
     // 
     // For general SAT problems, f(x) is represented as a conjunction (an AND operation) of several clauses on N variables, 
     // and each clause is a disjunction (an OR operation) of one or several variables or negated variables:
-    //      clause(x) = ∨ₖ yᵢₖ, where yᵢₖ = either xⱼ or ¬xⱼ for some j in {0, ..., N-1}
+    //      clause(x) = ∨ₖ yₖ, where yₖ = either xⱼ or ¬xⱼ for some j in {0, ..., N-1}
     // 
     // For example, one of the possible clauses on two variables is 
     //      clause(x) = x₀ ∨ ¬x₁