This is a fairly simple school project using simle loops and a method. It requires that a program be written to find all perfect numbers. A perfect number is a number that is equal to the sum of all of its positive factors excluding itself. for example 28 is a perfect number because 28 = 1+2+4+7+14
A program needs to be written to list all perfect numbers under 10,000 through an exaustive search. Implement the following methd(public static int sumofFactors (int n)) that returns the sum of all factors of n(excluding n itself) and use the method to solve the perfect number problem.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).
J Builder 4-9