This is a fairly simple school project focusing on using a method. It consists of a positive integer called a perfect number which 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 and 6=1+2+3.
Write a java program to list all perfect numbers under 10,000(not 10,000 perfect numbers) through an exaustive search. Implement the following method (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 numer problem.
This program only requires one method and a simple loops.
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).