If only I get 2 cents for every bug report I submit...

Generally speaking, why would I be interested in doing that? I don't use Maple myself other than for this site postings. The more bugs - the more posts - the more points - the more Maple Mentor Awards :)

Alec

Joe,

Thank you.

Perhaps it is related to the same indexed evalf bug - I haven't looked into details.

Alec

This way it might get a better attention. For large array sizes this thing crashes Maple.

Alec

This can be done as

randomize():
coin:=rand(0..1):
c10:=rand(1..10):
x1:=['c10()'$20];
      
  x1 := [1, 4, 7, 8, 3, 7, 1, 5, 3, 10, 9, 8, 4, 7, 6, 9, 10, 2, 3, 6]

s:=select(i->x1[i]<4,{$1..20}) union {1,21};

                    s := {1, 5, 7, 9, 18, 19, 21}

x2:=[seq](coin()$(s[i]-s[i-1]),i=2..nops(s));

  x2 := [1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0]

By the way, serial correlation is in both cases, just with different lags - lag 10 in the former case and lag 1 in this one.

Alec

This can be done as

randomize():
coin:=rand(0..1):
c10:=rand(1..10):
x1:=['c10()'$20];
      
  x1 := [1, 4, 7, 8, 3, 7, 1, 5, 3, 10, 9, 8, 4, 7, 6, 9, 10, 2, 3, 6]

s:=select(i->x1[i]<4,{$1..20}) union {1,21};

                    s := {1, 5, 7, 9, 18, 19, 21}

x2:=[seq](coin()$(s[i]-s[i-1]),i=2..nops(s));

  x2 := [1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0]

By the way, serial correlation is in both cases, just with different lags - lag 10 in the former case and lag 1 in this one.

Alec

Let it be.

Alec

Joe,

Your code is certainly better, and it includes ranges not covered in combstruct. Thank you for writing it.

Alec

Joe,

Your code is certainly better, and it includes ranges not covered in combstruct. Thank you for writing it.

Alec

Yes, it is on the top of ?updates,Maple10,language page.

It was introduced in Maple 10.

Alec

Yes, it is on the top of ?updates,Maple10,language page.

It was introduced in Maple 10.

Alec

Thank you,

Originally, I hadn't realized that both a{1,11] and a[11,1] would get converted to the same variable a111 if underscores were not used.

Also, in the second version, I forgot to quote the underscore. It should be '_' instead of _, I just noticed that you quoted it in your version of the code above.

Alec

Suppose that sol is the list of solutions with a_1_1, then the following should convert them to the list of solutions with a[1,1],

f:=proc(x) local a;
a:=StringTools:-Split(x,'_');
if nops(a)>1 then
parse(cat(a[1],sprintf("%a",map(parse,a[2..-1]))))
else x fi
end:

sol:=evalindets(sol,'symbol',f);

Not tested, because I couldn't login to the server with Maple 12 that I used last few days and I don't have Maple installed at home.

Alec

The second argument in remove can not be an expression sequence. It should be an expression. List, for example (as it was in the original example). In your example, that can be done as

real_solutions := remove(has, [sol], I);

Alec

The second argument in remove can not be an expression sequence. It should be an expression. List, for example (as it was in the original example). In your example, that can be done as

real_solutions := remove(has, [sol], I);

Alec

For example,

flist:=[NUMINTP,NUMASERIES,evalf[1]@DIFFERENCE]:
M:=Matrix(10,3,(i,j)->flist[j](10*i-9));

Alec