Data update

Task/Primality-by-trial-division/GW-BASIC/primality-by-trial-division.basic

@@ -0,0 +1,11 @@
+100 FOR I = 1 TO 99
+110  IF I < 2 THEN P = 0 : GOTO 180
+120  IF I = 2 THEN P = 1 : GOTO 180
+130  IF I MOD 2 = 0 THEN P = 0 : GOTO 180
+140  P = 1
+150  FOR J = 3 TO SQR(I) STEP 2
+160   IF I MOD J = 0 THEN P = 0 : GOTO 180
+170  NEXT J
+180  IF P <> 0 THEN PRINT I;
+190 NEXT I
+200 END

Task/Primality-by-trial-division/Langur/primality-by-trial-division-1.langur

@@ -1,4 +1,6 @@
-val .isPrime = fn(.i) .i == 2 or .i > 2 and
-    not any fn(.x) .i div .x, pseries 2 .. .i ^/ 2
+val isPrime = fn(i) {
+	i == 2 or i > 2 and
+	    not any(fn x:i div x, pseries(2 .. i ^/ 2))
+}
 
-writeln filter .isPrime, series 100
+writeln filter(isPrime, series(100))

Task/Primality-by-trial-division/Langur/primality-by-trial-division-2.langur

@@ -1,15 +1,15 @@
-val .isPrime = fn(.i) {
-    val .n = abs(.i)
-    if .n <= 2: return .n == 2
+val isPrime = fn(i) {
+    val n = abs(i)
+    if n <= 2: return n == 2
 
-    val .chkdiv = fn(.n, .i) {
-        if .i * .i <= .n {
-            return .n ndiv .i and self(.n, .i+2)
+    val chkdiv = fn(n, i) {
+        if i * i <= n {
+            return n ndiv i and fn((n, i+2))
         }
         return true
     }
 
-    return .n ndiv 2 and .chkdiv(.n, 3)
+    return n ndiv 2 and chkdiv(n, 3)
 }
 
-writeln filter .isPrime, series 100
+writeln filter(isPrime, series(100))

Task/Primality-by-trial-division/PascalABC.NET/primality-by-trial-division.pas

@@ -0,0 +1,18 @@
+function IsPrime(N: integer): boolean;
+begin
+  if N = 1 then
+    Result := False
+  else Result := True;
+  for var i:=2 to N.Sqrt.Round do
+    if N.Divs(i) then
+    begin
+      Result := False;
+      exit
+    end;
+end;
+
+begin
+  for var i:=1 to 1000 do
+    if IsPrime(i) then
+      Print(i)
+end.