restart;

sys:=diff(fi1(t),t,t)=(m0-m)/5, diff(fi2(t),t,t)=m/50:

m0:=200:  m:=(fi1(t)-fi2(t))*32.2+(diff(fi1(t),t)-diff(fi2(t),t))*10:

dsol2:=dsolve({sys,fi1(0)=0,fi2(0)=0,D(fi1)(0)=0,D(fi2)(0)=0}):

fi1:=unapply(rhs(dsol2[1]), t): fi2:=unapply(rhs(dsol2[2]), t):

t1:=fsolve(D(fi1)(t)=10);  t2:=fsolve(D(fi2)(t)=10);

plot([piecewise(t>=0 and t<=t1, D(fi1)(t), 10), piecewise(t>=0 and t<=t2

, D(fi2)(t), 10)], t=0..10, color=[red,green], thickness=2); 

These are the very simple problems. See help on Maple commands:

1.  dsolve

2.  plots[fieldplot]   and   plots[fieldplot3d]

3.  plot3d  - 3rd variant in Calling Sequence

I recorded your data as 2 matrices consisting of lists simultaneously correcting several errors:

A:=<[0.55,0.67,0.78,0.89],[0.7,0.8,0.8,0.9],[0.767,0.867,0.93,0.967],[0.72,0.83,0.83,0.93];    

[0.67,0.78,0.89,0.97],[0.8,0.9,1,1],[0.73,0.83,0.867,0.93],[0.66,0.76,0.79,0.90];

[0.78,0.89,0.89,1],[0.8,0.9,1,1],[7.67,8.67,9.3,9.67],[0.55,0.66,0.69,0.79];

[0.78,0.89,0.89,1],[0.06,0.13,0.167,0.267],[0.8,0.9,1,1],[0.76,0.86,0.90,0.97];

[0.78,0.89,0.89,1],[0.8,0.9,1,1],[0.06,0.13,0.167,0.267],[0.76,0.86,0.90,0.97];

[0.74,0.85,0.93,1],[0.67,0.767,0.83,0.9],[0.73,0.83,0.867,0.93],[0.62,0.72,0.83,0.90];

[0.59,0.70,0.74,0.85],[0.567,0.667,0.73,0.83],[0.667,0.767,0.83,0.9],[0.69,0.79,0.86,0.93];

[0.74,0.85,0.93,1],[0.7,0.8,0.9,0.93],[0.567,0.667,0.73,0.83],[0.79,0.90,0.97,1];

[0.70,0.81,0.85,0.96],[0.7,0.8,0.9,0.93],[0.7,0.8,0.8,0.9],[0.59,69,0.76,0.86]>:

V:=<[0.7,0.8,0.8,0.9],[0.8,0.9,1,1],[0.767,0.867,0.93,0.967],[0.43,0.53,0.567,0.667],

[0.73,0.83,0.867,0.93],[0.8,0.9,1,1],[0.067,0.1,0.2,0.3],[0.73,0.83,0.867,0.93],[0.53,0.63,0.667,0.767]>:

Matrix(9,4, (i,j)->zip((a,v)->a*v, A[i,j], V[i,1]));  # Final answer

Example with 4 points:

r:=[12, 56, 29, 78]:

v:=[15, 45, 75, 102]:

map(t->[t[1]*cos(t[2]),t[1]*sin(t[2])], zip((x,y)->[x,y],r,v));

     [[12*cos(15), 12*sin(15)], [56*cos(45), 56*sin(45)], [29*cos(75), 29*sin(75)], [78*cos(102), 78*sin(102)]]

y  is a complex expression, so you can plot only  Re(y)  and  Im(y)  separately or  together as parametric function:

restart;

y := A*(1/x+x*exp(-2*sqrt(-1)*b))+4*sin(h)^2*(2*exp(-sqrt(-1)*b)-3*sin(h)^2*x^(-sin(h))*exp(sqrt(-1)*b*(-sin(h)-1))+3*x^(-sin(h))*exp(sqrt(-1)*b*(-sin(h)-1)))/(3*(1-r))-exp(-2*sqrt(-1)*b)/x-x:

A := (1+r)/(1-r):  r := (1/3)*sin(h)^2:  b := m*Pi*h:  m := 1:  h := 0.05:

plot([Re(y), Im(y)], x=0..3, -1..2, color=[red,blue], thickness=2);

plots[complexplot](y, x=0..3, view=[-1..1,-1..1], thickness=2);

The second plot shows that Rе(y)  and Im(y)  probably  are linearly related.

eq := (4*a^3*b)^(1/2)/(-(a/(4*b))^(1/2))+(4*a^3*b*(4*b/a))^(1/2) = 0:

simplify(eq)  assuming a::positive, b::positive;

simplify(eq)  assuming a::negative, b::negative;

Unfortunately Maple cannot itself find restrictions under which the identity is true.

The problem can be solved without using inequalities:

{solve((1/(a-1)-1/(a+1))*(2*a^2-2)/a = 4/sqrt(2), a)}  minus  {-1, 1};

Rouben Rostamian Your example is not an example of  p versus w. It is the example of a parametrically given function  z->(w(z), p(z))  with  z  as a parameter. Here is the example - the plot  w->p(w)  in the range w=50000..150000 :

restart;
Sys := -(diff(p(z), z)) = 1.289*10^10*(.675+77/(Pi*1.2^2))*(1+x(z))*(1/(Pi*1.2^2*p(z))), diff(x(z), z) = (1.134*10^(-8)*Pi)*1.2^2*(1-x(z))*p(z)/(1+x(z)):
Inc := p(0) = 2*10^6, x(0) = 0:
Sol := dsolve({Inc, Sys}, numeric):
Eq := w = 1560*Pi*(9*z-(1/3)*(z-2.7)^3*((1/3)*2.7^3)):
f := t->fsolve(eval(Eq, w = t), z):
w1 := 50000: w2 := 150000:
z1 := min(f(w1), f(w2)): z2 := max(f(w1), f(w2)):
plot(rhs(Eq), z = 0 .. 7, -100000 .. 200000, labels = [z, w], labelfont = [TIMES, ROMAN, 14]);  # The plot of the function  z->w(z)
plots[odeplot](Sol, [rhs(Eq), p(z)], z = z1 .. z2, color = blue, labels = [w, p], labelfont = [TIMES, ROMAN, 14]);  # The plot of the function  w->p(w)  in the range  w=50000..150000

Of course, it is easier to solve the equation by hand, as M. Hirnyk  wrote, but if you want to solve with Maple, then there are some difficulties. Because all three terms of the equation are non-negative, then the sum is equal to 0 only if each term is equal to 0. But Maple somehow does not solve the simple system  sys . Therefore it is necessary to solve it step by step:

restart;

eq:=abs(a-b)+sqrt(2*b+c)+``(c^2-c+1/4)=0;

L:=op(lhs(eq));

sys:={L[1]=0,L[2]=0,op(L[3])=0};

solve(sys,{a,b,c});  # Incorrect solution

c0:=solve(op(L[3]))[1];  # First we solve the equation  c^2-c+1/4=0

op(solve(eval(sys,c=c0))),c=c0;  # Final answer

If I understand your question then

eval(1.18971*x^0.38480, x=17);  # Or

f:=x->1.18971*x^0.38480:

f(17);

                     3.539303919

                     3.539303919

M := proc (k::nonnegint, n::nonnegint) 

option remember;

if k = 0 or n = 0 then M(k, n) := 0 elif

k = 1 then M(k, n) := n elif

n = 1 then M(k, n) := 1 else

M(k, n) := M(k, n-1)+M(k-1, n-1)+M(k-2, n-2) end if

end proc:

Example (all values for 0<=k, n<=9):

Matrix(10, (i, j) -> M(i-1, j-1) );

 Code was edited.

To really examine your 9 graphs I removed the multiplier 100, 0 in the denominator, add the colors and change the ranges of the axes:

with(plots):

pi:=Pi:

u := sin((1/2)*pi*x)*((1-cosh(pi))*sinh((1/2)*pi*y)+sinh(pi)*cosh((1/2)*pi*y));

implicitplot([u = 10, u = 20, u = 30, u = 40, u = 50, u = 60, u = 70, u = 80, u = 90], x = -5 .. 7, y = -5 .. 7, color=[red, black, khaki, pink, yellow, blue, green, violet, gold], grid = [100, 100]);

 Edit. The set  {u = 10, u = 20, u = 30, u = 40, u = 50, u = 60, u = 70, u = 80, u = 90}  was changed to the list.

For  9 team competition in one round (round-robin tournament or all-play-all tournament)   9*8/2=36  games should be played. Here is the example of a random tournament between teams  A, B, C, E, F, G, H, K, M :

restart;

roll:=rand(0..1):

assign(seq(seq(a[i,j]=roll(),j=i+1..9),i=1..8)):

assign(seq(a[i,i]=` - `, i=1..9)):

assign(seq(seq(a[i,j]=1-a[j,i],j=1..i-1),i=2..9)):

<Vector([[``,A,B,C,E,F,G,H,K,M]])|<Matrix([[A,B,C,E,F,G,H,K,M]]),Matrix(9, (i,j)->a[i,j])>>;

Any such matrix is uniquely determined by the numbers that stand above (or below) the main diagonal. Obviously the number of the all matrices of such type is  2^36 .  If we want to write down all the possible variants in a single matrix, we get a huge matrix with  36  rows and  2^36  columns.

I think the original problem can be solved, if we go in 3-D space. We just roll up the plane in a tube (cylinder). Axis  theta goes along the circumference, and the values of the function we read from the vertical axis.

Example:

R := 1:

E := plot([cos(3*theta), 0], theta = 0 .. 2*Pi, color = [red, blue], thickness = [3, 2]):

F := plot([1, -1], theta = 0 .. 2*Pi, color = grey, filled):

plots[display](E, F, scaling = constrained);

A := plot3d([R*cos(theta), R*sin(theta), z], theta = 0 .. 2*Pi, z = -1 .. 1, style = surface, color = grey):

B := plots[spacecurve]([R*cos(theta), R*sin(theta), cos(3*theta)], theta = 0 .. 2*Pi, color = red, thickness = 4, linestyle = solid):

C := plots[spacecurve]([R*cos(theta), R*sin(theta), 0], theta = 0 .. 2*Pi, color = blue, thickness = 3, linestyle = solid):

plots[display](A, B, C, axes = normal, tickmarks = [3, 3, 3], view = [-1.7 .. 1.7, -1.7 .. 1.7, -1.7 .. 1.7], scaling = constrained);

without any equations:

plots[display](plottools[sphere]([0, 0, 0], 1));