public static void main(String[] args) {

AmicableNumber.findAllInRange(1,3000);

/* Res -> Int Range of 1 till 3000there are 3Amicable_numbers These are 1: = ( 220,284) 2: = ( 1184,1210)

}

/**

static void findAllInRange(int startValue, int stopValue) {

/* the 2 for loops are to avoid to double check tuple. For example (200,100) and (100,200) is the same calculation

StringBuilder res = new StringBuilder();

int countofRes = 0;

for (int i = startValue; i < stopValue; i++) {

for (int j = i + 1; j <= stopValue; j++) {

if (isAmicableNumber(i, j)) {

countofRes++;

res.append("" + countofRes + ": = ( " + i + "," + j + ")" + "\t");

}

}

}

res.insert(0, "Int Range of " + startValue + " till " + stopValue + " there are " + countofRes + " Amicable_numbers.These are \n ");

System.out.println(res.toString());

}

/**

static boolean isAmicableNumber(int numberOne, int numberTwo) {

return ((recursiveCalcOfDividerSum(numberOne, numberOne) == numberTwo && numberOne == recursiveCalcOfDividerSum(numberTwo, numberTwo)));

}

/**

static int recursiveCalcOfDividerSum(int number, int div) {

if (div == 1) {

return 0;

} else if (number % --div == 0) {

return recursiveCalcOfDividerSum(number, div) + div;

} else {

return recursiveCalcOfDividerSum(number, div);

}

}