From 30bb6699b54aee6b1dd7c31a5b2e296c9a3d091a Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Sun, 1 Jan 2017 21:14:04 +0200
Subject: [PATCH] Small typo fix

---
 luku05.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/luku05.tex b/luku05.tex
index d751fe8..72c9be4 100644
--- a/luku05.tex
+++ b/luku05.tex
@@ -712,7 +712,7 @@ However, if the list remains the same but $x=10$,
 it is not possible to form the sum.
 
 A standard solution for the problem is to
-go trough all subsets of the elements and
+go through all subsets of the elements and
 check if the sum of any of the subsets is $x$.
 The time complexity of this solution is $O(2^n)$
 because there are $2^n$ possible subsets.