An integer number is said to be a perfect number if its factors, including 1 (bu

Question

An integer number is said to be a perfect number if its factors, including 1 (but not the number itself) sum to the number. For example, 6 is a perfect number, because 6 = 1 + 2 + 3. (The factorization of 6 is 1*2*3, so the sum of the factors of the number 6 is 6). Write a method perfect that determines whether a parameter number is a perfect number. Use this method in an application that determines and displays all perfect numbers between 1 and 1000. Challenge the computing power of your computer by testing numbers much larger than 1000. Display the results.

Explanation / Answer

Java Program:

import java.util.*;

public class perfectNumber

{

public static void main(String[]arsg)

{

//loop to run numbers between 1 and 1000

for(int number = 2;number<1000;number++)

{

//function call

if(perfect(number))

{

System.out.println(number+" is pefect number ");

}

}

}

//function to check whether the number is perfect number or not

private static boolean perfect(int number)

{

int i,rem,sum=0;

for(i=1;i<=(number-1);i++)

{

rem=number%i; //calculates the remainder

if(rem==0)

{

sum=sum+i; //sums up the digits

}

}

if (sum==number) //if sum is equal to number returns true

return true;

else

return false;}

}

Output:

6 is pefect number

28 is pefect number

496 is pefect number

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.