Let A be a table. I give following sequence of commands:

>>B:=A;
>>A[x]=34:

Then surprisingly (at least for me) it turns that B has also changed its value for B[x]. Would someone help me understand this? What is it called? How we can stop this behaviour i.e. A and B should behave as independent tables?

regards

Can someone provide me a simple code to understand Homotopy Analysis Method for solving PDEs. I am a pure mathematician and came to know that Homotopy has found application in solution of PDE. Kindly guide me, as I can understand through a Maple Sheet much easily than a by a book or research paper. Regards

I have following commands at Maple:

>T:={[{a,b,c,d}, table([a=0,b=0,c=0,d=0]),8],
[{a,b,c,d},table([a=6,b=1,c=2,d=0]),8],
[{a,b,c,d},table([a=6,b=5,c=5,d=7]),8],
[{a,b,c,d},table([a=7,b=1,c=2,d=0]),8],
[{a,b,c,d},table([a=8,b=8,c=8,d=8]),8]};
 
> member([{a,b,c,d},table([a=0,b=0,c=0,d=0]),8],T);

I want that it should respond `true` as the given special list is a member of the set T, but it gives me `false`. Help please.

I have a set of sets named T. How I can take all possible unions of the members of T and if the result is not in T already, include it in T. I want to do this using a seq command, but could not do. Can anyone help? This is so to say, T is to be made closed under union.

I have two lists viz.

m:=[0,1,2,3,4,5]; n:=[0,1,2,3,4,5,6,7,8,9];

I have to define a mapping (i.e. a Maple table) say `p` such that

(1) p(0)=0,

(2) p(max(m))=p(max(n)) and

(3) For all other i in m p(i) is a random choice from n but with condition that p(i)>=p(i-1).

Help is desperately needed. regards