Updated the header comments on Modular and Coprimes classes

Author: phishman3579

src/com/jwetherell/algorithms/mathematics/Coprimes.java

@@ -5,7 +5,7 @@
  * co-prime)[1] if the only positive integer that divides both of them is 1. That is, the only common positive factor 
  * of the two numbers is 1. This is equivalent to their greatest common divisor being 1.
  * <p>
- * https://en.wikipedia.org/wiki/Coprime_integers
+ * http://en.wikipedia.org/wiki/Coprime_integers
  * <br>
  * @author Szymon Stankiewicz <mail@stankiewicz.me>
  * @author Justin Wetherell <phishman3579@gmail.com>

src/com/jwetherell/algorithms/mathematics/Modular.java

@@ -1,9 +1,14 @@
 package com.jwetherell.algorithms.mathematics;
 
 /**
- * Class for modular arithmetic.
- *
- * @author Szymob Stankiewicz
+ * In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" 
+ * upon reaching a certain value—the modulus (plural moduli). The modern approach to modular arithmetic was 
+ * developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.
+ * <p>
+ * http://en.wikipedia.org/wiki/Modular_arithmetic
+ * <br>
+ * @author Szymon Stankiewicz <mail@stankiewicz.me>
+ * @author Justin Wetherell <phishman3579@gmail.com>
  */
 public class Modular {