Hi Guys, I need another help with perfect number. Thesequestions are continued f

Question

Hi Guys, I need another help with perfect number. Thesequestions are continued from part 1. See posted question somewherein Question board of computer science.

An integer is said to be a perfect number if all its factors,including 1 (but not the number itself), sum to that number. For example, 6 is a perfect number because 1, 2, and 3 are all thefactors of 6 (ignoring the number itself) and 1 + 2 + 3 = 6.

2. Use this function in a program that calculates andprints all the perfect numbers between 1 and 10000.

3. Print all the factors of each perfect number to confirm thatthe number is indeed perfect.

Explanation / Answer

please rate - thanks part 2 #include                   using namespace std; void perfect(int num){ int sum=0;        for(int i=1; i

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---