Commits on Aug 4, 2016

1. optional …

   perfect number solution 
   
   
   public class PerfectNumber {
   	public static void main(String[] args) {
   		perfect(10000);
   	}
   	
   	//print all perfect numbers from 1 to n
   	public static void perfect(int n){
   	for (int i = 1; i<n; i++){
   		int comp = 0;
   		for (int j = 1; j<i; j++){
   			if (i%j == 0)
   				comp += j;	
   		}
   		if (comp == i)
   			System.out.println(i);
   		}
   	}
   	
   	//returns true or false if n is an "imperfect number"
   	//also includes perfect numbers
   	public static boolean imPerfect(int n){
   		int comp = 0;
   		for (int i = 1; i<n; i++){
   			if (n%i == 0)
   				comp += i;	
   		}
   		return (comp == n || comp == n+1 || comp == n-1 || comp == n+2 || comp == n-2);
   	}
   }

   

   NanNor committed Aug 4, 2016
   Configuration menu

   • View commit details
   • Copy full SHA for 68833c9
   • Browse repository at this point

   Copy the full SHA

   68833c9 View commit details

   Browse the repository at this point in the history