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

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

Hi there,

I have the following complex-valued function,in polar coordinates:

Gamma is an arbitrary real constant.

How can a generate a 2D plot of w(z) using maple? 

Thanks!

Dearz 

I want to ask how to run multiple program at a time in maple? I am waiting your positive response. 

Hello,

I have a problem with graph using odeplot.

As showed in lower picture, the value of the y axis is so long.

So, i want to adjust the display digits to decrease the length of the values.

Do you have any method to do it?

Thank you!

I would like to check if op(n,g) exists for a given function g and a positive integer n.
How do I do it?
Naturally, I don't have the function g. It is theoretically created.
Thank you!

mapleatha

How do I solve a differential equation in Maple?"

Hello!

How can I make a list containing all inequalities
A[i,j] >=0 where A is a nxm-matrix?

This works, but si laborious:
[(A[i,1]>=0)$i=1..3,(A[i,2]>=0)$i=1..3,(A[i,3]>=0)$i=1..3];

works, but result is nested:
[[(A[i,j]>=0)$i=1..3]$j=1..3];

should work, but doesn't - why?
[((A[i,j]>=0)$i=1..3)$j=1..3];

Thanks in advance
Rainer

Hi,

Not sure if I'm just being a bit daft but I'm struggling to obtain the correct solution to the following...

If we have the following:

And I enter the following into Maple:

Which I believe to be correct.  When I try to use p within the limit function, I cannot seem to get the answer 2 ?

What am I doing wrong here?  It's driving my bonkers!

Thankyou.

Hi,

I have an inverse I solved for with RootOf, which I transfrom and then try to numerically integrate the transformation. I get the following error: Error, (in convert/radical) too many levels of recursion

Integrating the inverse itself works, it is after applying the transformation 1/(1+x²) that I get the issue. Eventually I want to integrate something less simple, but here the problem already starts. 

Thanks for the help! Its for science! 
 

Download recursionerror.mw

Hey all together,

this is my first question in this community and it is maybe a very simple one:

If I have a given matrix. How can I process individual elements with an mathmatical operation?

For example, I have a diagonal matrix and want to get a matrix in which every non-zero element is the square root of the inverse of its former element.

Has someone an idea?

Thank you very much!