ProjectEuler/ProjectEulerJava
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/projecteulerjava.git synced 2025-12-06 17:13:58 -05:00
Code Issues Packages Projects Releases Wiki Activity

Fixed some typos

Browse Source
This commit is contained in:
Mattrixwv
2020-06-14 18:43:55 -04:00
parent 37ca547aa7
commit 8aafb7dce6
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/main/java/mattrixwv/ProjectEuler/Problems/Problem3.java
View File

@@ -34,7 +34,7 @@ public class Problem3 extends Problem{
private static final BigInteger NUMBER = BigInteger.valueOf(600851475143L); private static final BigInteger NUMBER = BigInteger.valueOf(600851475143L);
public Problem3(){ public Problem3(){
super("The largest prime factor of 600851475143"); super("What is the largest prime factor of 600851475143?");
} }
public void solve(){ public void solve(){
//Start the timer //Start the timer

2
src/main/java/mattrixwv/ProjectEuler/Problems/Problem4.java
View File

@@ -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 //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){ 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){ for(Integer secondNum = firstNum;secondNum < END_NUM;++secondNum){
//Get the product //Get the product
Integer product = firstNum * secondNum; Integer product = firstNum * secondNum;