In the context of homework, there are some calculations that I do through Maple, and others that I do mostly by hand, and just show my work with Maple's engine that is great at rendering special mathematical formats (like matrices, for example).

I would like to show something like that:

It's pretty easy to make the matrices, right now my line looks like this:

But I would like to refrain for executing the "+" operator and the multiplication by x6 and x7, to have the output like in the first picture. If I disable all execution and take the statement as plain text, then obviously I will not get the correctly rendered matrices.

Is there a way, like an escape character, to prevent specific operations from being executed in one line in particular?

تحميل jam.mw

Hi everybody,

I want to solve numerically an ode and I get this error (undocumented on the maplesoft web site https://www.maplesoft.com/support/help/errors/....)

Error, (in sol) maximum number of event iterations reached (100) at t=2.6610663

I understand where this error can come from but the help pages don't say anything to fix this.
There is some stuff about round-off that could help but I don't understand how to use it.

I would be grateful if you provide me some help.
Thanks in advance


Download ErrorWithDsolve.mw

The graphic below by used maple18

contourplot(-3.392318438*exp(-4.264628895*x)*sin(6.285714286*y), x = -1/2 .. 3/2, y = -1/2 .. 3/2)

Why the graphic below the figure is not integrated, how can develop the graphic

Dear 

Hope everyone is fine. In attached file I solved system of equations. But the solution like this 

Sol[1]:={{...},{...}}

But I want the solution like

Sol[1]:={...}

Please see the attachment and fix my problem

Problem.mw

I want to suppress  ~ when using assume()

I write:

restart;
interface(showassumed = 0);
assume(s>0);
s;
 

but s still appears with tilde?!?

Hello,

I could build the table routh of the characteristic equation of the system by using the function RouthTable( )

I try to find the stability conditions as fonction as the gain g. For that purpose, i have to solve some inequalities.

Each terms of the first column of the routh table should be positive.

I would like to find the conditions on the gain g so that my system is stable.

In order to solve the inequalities as function of g, i must assume the mass, and the spring to be positive. I'm not sure that i have well assumed the parameters to be positive.

Have you some ideas to solve my inequalities and find symbolically the conditions of the gain g? 

I attach an extract of my code.

Thank you for your help

Extract of my code: 

SolvingTableRouth.mw

Hello.

Please help me. I Have to solve some equations with Adomian Decomposition Method in Maple. But i don't know it.

I just know AGM, HPM and Perturbation Method in Maple.

please send me instructions and codes.

I'm sorry, I can't speak English well. I hope you understand what I mean.

thank you

Dear

I am facing to eliminate diff(p(x, y), y, x) from Eq1 and Eq2. My procedure is given below:

Eq1 := 2*rho[nf]*a^2*x*(diff(f(eta), eta, eta))*(diff(f(eta), eta))/h+rho[nf]*sqrt(nu[f])*(diff(f(eta), eta))*a*x*(diff(f(eta), eta, eta))/h^2+rho[nf]*sqrt(nu[f])*f(eta)*a*x*(diff(f(eta), eta, eta, eta))/h^2+2*rho[nf]*omega[0]*a*x*(diff(g(eta), eta))/h = -(diff(p(x, y), y, x))+mu[nf]*a*x*(diff(f(eta), eta, eta, eta, eta))/h^3-sigma[nf]*B[0]^2*a*x*(diff(f(eta), eta, eta))/h;

Eq2 := 0 = -(diff(p(x, y), y, x));

eliminate({Eq1, Eq2}, diff(p(x, y), y, x));

Dear 

I want to graw following points (u[i,j], i=0..M,j=0..N) obtained in Sol[i] in 3D where i takes along x-axes, j y-axis and u along z axes. I also want the style of point plot as surface. Same do for v and w. I am waiting your response, Thanks

3D_plots.mw

TL;DR I'm having problems with the Finite Fields, polynomials over them and related operations. I saw it has been asked  but questions were asked long time ago. Any advice would be appreciated.

I'm trying to develop some algorithms in Maple using Finite Fields. I'm finding it difficult to learn Maple as I find the information on the internet either basic (guides on making sums and so) or too advanced (most of the times Maple Help feels like swimming in the abyss).

At first I started using the Domains package but it's documentation is quite ambiguous and I felt it was too low-level. I switched then to using the Galois Field package making statements like these:

#Example of EUCLIDES algorithm in F7
p:=7:
G7:=GF(p,1);
a:=G7:-ConvertIn(6);
b:=G7:-ConvertIn(5);
gcd:=EUCLIDES(a, b, G7, p);

At this moment, things get very confusing as a and b were elements of F7 but whattype returned they were zppolys. The problem arises when I try to use polynomials in F7[x]. Intuitively, I coded this:

a := modp1(ConvertIn(3*x^6+2*x^2+x+5, x), 7); 
b := modp1(ConvertIn(6*x^4+x^3+2*x+4, x), 7);
mcd:=EUCLIDES(a,b,G7, 7);

as I found the modp1 functions diving in Maple Help. The strange thing is that a and b also claim to be zppolys. Is this normal? Do the elements and the polynomials over the elements have the same type? It's a bit odd.

Also, my implementation of EUCLIDES is as follows:

proc(a::zppoly, b::zppoly, g::symbol, p::integer)
		local r0, r1, r2;
		r0, r1 := a, b;
		while r1 <> g:-ConvertIn(0) do
			r2 := modp1(Rem(r0,r1),p);
			r0 := r1;
			r1 := r2
		end do;
		return r0
	end proc:

Which syntax I find a bit annoying.

The problem gets even worse as I try to implement the Rabin test of irreducibility https://en.wikipedia.org/wiki/Factorization_of_polynomials_over_finite_fields#Rabin.27s_test_of_irreducibility

Which uses the modular composition algorithm, implemented as follows:

modcomp := proc(f::zppoly, g::zppoly, h::zppoly, p::integer)
	local n, m, A, B, i, pol, grad, k, j, BA, b, ri;
	n := modp1(Degree(f));
	m := ceil(n^(1/2));
	A := Matrix(m,n);
	B := Matrix(m,m);

	
	for i from 1 to m do
		pol := repsqua(h, i-1, f, p);
		grad := modp1(Degree(pol));

		for k from 0 to grad do
			A[i, k+1] := modp1(Coeff(pol, k)); 
		end do;

		for j from 1 to m do
			B[i, j] := modp1(Coeff(g, (j-1)+(i-1)*m)); 
		end do;
	end do;

	BA := B.A;
	b := modp1(ConvertIn(0,x),p);

	for i from 1 to m do
		ri := modp1(ConvertIn(0,x),p); 
		pol := 0; 
		for j from 1 to m do
			ri := modp1(Add(ri,modp1(ConvertIn(BA[i,j]*x^(j-1), x),p))); 
                        if j <= numelems(A[i]) then
				pol := pol + A[i, j]*x^(j-1);
			end if;
		end do;
		pol := modp1(ConvertIn(pol,x),p);
		pol := repsqua(pol, i-1, f, p);
		b := modp1(Add(b, modp1(Rem(modp1(Multiply(pol, ri)), f)))); 
	end do;
	return b;
end proc:

That ceirtainly is an annoying syntax plus the fact that the whole implementation of the algorithm doesn't work. I upload a file in case someone has some time to have a look. testIrrFq.mw

I'm quite lost in all that goes about Polynomials and Finite Fields and so in Maple, so any help is appreciated.

I have written the following code; 

Do := proc( F::algebraic , Q::list)
local n:=nops(F), m:=nops(Q);
seq(F[i]~(Q[i]), i=1..n);
end proc:

which does not work

I know there is a really simple mistake but i just cannot see it.

Dear

I want to draw the graphs of the attached system of PDEs for different values of M in 3D please fix my problem. I am waiting your positive response.

graphs_for_pde.mw

It seems rather arbitrary that proc..end proc is allowed inside functions, but none of the other statements from ?index,statement are:

seq(try ln(i) catch: -infinity end try, i=0..2)
seq(proc() try ln(i) catch: -infinity end try end proc(), i=0..2)

Only the second one works, even though syntactically it doesn't seem to be different from the first one.

It would be really convenient to have any statement allowed inside a function, including assignments (as :=, not as assign()) and compound statements:

s:=0: seq(s:=s+i, i=1..10)
s:=0: seq(proc() global s:=s+i end proc(), i=1..10)

This is more compact than using a loop.

how I can  select 2D function (sigma) that these boundary conditions are satisfied?

thanks

sigma(1, z) = 0, sigma(r, 0) = 1, diff(sigma(0, z), r) = 0, diff(sigma(r, 1), z) = 0