Euclid-Mullin sequence: Difference between revisions

Content added Content deleted

Inline

@@ Line 81: / Line 81: @@
 </pre>
-=={{header|Craft Basic}}==
+=={{header|BASIC}}==
+==={{header|Craft Basic}}===
 <syntaxhighlight lang="basic">define size = 16, em = 0
 dim list[size]
@@ Line 123: / Line 124: @@
 end</syntaxhighlight>
+==={{header|FreeBASIC}}===
+Naive and takes forever to find the largest term, but does get there in the end.
+<syntaxhighlight lang="freebasic">
+dim as ulongint E(0 to 15), k
+dim as integer i, em
+E(0) = 2 : print 2
+for i=1 to 15
+    k=3
+    do
+        em = 1
+        for j as uinteger = 0 to i-1
+            em = (em*E(j)) mod k
+        next j
+        em = (em + 1) mod k
+        if em = 0 then
+            E(i)=k
+            print E(i)
+            exit do
+        end if
+        k = k + 2
+    loop
+next i</syntaxhighlight>
 =={{header|F_Sharp|F#}}==
@@ Line 170: / Line 194: @@
 od;</syntaxhighlight>
 {{out}}<pre> 2  3  7  43  13  53  5  6221671  38709183810571  139  2801  11  17  5471  52662739  23003</pre>
-=={{header|FreeBASIC}}==
-Naive and takes forever to find the largest term, but does get there in the end.
-<syntaxhighlight lang="freebasic">
-dim as ulongint E(0 to 15), k
-dim as integer i, em
-E(0) = 2 : print 2
-for i=1 to 15
-    k=3
-    do
-        em = 1
-        for j as uinteger = 0 to i-1
-            em = (em*E(j)) mod k
-        next j
-        em = (em + 1) mod k
-        if em = 0 then
-            E(i)=k
-            print E(i)
-            exit do
-        end if
-        k = k + 2
-    loop
-next i</syntaxhighlight>
 =={{header|Go}}==