diff --git a/src/main/java/mattrixwv/ProjectEuler/Problems/Problem3.java b/src/main/java/mattrixwv/ProjectEuler/Problems/Problem3.java
index 8e11096..3e7e8a1 100644
--- a/src/main/java/mattrixwv/ProjectEuler/Problems/Problem3.java
+++ b/src/main/java/mattrixwv/ProjectEuler/Problems/Problem3.java
@@ -34,7 +34,7 @@ public class Problem3 extends Problem{
 	private static final BigInteger NUMBER = BigInteger.valueOf(600851475143L);
 
 	public Problem3(){
-		super("The largest prime factor of 600851475143");
+		super("What is the largest prime factor of 600851475143?");
 	}
 	public void solve(){
 		//Start the timer
diff --git a/src/main/java/mattrixwv/ProjectEuler/Problems/Problem4.java b/src/main/java/mattrixwv/ProjectEuler/Problems/Problem4.java
index fdc15a9..9de5926 100644
--- a/src/main/java/mattrixwv/ProjectEuler/Problems/Problem4.java
+++ b/src/main/java/mattrixwv/ProjectEuler/Problems/Problem4.java
@@ -44,7 +44,7 @@ public class Problem4 extends Problem{
 
 		//Start at the first 3-digit number and check every one up to the last 3-digit number
 		for(Integer firstNum = START_NUM;firstNum <= END_NUM;++firstNum){
-			//You can start at the locatio of the first number because everything before that has already been tested. (100 * 101 == 101*100)
+			//You can start at the location of the first number because everything before that has already been tested. (100 * 101 == 101 * 100)
 			for(Integer secondNum = firstNum;secondNum < END_NUM;++secondNum){
 				//Get the product
 				Integer product = firstNum * secondNum;