How to find inverse function of a multivariable function

for example

f := x^2 + y + z^3

f := x^2 + y^3

Gentlepeople.

Given 6 teams [A,B,C,D,E,F] I require that each team plays each other once.

 I can generate the pairs:

lst:=combinat:-choose({A,B,C,D,E,F}, 2);  

{{A, B}, {A, C}, {A, D}, {A, E}, {A, F}, {B, C}, {B, D}, {B, E}, {B, F},  {C, D}, {C, E}, {C, F}, {D, E}, {D, F}, {E, F}}

On a competion night three pairs will compete and it will take 5 nights for all teams to play each other.

now I need some eredite richard who can show me how to produce the five night output:

(instead of comma a 'v' needs to be mapped)

AvF

BvD

CvF

.....

I am trying to invert a function and, during the course, wind up with something like,

a_1*V^P*V + a_2*V^P*V^2 + a_3*V^P*V^3 + a_4*V^P*V^3 + a_5*V^P*V^3 + a_6*V^P*V^4 + \cdots

is there a way to get the poly into a form 

(a_1+a_2+...)*V^P + (b_1+b_2+...)*V^(P+1) + (c_1+c_2+...)*V^(P+2) + .....

?

Thanks. Attached is my Maple 16 sheet.

Download invert2.mw

Hi Maple Prime-ers!

I have a question about efficiency.  I have a set of algebraic equations with some polynomials, that I would like to solve at different points.  I've tried using a for-loop and a map-loop.  Here is a example:

n:=10000;  #Number of solving points
eq1:={b = ''a^2'', c = b^3/2, d = c^(1/2)*4 + b^2}; #Equation to solve

a := convert([seq(i,i=1..n)],Vector);  #timesteps

ans := Vector[column](n)

## Try solving in a for-next loop
t1 := time():
for q from 1 to n do
ans(q):=solve(subs({'a' = a(q)},eq1)):
od:
t2 := time() - t1;

## try solving in a map loop
t1s := time():
ans_s := map(q->solve(subs({'a' = a(q)},eq1)),a);
t2s := time() - t1s;

On my computer (2.2Ghz, 2 cores), these both take 115s to solve.  Using Map over For-Next did not speed up computational speed.  

The problem I wish to tackle has 12 equations, invovles 5th order polynomials, and n ~= 300000.  Solving this set of equations takes 2-3 hours.

Anyone know a more efficient method?  Thanks for reading :D

Please look at the following set.

Why?

Download Set.mw

Notepad displays alt+1, alt+2 and alt+3 as ☺☻♥

Just wondering why Maple displays them as square boxes?  Shouldn't it have the font capability to display them as well?

 what does index mean in maple? for example, if i had RootOf(20+60Z+335Z²+825Z³+1629Z⁴+2520Z⁵, index=3) ?

I'd expect the following to give the result "c+2".

> c := a+b

> simplify(a+b+2)

How can I let Maple know that I'd prefer it to write "c" in place of "a+b" when possible?

Hi! I'm new to Maple. Is there a better way to represent matrices? This is what I've done so far, but the indices (C11, C12, n1, etc) look a little weird and superfluous. Am I doing it the "Maple way"?

Examples:

C=Matrix([[C11,C12],[C12,C22]])

The result of the following lines in Maple is V := [5., 3.,5. 11., 6.] that I think should be V := [5., 3.,5. 0., 6.], is there somthing wrong?

v1:= Vector([-28., -63., -17., -55., 17.], datatype= float[8]):

V:= LinearAlgebra:-Modular:-Mod(11, v1, float[8]);

bug.mw

I have three vectors a, b, c. Knowing that the scalar of product a . b = 1, a. c = 1, b.c=1 and modul of a equal to 1, modul of b equal to 4 and modul of c equal to 4. Now I consider two vectors u = -6*a + b + c and v = 3*a -4*b + c. How to find the angle of two vectors u and v?

Hello, Please how do I compute cdf of student t distribution in maple Tξ+1(.). I have a function that i nvolves student t distribution but finding it difficult to compute student t in the funcion. I am new to maple.

Hi all,

I tried to create the*.exe file by C and call the kernel of maple for calculation.

To understand the OpenMaple, I ran the OpenMaple C code sample, “simple.c” in “<Maple>\ samples\OpenMaple\simple” through Microsoft Visual C++ 2008 but got the incorrect result:

It’s seems that the error is happen due to the wrong maple directory. But according to the description of "kernelopts" in help, the value of mapledir cannot be set.

Refer to the description of  "OpenMaple,Examples" in help , both header file path and library file path had been set:

O/S: Windows (32-bit)

Header file Directories: "C:\Program Files\Maple 17\extern\include"

Library Directories: "C:\Program Files\Maple 17\bin.win"

Environment Variable: "C:\program files\Maple 17\bin.win"

I'd appreciate any help on this topic. Thank a lot.

Dear Maple experts:

I have a very simple question:

I have a polynomial p(x) with integer coefficients and a prime p.  I want to reduce the exponents of this polynomial mod p.  So for example, if p(x) = 1 + x^3 + x^17 + x^19 and p is 17. Then I want Maple to output 1+x^3+1+x^2.

I know how to reduce the coefficients mod p, but not the exponents. Can someone suggest how I might go about doing this.  Thank you very much for your help.

Best wishes

Sunil

if ((a.d-b.c)=0) then print([0,0,0,0])
fi;
MARK:=(a,b,c,d)->[d/(a.d-b.c),-b/(a.d-b.c),-c/(a.d-b.c),a/(a.d-b.c)];