Data update

Task/Perfect-numbers/Ada/perfect-numbers.ada

@@ -1,10 +0,0 @@
-function Is_Perfect(N : Positive) return Boolean is
-   Sum : Natural := 0;
-begin
-   for I in 1..N - 1 loop
-      if N mod I = 0 then
-         Sum := Sum + I;
-      end if;
-   end loop;
-   return Sum = N;
-end Is_Perfect;

Task/Perfect-numbers/Arturo/perfect-numbers.arturo

@@ -1,6 +1,6 @@
 divisors: $[n][ select 1..(n/2)+1 'i -> 0 = n % i ]
 perfect?: $[n][ n = sum divisors n ]
 
-loop 2..1000 'i [
+loop 2..10000 'i [
 	if perfect? i -> print i
 ]

Task/Perfect-numbers/COBOL/perfect-numbers-1.cobol

@@ -1,24 +0,0 @@
-      $set REPOSITORY "UPDATE ON"
-
-       IDENTIFICATION DIVISION.
-       PROGRAM-ID. perfect-main.
-
-       ENVIRONMENT DIVISION.
-       CONFIGURATION SECTION.
-       REPOSITORY.
-           FUNCTION perfect
-           .
-       DATA DIVISION.
-       WORKING-STORAGE SECTION.
-       01  i                      PIC 9(8).
-
-       PROCEDURE DIVISION.
-           PERFORM VARYING i FROM 2 BY 1 UNTIL 33550337 = i
-               IF FUNCTION perfect(i) = 0
-                   DISPLAY i
-               END-IF
-           END-PERFORM
-
-           GOBACK
-           .
-       END PROGRAM perfect-main.

Task/Perfect-numbers/COBOL/perfect-numbers-2.cobol

@@ -1,37 +0,0 @@
-       IDENTIFICATION DIVISION.
-       FUNCTION-ID. perfect.
-
-       DATA DIVISION.
-       LOCAL-STORAGE SECTION.
-       01  max-val                 PIC 9(8).
-       01  total                   PIC 9(8) VALUE 1.
-       01  i                       PIC 9(8).
-       01  q                       PIC 9(8).
-
-       LINKAGE SECTION.
-       01  n                       PIC 9(8).
-       01  is-perfect              PIC 9.
-
-       PROCEDURE DIVISION USING VALUE n RETURNING is-perfect.
-           COMPUTE max-val = FUNCTION INTEGER(FUNCTION SQRT(n)) + 1
-
-           PERFORM VARYING i FROM 2 BY 1 UNTIL i = max-val
-               IF FUNCTION MOD(n, i) = 0
-                   ADD i TO total
-
-                   DIVIDE n BY i GIVING q
-                   IF q > i
-                       ADD q TO total
-                   END-IF
-               END-IF
-           END-PERFORM
-
-           IF total = n
-               MOVE 0 TO is-perfect
-           ELSE
-               MOVE 1 TO is-perfect
-           END-IF
-
-           GOBACK
-           .
-       END FUNCTION perfect.

Task/Perfect-numbers/Elena/perfect-numbers.elena

@@ -8,13 +8,13 @@ extension extension
         = new Range(1, self - 1).selectBy::(n => (self.mod(n) == 0).iif(n,0) ).summarize(new Integer()) == self;
 }
 
-public program()
+public Program()
 {
-    for(int n := 1; n < 10000; n += 1)
+    for(int n := 1; n < 10000; n++)
     {
         if(n.isPerfect())
-            { console.printLine(n," is perfect") }
+            { Console.printLine(n," is perfect") }
     };
 
-    console.readChar()
+    Console.readChar()
 }

Task/Perfect-numbers/PowerShell/perfect-numbers.psh

@@ -1,14 +0,0 @@
-Function IsPerfect($n)
-{
-$sum=0
- for($i=1;$i-lt$n;$i++)
- {
-  if($n%$i -eq 0)
-  {
-  $sum += $i
-  }
- }
-return $sum -eq $n
-}
-
-Returns "True" if the given number is perfect and "False" if it's not.

Task/Perfect-numbers/REBOL/perfect-numbers.rebol

@@ -1,9 +0,0 @@
-perfect?:  func [n [integer!] /local sum] [
-    sum: 0
-    repeat i (n - 1) [
-        if zero? remainder n i [
-            sum: sum + i
-        ]
-    ]
-    sum = n
-]

Task/Perfect-numbers/REXX/perfect-numbers-1.rexx

@@ -1,5 +1,5 @@
--- 25 Mar 2025
-include Settings
+-- 24 Aug 2025
+include Setting
 
 say 'PERFECT NUMBERS'
 say version
@@ -33,6 +33,4 @@ say Format(Time('e'),,3) 'seconds'
 say
 return
 
-include Numbers
-include Functions
-include Abend
+include Math

Task/Perfect-numbers/VBScript/perfect-numbers.vb

@@ -1,17 +0,0 @@
-Function IsPerfect(n)
-	IsPerfect = False
-	i = n - 1
-	sum = 0
-	Do While i > 0
-		If n Mod i = 0 Then
-			sum = sum + i
-		End If
-		i = i - 1
-	Loop
-	If sum = n Then
-		IsPerfect = True
-	End If
-End Function
-
-WScript.StdOut.Write IsPerfect(CInt(WScript.Arguments(0)))
-WScript.StdOut.WriteLine