Data update

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

@@ -1,4 +1,4 @@
-val .isPrime = f .i == 2 or
-    .i > 2 and not any f(.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

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

@@ -1,9 +1,9 @@
-val .isPrime = f(.i) {
+val .isPrime = fn(.i) {
     val .n = abs(.i)
     if .n <= 2: return .n == 2
 
-    val .chkdiv = f(.n, .i) {
-        if .i x .i <= .n {
+    val .chkdiv = fn(.n, .i) {
+        if .i * .i <= .n {
             return .n ndiv .i and self(.n, .i+2)
         }
         return true

Task/Primality-by-trial-division/SETL/primality-by-trial-division.setl

@@ -0,0 +1,7 @@
+program trial_division;
+    print({n : n in {1..100} | prime n});
+
+    op prime(n);
+        return n>=2 and not exists d in {2..floor sqrt n} | n mod d = 0;
+    end op;
+end program;