--- a/Integer.st	Fri Mar 11 22:36:14 2016 +0000
+++ b/Integer.st	Sat Mar 12 07:23:20 2016 +0000
@@ -1,3 +1,5 @@
+"{ Encoding: utf8 }"
+
 "
  COPYRIGHT (c) 1988 by Claus Gittinger
               All Rights Reserved
@@ -754,8 +756,6 @@
     "Modified: / 15.11.1999 / 20:35:20 / cg"
 ! !
 
-
-
 !Integer class methodsFor:'class initialization'!
 
 initialize
@@ -801,7 +801,6 @@
     "Modified: 18.7.1996 / 12:26:38 / cg"
 ! !
 
-
 !Integer class methodsFor:'prime numbers'!
 
 flushPrimeCache
@@ -1177,7 +1176,6 @@
     ^ self == Integer
 ! !
 
-
 !Integer methodsFor:'*Roe'!
 
 acceptRoeVisitor: aVisitor
@@ -3099,8 +3097,7 @@
 factorial
     "return fac(self) (i.e. 1*2*3...*self).
      This chooses a good algorithm, based on the receiver.
-     Some heuristics here, which has to do with the speed of largeInteger
-     arrithmetic."
+     Some heuristics here, which has to do with the speed of largeInteger arithmetic."
 
     (self <= 20) ifTrue:[
         self < 0 ifTrue:[
@@ -3485,7 +3482,7 @@
     ^ fibUsingDict value:self
 
     "the running time is mostly dictated by the LargeInteger multiplication performance...
-     (therefore, we get O(n) execution times, even for a linear number of multiplications)
+     (therefore, we get O(n²) execution times, even for a linear number of multiplications)
 
      Time millisecondsToRun:[50000 fib_iterative]  312    (DUO 1.7Ghz CPU)
      Time millisecondsToRun:[50000 fib_helper]     109
@@ -4863,7 +4860,6 @@
     "Created: / 09-01-2012 / 17:18:06 / cg"
 ! !
 
-
 !Integer methodsFor:'special modulo arithmetic'!
 
 add_32:anInteger