(no commit message)

diff --git a/openpower/sv/biginteger.mdwn b/openpower/sv/biginteger.mdwn
index 18cd7b0cd7321e229d5182b1c76f61a8b7a4cf32..ac271714bd20ac526932842f5eab9e12c2ac7ece 100644 (file)
--- a/openpower/sv/biginteger.mdwn
+++ b/openpower/sv/biginteger.mdwn
@@ -108,7 +108,7 @@ operations. Such a trick works equally as well in Scalar-only.
 The simplest implementation of big-int divide is the standard schoolbook
 "Long Division", set with RADIX 64 instead of Base 10. Donald Knuth's
 Algorithm D performs estimates which, if wrong, are compensated for
-afterwards.  Essentially however there are three phases:
+afterwards.  Essentiallythere are three phases:
 
 * Calculation of the quotient estimate. This is Scalar division
   and can be ignored for the scope of this analysis