Data update
This commit is contained in:
parent
0df55f9f24
commit
aec8ed51b6
1045 changed files with 18889 additions and 2777 deletions
|
|
@ -1,16 +1,16 @@
|
|||
val .farey = f(.n) {
|
||||
val .farey = fn(.n) {
|
||||
var .a, .b, .c, .d = 0, 1, 1, .n
|
||||
while[=[[0, 1]]] .c <= .n {
|
||||
val .k = (.n + .b) // .d
|
||||
.a, .b, .c, .d = .c, .d, .k x .c - .a, .k x .d - .b
|
||||
.a, .b, .c, .d = .c, .d, .k * .c - .a, .k * .d - .b
|
||||
_while ~= [[.a, .b]]
|
||||
}
|
||||
}
|
||||
|
||||
val .testFarey = impure f() {
|
||||
val .testFarey = impure fn() {
|
||||
writeln "Farey sequence for orders 1 through 11"
|
||||
for .i of 11 {
|
||||
writeln $"\.i:2;: ", join " ", map(f $"\.f[1];/\.f[2];", .farey(.i))
|
||||
writeln $"\.i:2;: ", join " ", map(fn(.f) $"\.f[1];/\.f[2];", .farey(.i))
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
|||
37
Task/Farey-sequence/QBasic/farey-sequence.basic
Normal file
37
Task/Farey-sequence/QBasic/farey-sequence.basic
Normal file
|
|
@ -0,0 +1,37 @@
|
|||
FUNCTION farey (n, dsc)
|
||||
b = 1: c = 1: d = n
|
||||
|
||||
IF dsc = TRUE THEN a = 1: c = n - 1
|
||||
|
||||
cnt = cnt + 1
|
||||
IF n < 12 THEN PRINT a; "/"; b;
|
||||
|
||||
WHILE ((c <= n) AND NOT dsc) OR ((a > 0) AND dsc)
|
||||
aa = a: bb = b: cc = c: dd = d
|
||||
k = (n + b) \ d
|
||||
a = cc: b = dd: c = k * cc - aa: d = k * dd - bb
|
||||
cnt = cnt + 1
|
||||
IF n < 12 THEN PRINT a; "/"; b;
|
||||
WEND
|
||||
|
||||
IF n < 12 THEN PRINT
|
||||
|
||||
farey = cnt
|
||||
END FUNCTION
|
||||
|
||||
CLS
|
||||
CONST TRUE = -1: FALSE = NOT TRUE
|
||||
|
||||
FOR i = 1 TO 9
|
||||
PRINT USING "F# ="; i;
|
||||
t = farey(i, FALSE)
|
||||
NEXT i
|
||||
FOR i = 10 TO 11
|
||||
PRINT USING "F## ="; i;
|
||||
t = farey(i, FALSE)
|
||||
NEXT i
|
||||
PRINT
|
||||
FOR i = 100 TO 900 STEP 100
|
||||
PRINT USING "F#### = ######"; i; farey(i, FALSE)
|
||||
NEXT i
|
||||
PRINT USING "F1000 = ######"; farey(1000, FALSE)
|
||||
Loading…
Add table
Add a link
Reference in a new issue