From 68833c96ba84d2bc8fc67b9e38016389974ac429 Mon Sep 17 00:00:00 2001
From: Norbert Najderek <hepstev@gmail.com>
Date: Thu, 4 Aug 2016 12:13:00 +0200
Subject: [PATCH] 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);
	}
}
---
 BiKoe.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/BiKoe.java b/BiKoe.java
index 06487a0..a01177c 100644
--- a/BiKoe.java
+++ b/BiKoe.java
@@ -1,4 +1,4 @@
-
+fsdf
 public class BiKoe {
 	public static void main(String [] args) throws InterruptedException {
 			pln("{ n "+(char)400+ " N | n>k }");
@@ -38,4 +38,4 @@ static int BK(int n, int k) {
 		if(n < k)
 			return 0;
 			return Fakultät(n) / (Fakultät(k) * Fakultät(n-k));
-}	}
\ No newline at end of file
+}	}