From 85b27bdee71eb2d53c16c459dd8099f33abf38b4 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Thu, 9 Feb 2017 00:18:42 +0200
Subject: [PATCH] Wilson's theorem

---
 luku21.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/luku21.tex b/luku21.tex
index 68aaee3..dd12ddc 100644
--- a/luku21.tex
+++ b/luku21.tex
@@ -697,8 +697,8 @@ For example, the number 11 is prime, because
 and the number 12 is not prime, because
 \[11! \bmod 12 = 0 \neq 11.\]
 
-Hence, Wilson's theorem tells us whether a number
-is prime. However, in practice, the theorem cannot be
+Hence, Wilson's theorem can be used to find out
+whether a number is prime. However, in practice, the theorem cannot be
 applied to large values of $n$, because it is difficult
 to calculate the value of $(n-1)!$ when $n$ is large.