Perfect numbers: Difference between revisions

Content added Content deleted

Inline

@@ Line 286: / Line 286: @@
 	for(BigInteger i= BigInteger.ONE;
 	i.compareTo(n) < 0;i=i.add(BigInteger.ONE)){
-		if(n.mod(i).compareTo(BigInteger.ZERO) == 0){
+		if(n.mod(i).equals(BigInteger.ZERO)){
 			sum= sum.add(i);
 		}
 	}
-	return sum.compareTo(n) == 0;
+	return sum.equals(n);
 }</lang>