Data update
This commit is contained in:
parent
35bcdeebf8
commit
74c69a0df6
2427 changed files with 31826 additions and 3468 deletions
|
|
@ -0,0 +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
|
||||
.
|
||||
em = (em + 1) mod k
|
||||
until em = 0
|
||||
k += 2
|
||||
.
|
||||
arr[] &= k
|
||||
write k & " "
|
||||
.
|
||||
19
Task/Euclid-Mullin-sequence/SETL/euclid-mullin-sequence.setl
Normal file
19
Task/Euclid-Mullin-sequence/SETL/euclid-mullin-sequence.setl
Normal file
|
|
@ -0,0 +1,19 @@
|
|||
program euclid_mullin;
|
||||
print(2);
|
||||
product := 2;
|
||||
loop for i in [2..16] do
|
||||
next := smallest_factor(product + 1);
|
||||
product *:= next;
|
||||
print(next);
|
||||
end loop;
|
||||
|
||||
op smallest_factor(n);
|
||||
if even n then return 2; end if;
|
||||
d := 3;
|
||||
loop while d*d <= n do
|
||||
if n mod d=0 then return d; end if;
|
||||
d +:= 2;
|
||||
end loop;
|
||||
return n;
|
||||
end op;
|
||||
end program;
|
||||
|
|
@ -1,4 +1,4 @@
|
|||
/* euclid_mullin_gmp.wren */
|
||||
/* Euclid_mullin_sequence_2.wren */
|
||||
|
||||
import "./gmp" for Mpz
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue