@Carl Love how does one create this file with your mods? I tried Edit...Startup Code

@Markiyan Hirnyk try http://www.physics.csbsju.edu/stats/t-test.html

@Markiyan Hirnyk what about student's t tests? inference based on small samples.

http://www.math.wichita.edu/~richardson/mathematics/magic%20squares/even-ordermagicsquares.html

thanks Carl.

As a supplementary question, say you sample the last 10 episodes, and you find the questions were [A,B,C,D,E], [A,B,C,D,F],.... How could you determine if they were truely random selections. I guess there may be a significance test in Maple, but I don't know...

Carl, wonder if you can alter this code to catch the longest sequences <= n for a given AD and output them

for instance, 

I/P:

AD:=210,n:=11

O/P:

7: [47, 257, 467, 677, 887, 1097, 1307] 
10: [199, 409, 619, 829, 1039, 1249, 1459, 1669, 1879, 2089]

Carl, wonder if you can alter this code to catch the longest sequences <= n for a given AD and output them

for instance, 

I/P:

AD:=210,n:=11

O/P:

7: [47, 257, 467, 677, 887, 1097, 1307] 
10: [199, 409, 619, 829, 1039, 1249, 1459, 1669, 1879, 2089]

@Carl Love 

@Carl Love 

@Carl Love 

thanks Carl, but it would be nice to do it as a procedure

@Carl Love 

thanks Carl, but it would be nice to do it as a procedure

modifying some Acer code

> g := proc(n) local f,F,i; f := (t,n) -> 2+(2*n-1)^2/t; F := n; for i from n-1 to 1 by -1 do F := f(F,i); od; F; end proc;

> evalf(4/(1+g(10000)));
                 

1.222025897

(it doesn't converge very quickly)

modifying some Acer code

> g := proc(n) local f,F,i; f := (t,n) -> 2+(2*n-1)^2/t; F := n; for i from n-1 to 1 by -1 do F := f(F,i); od; F; end proc;

> evalf(4/(1+g(10000)));
                 

1.222025897

(it doesn't converge very quickly)

my attempt:

V:= root(22,3):
> for n from 3 by -1 to 2 do
> V:= sqrt(22+V): end do:
> V;
> evalf(V)
> ;
                                                 (1/2)
                       /                   (1/2)\    
                       |     /       (1/3)\     |    
                       \22 + \22 + 22     /     /    
                                 5.194243409

no. because it needs to allow for every 2nd term being cube rooted. the answers 5

my attempt:

V:= root(22,3):
> for n from 3 by -1 to 2 do
> V:= sqrt(22+V): end do:
> V;
> evalf(V)
> ;
                                                 (1/2)
                       /                   (1/2)\    
                       |     /       (1/3)\     |    
                       \22 + \22 + 22     /     /    
                                 5.194243409

no. because it needs to allow for every 2nd term being cube rooted. the answers 5