In this tutorial you will learn about the Program to check Amicable Numbers in Java and its application with practical example.
In this tutorial, we will learn to create a Java Program to check Amicable Numbers in Java using Java programming.
Prerequisites
Before starting with this tutorial we assume that you are best aware of the following Java programming topics:
- Java Operators.
- Basic Input and Output function in Java.
- Class and Object in Java.
- Basic Java programming.
- If-else statements in Java.
- For loop in Java.
What is Amicable Number?
Pairs of number said to be Amicable Numbers, if sum of divisors of first number equals to the second number.
Some of the Amicable Numbers are: (220, 284), (1184, 1210), (2620, 2924), (5020, 5564), (6232, 6368) etc…
let’s have an example of one Amicable Number.
Divisors of 220 are = “1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110” on adding them we get
(1+2+4+5+10+11+20+22+44+55+110)=284
Now we will check if the Divisors of 284 = 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110
1+2+7+71+142=220.
So we can see clearly 220 and 284 are Amicable Numbers.
Program to check Amicable Numbers in Java
In this program , we will learn to create a Program to check Amicable Numbers.First we would declared and initialized the required variables. Next, we would prompt user to input the values. Later we will find that they are Amicable Number or not.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 |
// Java program to find Amicable number. import java.util.Scanner; class Amicable { public static void main(String args[]) { // taking values from user.. int no1,no2,sum1=0,sum2=0,i; Scanner in = new Scanner(System.in); System.out.print("Enter first number: "); no1 = in.nextInt(); System.out.print("Enter second number: "); no2 = in.nextInt(); for (i = 1; i <= no1; i++) { if (no1 % i == 0) sum1 += i; } for (int i = 1; i <= no2; i++) { if (no2 % i == 0) sum2 += i; } // Checking condition of Amicable .. if (sum1 == sum2) System.out.println("Numbers are amicable."); else System.out.println("Numbers are not amicable."); System.out.println("\n"); } } |
Output
In the above program, we have first declared and initialized a set variables required in the program.
- no1= it will hold first entered number.
- no2= it will hold second entered number.
- sum1= it will calculate first divisor sum.
- sum2= it will calculate second divisor sum.
- i = for iteration.
After that taking values from user we will assigned the values in variable “no1” and “no2” respectively.
Now, we have two different values in variable “no1” and in “no2” and now with the modulus (%) operator we find all the divisor of numbers.
and for second number.
Steps for finding Amicable Number are as follow.
- Read and initialize numbers in variables (no1, no2) from the user.
- Find the divisor of both the number (no1, no2) using for loop.
- Find the sum of divisors in variables sum1 and in sum2.
- Checking if the sum of divisors of number no1 and no2 are equal to each other or not.
If equal, the numbers are Amicable.
Else, not Amicable.
So in that manner we will find the entered number are Amicable or Not.
