diff --git a/javascript/p0000_template.js b/javascript/p0000_template.js
index 0b58ac05..4d4bb7c2 100644
--- a/javascript/p0000_template.js
+++ b/javascript/p0000_template.js
@@ -1,10 +1,10 @@
 /**
  * Project Euler Template
- * 
+ *
  * This template is used to format Project Euler solution scripts. This paragraph
  * should be replaced by a description of how I approached the problem, as well as
  * critque.
- * 
+ *
  * This paragraph should be replaced by the problem description, excluding images.
  **/
 
diff --git a/javascript/p0001.js b/javascript/p0001.js
index 0ac04d22..346e0409 100644
--- a/javascript/p0001.js
+++ b/javascript/p0001.js
@@ -1,13 +1,13 @@
 /**
 * Project Euler Problem 1
-* 
+*
 * Did this the old fashioned way, because this was before I figured out the closed form solution
-* 
+*
 * Problem:
-* 
+*
 * If we list all the natural numbers below 10 that are multiples of 3 or 5, we
 * get 3, 5, 6 and 9. The sum of these multiples is 23.
-* 
+*
 * Find the sum of all the multiples of 3 or 5 below 1000.
 */
 exports.p0001 = function() {
diff --git a/javascript/p0002.js b/javascript/p0002.js
index d43ea72d..c01b9056 100644
--- a/javascript/p0002.js
+++ b/javascript/p0002.js
@@ -1,15 +1,15 @@
 /**
  * Project Euler Problem 2
- * 
+ *
  * Moved the fibonacci optimization to javascript
- * 
+ *
  * Problem:
- * 
+ *
  * Each new term in the Fibonacci sequence is generated by adding the previous two
  * terms. By starting with 1 and 2, the first 10 terms will be:
- * 
+ *
  * 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
- * 
+ *
  * By considering the terms in the Fibonacci sequence whose values do not exceed
  * four million, find the sum of the even-valued terms.
  **/