Data update

Task/Euclid-Mullin-sequence/EasyLang/euclid-mullin-sequence.easy

@@ -1,17 +1,17 @@
-limit = 8
 arr[] = [ 2 ]
-write 2 & " "
-for i = 2 to limit
-   k = 3
-   repeat
-      em = 1
-      for j = 1 to i - 1
-         em = em * arr[j] mod k
+fastproc .
+   for i = 2 to 9
+      k = 3
+      repeat
+         em = 1
+         for j = 1 to i - 1
+            em = em * arr[j] mod k
+         .
+         em = (em + 1) mod k
+         until em = 0
+         k += 2
       .
-      em = (em + 1) mod k
-      until em = 0
-      k += 2
+      arr[] &= k
    .
-   arr[] &= k
-   write k & " "
 .
+print arr[]

Task/Euclid-Mullin-sequence/Lua/euclid-mullin-sequence-1.lua

@@ -5,10 +5,8 @@ do
     io.write( "2" )
     local product = 2
     for i = 2, 8 do
-        local nextV = product + 1
+        local nextV, p, found = product + 1, 3, false
         -- find the first prime factor of nextV
-        local p = 3
-        local found = false
         while  p * p <= nextV and not found do
             found = nextV % p == 0
             if not found then p = p + 2 end

Task/Euclid-Mullin-sequence/REXX/euclid-mullin-sequence.rexx

@@ -1,5 +1,5 @@
--- 8 May 2025
-include Settings
+-- 23 Aug 2025
+include Setting
 
 say 'EUCLID-MULLIN SEQUENCE'
 say version
@@ -19,7 +19,4 @@ end
 say
 return
 
-include Functions
-include Sequences
-include Numbers
-include Abend
+include Math