Added a few comments to enhance understanding

ProjectEuler/Problem6.m

@@ -8,6 +8,7 @@ squares = nums.^2;	%Square every number in the list nums
 sumOfSquares = sum(squares);	%Get the sum of all the elements in the list squares
 squareOfSums = sum(nums)^2;		%Get the sum of all the elements in the list nums and square the answer
 value = abs(squareOfSums - sumOfSquares);	%Get the difference of the 2 numbers
+%This could all be done on one line, but this is less confusing
 
 %Print the value
 value

ProjectEuler/Problem7.m

@@ -5,6 +5,8 @@
 %Setup the variables
 counter = 1000;
 primeList = [];
+
+%Cycle through the prime numbers until you get the correct number
 while(size(primeList)(2) < 10001)
 	primeList = primes(counter);
 	counter += 1000;