In this program, we are trying to check whether the two given numbers by the user through console, are friendly pair or not?
Example
If sum of all divisors of number1 is equal to number1 and sum of all divisors of number2 is equal to number2, then we can say, those two numbers are abundant numbers.
The logic that we used to find friendly pairs is as follows −
For the sum of all divisors of number 1.
for(i=1;i
