DoExist := proc(tau, n)

if rtable_num_elems(tau) >= n then

        return tau[n];

else

        return 0;

end if;

end proc;

g1 := [0, y, x];

g2 := [0, y^2-x-y, 0];

g3 := [x, x+y, 0];

g4 := [y, -y, 0];

g5 := [0, x*y+x/2+y/2, 0];

g6 := [0, x^2-x/4-y/4, 0];

m1 := Basis(g1, tdeg...

https://skydrive.live.com/redir?resid=E0ED7271C68BE47C!358

1/x!*subs(z=0,Diff(g(z)^x, x$(x-1))) = n*x

1/x!*subs(z=0,Diff(g(z)^x, z$(x-1))) = n*x

how to solve for g(z) ?

as i do not know what do this respect to which variable from a book. so i capture this diagram.

hope that can solve it

L := Summation(Summation(g(m, n)-g(m-1, n)-g(m, n-1), m = 1 .. 3), n = 1 .. 3);

M1 := subs(m=1, g(m, n)-g(m-1, n)-g(m, n-1))=0;

rsolve(rhs(M1),g,'genfunc'(1,b));

Error, invalid input: rsolve uses a 2nd argument, Fcns, which is missing

Reference:

Matrix([[0, g(0,1), g(0,2)],[g(1,0), g(1,1), 0],[g(2,0), 0, g(2,2)]]);

like f# do

match(tree)

with| verification('hyporesult'(alpha,beta), 'dedeuceto'('Conj'(alpha,beta),gamma) -> 'hyporesult'('Conj'(alpha,gamma),beta)

need to get hyporesult is prefix, and then use if the compare, and get first parameter and second parameter such as for 'Conj'(alpha, gamma)

i use typefunc('hyporesult'(alpha,beta)) can not get 'hyporesult'

moreover...

How to write notation for logical induction programming in Maple like F# or Haskell having tuples?

such as 

Conj(A,Disj(B,C)) ...