Skip to main content

Perfect number in java, program for perfect number in java

A perfect number is one where the sum of factors of a number (excluding the number itself) is equal to the number itself.

EXAMPLE-
We take 6. Factors of 6 are: 1,2,3
6 = 1 + 2 + 3
6 is a perfect number.

Now we take 28 .Factors of 28 are: 1,2,4,7,14
28 = 1 + 2 + 4 + 7 + 14
28 is a perfect number.

Perfect number in java language can be made by first applying a for loop starting from 1 to 1 less than that number and then with the help of if statement, checking if the number is divisible by that particular number which is currently stored in loop control variable. 

Then after the loop terminates we will check whether the sum of factors of the number is equal to the number itself or not. If the statement returns true then appropriate statement prints.
Here is the code for perfect number in two different formats firstly with the help of methods and secondly a very simple program using main method.
JAVA CODE ( with the help of methods)-
import java.util.*;
public class perfect
{
int num;
int sum;
perfect()
{
}
perfect(int nn)
{
num=nn;
}
int fact(int x)
{
int s=0;
for(int i=1;i<=x/2;i++)
{
 if(x%i==0)
{
s=s+i;
}
}
return s;
}
void isperfect()
 {
int n=num;
sum=0;
perfect obj=new perfect();
sum=sum+obj.fact(n);
if(sum==num)
System.out.println(num+" is a perfect number");
else
System.out.println(num+" is not a perfect number");
}
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("enter a number");
int e=sc.nextInt();
perfect obj=new perfect(e);
obj.isperfect();
}
}

Output-
enter a number
6
6 is a perfect number
enter a number
12
12 is not a perfect number


ALGORITHM-
 STEP 1: start
STEP 2: print"enter a number"
STEP 3: taking input of integer in e
STEP 4: sum = sum + STEP 8
STEP 5: repeat STEP 6 to STEP 7 until i<x/2
STEP 6: if x%i==0 then goto STEP 7
STEP 7: s=s+i
STEP 8: return s
STEP 9: if sum==num then goto STEP 10 else goto STEP 11
STEP 10: print num +"is a perfect number"
STEP 11: print num +"is not a perfect number" 
STEP 12: END

JAVA CODE ( WITHOUT USING METHOD)-
import java.util.*;
public class perfection
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("enter a number");
int num=sc.nextInt();
int sum=0;
for(int i=1;i<x;i++)
{
if(num%i==0)
sum+=i;
}
if(sum==num)
System.out.println(num+" is a perfect number);
else
System.out.println(num+" is not a perfect number");
}
}

Output-

enter a number
28
28 is a perfect number
enter a number
16
16 is not a perfect number

ALGORITHM-
 STEP 1: start
STEP 2: print "enter a number"
STEP 3: taking input in num
STEP 4: int i=1 ,repeat STEP 5 to STEP 6 until i    <num
STEP 5: if num%i==0 then goto STEP 6
STEP 6: sum=sum + i
STEP 7: if sum ==num then goto STEP 8 else goto STEP 9
STEP 8: print num+"is a perfect number"
STEP 9: print num+"is not a perfect number"
STEP 10:end

Related programs

 1-Prime number
If you have find this helpful please share .

 If you have any query related to this program then you can comment below.


Labels:

Comments

Post a Comment

Popular posts from this blog

Emirp number in java, program to check emirp number

Emirp is simply the reverse prononciation of word "prime". An emirp number is the number which is prime and whose reverse is also a prime number. EXAMPLE-1 17  Reverse of the number = 71 Both the numbers are prime so 17 is an emirp number. EXAMPLE-2 37 Reverse of the number = 73 Both the numbers are prime so 37 is an emirp number. EXAMPLE-3 13 Reverse of the number = 31 Both the numbers are prime so 13 is an emirp number. Emrip number can be easily made in java with the help of methods/functions. Firstly, take an input of number, then check it is prime or not, then reverse the number and again check it is prime or not, if both are true, print the suitable output. ALGORITHM- STEP 1 : start STEP 2 : print "enter a number" STEP 3 : take input of number in e STEP 4 : int n=num, int rev =0 STEP 5 : repeat STEP to STEP until n>0 STEP 6 : int d=n%10 STEP 7 : rev=(rev*10)+d STEP 8 : n=n/10 STEP 9 :  int p= input value from STEP 13 STEP 10 : int d=0, x=num STEP 11 : int i...
Post a Comment
Read more

Java program for prime numbers

A prime number is the number which is is  divisible by itself and not by other numbers. A program to check prime number can be made by using for and while loop combination . This article contains java program for finding prime number ,write a java program for prime number between 1- 100 ,simple program to find prime factorial of a number in java. EXAMPLE 1 - program to check whether a number is prime number  or not. import java.util.*; public class pr { public static void main() { Scanner sc=new Scanner(System.in); System.out.println("enter number"); int num=sc.nextInt(); int d=0; for(int i=2;i<=num;i++) { if(num%i==0) d++; } if(d==0) System.out.println("it is a prime number"); else System.out.println("it is not a prime number"); } } Output enter number 23 it is a p...
Post a Comment
Read more

disarium number in java

A number is said to be disarium if the sum of its digit powered with their positions is equal to the number itself. EXAMPLE- 135 = (1^1) + (3^2) + (5^3)                             = 1 + 9 + 125                             = 135 A simple java program to check disarium number can be made by firstly calculating the length of the number and then adding digits of the number raised to the power of its position in the number. ALGORITHM - STEP 1 : Start STEP 2 : print "enter a number" STEP 3 : taking input of integer in n STEP 4 : int l= Integer.toString().length() STEP 5 : int no=n STEP 6 : int s=0 STEP 7 : repeat STEP 8 to STEP 11 until (no!=0) STEP 8 : int d=no%10 STEP 9 : s=s+(int)(Math.pow(d,l) STEP 10 :no=no/10 STEP 11 : l-- STEP 12 : if  (s==n) then goto STEP 13 else goto STEP 14 STEP 13 : print "the number is disarium" STEP 14 : print "the num...
Post a Comment
Read more