diff --git a/ProjectEuler/Problem1.m b/ProjectEuler/Problem1.m
index 26171ee..5e999bb 100644
--- a/ProjectEuler/Problem1.m
+++ b/ProjectEuler/Problem1.m
@@ -22,4 +22,9 @@ end
 %When done this way it removes the possibility of duplicate numbers
 
 fullSum = sum(numbers);
-fullSum
+ans = fullSum
+
+%Cleanup your variables
+clear fullSum;
+clear numbers;
+clear counter;
diff --git a/ProjectEuler/Problem2.m b/ProjectEuler/Problem2.m
index 72b827a..2fd839c 100644
--- a/ProjectEuler/Problem2.m
+++ b/ProjectEuler/Problem2.m
@@ -6,7 +6,6 @@
 fib = [1, 1, 2];	%Holds the Fibonacci numbers
 currentFib = fib(end) + fib(end - 1);	%The current Fibonacci number to be tested
 evenFib = [2];	%A subset of the even Fibonacci numbers
-finalSum = 0;
 
 while(currentFib < 4000000)
 	%Add the number to the list
@@ -20,5 +19,9 @@ while(currentFib < 4000000)
 	currentFib = fib(end) + fib(end - 1);
 end
 
-finalSum = sum(evenFib);
-finalSum
+sum(evenFib)
+
+%Cleanup your variables
+clear fib;
+clear currentFib;
+clear evenFib;
diff --git a/ProjectEuler/Problem3.m b/ProjectEuler/Problem3.m
index a61621f..47c9baa 100644
--- a/ProjectEuler/Problem3.m
+++ b/ProjectEuler/Problem3.m
@@ -36,12 +36,13 @@ end
 %When the last number is not divisible by a prime number it must be a prime number
 factors(end + 1) = tempNum;
 
-%Remove the variables
+%Print the answer
+max(factors)
+
+%Cleanup your variables
 clear counter;
 clear tempNum;
 clear answer;
 clear number;
 clear primeNums;
-
-%Print the answer
-max(factors)
+clear factors;
diff --git a/ProjectEuler/Problem4.m b/ProjectEuler/Problem4.m
index 945e461..88cc081 100644
--- a/ProjectEuler/Problem4.m
+++ b/ProjectEuler/Problem4.m
@@ -28,12 +28,14 @@ while(outerCounter < size(numbers)(2))
 	++outerCounter;	%Increment
 end
 
+max(palindromes)
+
+%Cleanup your variables
 clear outerCounter;
 clear innerCounter;
 clear answer;
 clear numbers;
-
-max(palindromes)
+clear palindromes;
 
 %This way is slow. I would like to find a faster way
 %{
diff --git a/ProjectEuler/Problem5.m b/ProjectEuler/Problem5.m
index 1391905..f28bbf6 100644
--- a/ProjectEuler/Problem5.m
+++ b/ProjectEuler/Problem5.m
@@ -3,7 +3,6 @@
 %What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
 
 %Create your variables
-value = 0;	%The value that is evenly divisible
 nums = [1:20];
 factors = [1];	%The factors that are already in the number
 list = [];	%For a temperary list of the factors of the current number
@@ -33,13 +32,12 @@ while(counter <= size(nums)(2))
 	++counter;
 end
 
+prod(factors)
+
 %Cleanup your variables
 clear counter;
 clear factorCnt;
 clear listCnt;
 clear list;
 clear nums;
-clear ans;	%Appears whenever you use increment
-
-value = prod(factors);
-value
+clear factors;