From 91881e515fe1d295c7a5f26c7a79532746fba7f3 Mon Sep 17 00:00:00 2001
From: Mattias Andrée <maandree@kth.se>
Date: Fri, 13 May 2016 20:50:39 +0200
Subject: Minor fix to the text
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Signed-off-by: Mattias Andrée <maandree@kth.se>
---
 doc/number-theory.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'doc/number-theory.tex')

diff --git a/doc/number-theory.tex b/doc/number-theory.tex
index eb57ef5..10c485b 100644
--- a/doc/number-theory.tex
+++ b/doc/number-theory.tex
@@ -216,8 +216,8 @@ $\gcd(w, a)$ can be used to extract a factor
 of $a$. This factor is however not necessarily,
 and unlikely so, prime, but can be composite,
 or even 1. In the latter case this becomes
-utterly useless, and therefore using this
-method for prime factorisation is a bad idea.
+utterly useless. Therefore using this method
+for prime factorisation is a bad idea.
 
 Below is pseudocode for the Miller–Rabin primality
 test with witness return.
-- 
cgit v1.2.3-70-g09d2

