Fixed formatting on fast-inv-square.md and corrected references.

Author: JasonGiedymin

chapters/math/fast-inv-square.md

@@ -5,20 +5,20 @@ chapter: Math
 ---
 ## Problem
 
-You would like to calculate a the inverse square root[5] of a number quickly.
+You would like to calculate a the inverse square root of a number [quickly][5].
 
 ## Solution
-Appearing in the Quake III Arena source code[1], this strange algorithm uses
+Appearing in the Quake III Arena [source code][1], this strange algorithm uses
 integer operations along with a 'magic number' to calculate floating point
 approximation values of inverse square roots.
 
 In this CoffeeScript variant I supply the original classic, and newer optimal
-32 bit magic numbers found by Chris Lomont[2]. Also supplied is the 64-bit
+32 bit magic numbers found by [Chris Lomont][2]. Also supplied is the 64-bit
 sized magic number.
 
 Another feature included is the ability to alter the level of precision.
-This is done by controling the number of iterations for performing Newton's
-method[3].
+This is done by controling the number of iterations for performing [Newton's
+method][3].
 
 Depending on the machine and level of percision this algorithm may still
 provide performance increases over the classic.
@@ -29,14 +29,20 @@ To run this, compile the script with coffee:
 Then copy & paste the compiled js code in to the JavaSript console of your
 browser.
 
-Note: You will need a browser which supports typed-arrays[4].
+Note: You will need a browser which supports [typed-arrays][4].
 
-References: 
-* [1] [ftp://ftp.idsoftware.com/idstuff/source/quake3-1.32b-source.zip](ftp://ftp.idsoftware.com/idstuff/source/quake3-1.32b-source.zip)
-* [2] [http://www.lomont.org/Math/Papers/2003/InvSqrt.pdf](http://www.lomont.org/Math/Papers/2003/InvSqrt.pdf)
-* [3] [http://en.wikipedia.org/wiki/Newton%27s_method](http://en.wikipedia.org/wiki/Newton%27s_method)
-* [4] [https://developer.mozilla.org/en/JavaScript_typed_arrays](https://developer.mozilla.org/en/JavaScript_typed_arrays)
-* [5] [http://en.wikipedia.org/wiki/Fast_inverse_square_root](http://en.wikipedia.org/wiki/Fast_inverse_square_root)
+References:
+1. [ftp://ftp.idsoftware.com/idstuff/source/quake3-1.32b-source.zip](ftp://ftp.idsoftware.com/idstuff/source/quake3-1.32b-source.zip)
+2. [http://www.lomont.org/Math/Papers/2003/InvSqrt.pdf](http://www.lomont.org/Math/Papers/2003/InvSqrt.pdf)
+3. [http://en.wikipedia.org/wiki/Newton%27s_method](http://en.wikipedia.org/wiki/Newton%27s_method)
+4. [https://developer.mozilla.org/en/JavaScript_typed_arrays](https://developer.mozilla.org/en/JavaScript_typed_arrays)
+5. [http://en.wikipedia.org/wiki/Fast_inverse_square_root](http://en.wikipedia.org/wiki/Fast_inverse_square_root)
+
+[1]: ftp://ftp.idsoftware.com/idstuff/source/quake3-1.32b-source.zip "ftp://ftp.idsoftware.com/idstuff/source/quake3-1.32b-source.zip"
+[2]: http://www.lomont.org/Math/Papers/2003/InvSqrt.pdf "http://www.lomont.org/Math/Papers/2003/InvSqrt.pdf"
+[3]: http://en.wikipedia.org/wiki/Newton%27s_method "http://en.wikipedia.org/wiki/Newton%27s_method"
+[4]: https://developer.mozilla.org/en/JavaScript_typed_arrays "https://developer.mozilla.org/en/JavaScript_typed_arrays"
+[5]: http://en.wikipedia.org/wiki/Fast_inverse_square_root "http://en.wikipedia.org/wiki/Fast_inverse_square_root"
 
 This code is in gist form here:
 [https://gist.github.com/1036533](https://gist.github.com/1036533)
@@ -50,7 +56,7 @@ Author: Jason Giedymin <jasong _a_t_ apache -dot- org>
 
 Appearing in the Quake III Arena source code[1], this strange algorithm uses
 integer operations along with a 'magic number' to calculate floating point
-approximation values of inverse square roots.
+approximation values of inverse square roots[5].
 
 In this CoffeeScript variant I supply the original classic, and newer optimal
 32 bit magic numbers found by Chris Lomont[2]. Also supplied is the 64-bit
@@ -76,6 +82,7 @@ References:
 [2] http://www.lomont.org/Math/Papers/2003/InvSqrt.pdf
 [3] http://en.wikipedia.org/wiki/Newton%27s_method
 [4] https://developer.mozilla.org/en/JavaScript_typed_arrays
+[5] http://en.wikipedia.org/wiki/Fast_inverse_square_root
 
 ###