5 Smallest multiple - Project Eulder

package xxx.xxx.xxx;


import java.util.ArrayList;


/*
 * 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
 * What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
 */
public class SmallestMultiple {

ArrayList<Integer> factors = new ArrayList<Integer>();


private void compute(int min, int max, int minMultiple) {
long multiple = (long) minMultiple;
ArrayList<Integer> dividers = new ArrayList<Integer>();
for (int num = min + 1; num < max + 1; num++) {
boolean isPrime = true;
for (int i = 2; i < num; i++) {
if (num % i == 0) {
isPrime = false;
break;
}
}
if (isPrime) {
multiple = multiple * num;
// System.out.println(num);
}
else{
dividers.add(num);
}
}
// System.out.println(multiple);
for(int i = 0; i<dividers.size();i++){
if(multiple%dividers.get(i)!=0){
getAllFactors(dividers.get(i));
System.out.println("factors"+factors);
long temp = multiple;
for(int j = 0; j<factors.size();j++){
System.out.println("aaa"+factors.get(j));
if(temp%factors.get(j)==0){


temp = temp/factors.get(j);
}else{
multiple = multiple*factors.get(j);
}
}
}
}
System.out.println(multiple);


}


private void getAllFactors(int number) {


if (number > 1) {
for (int i = 2; i < number+1; i++) {
if(number%i==0){
// System.out.println(i);
factors.add(i);
this.getAllFactors(number/i);
break;
}
}
}

}

private void getTwoFactors(int number) {
if (number > 1) {
for (int i = 2; i < number+1; i++) {
if(number%i==0){
System.out.println(i);
System.out.println(number/i);
break;
}
}
}
}


/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
SmallestMultiple smallestMultiple = new SmallestMultiple();
smallestMultiple.compute(10, 20, 2520);
}


}