1) Consider the followin Integral:

int(cosh(a*x)*cos(b*x),x)

How can I tell maple to give the results in terms of hyperbolic and harmonic funtions?
The maple returns the answer in term of exponentials with imaginary powers.
Also, I could not use the "simplify" command to turn the answer returned by maple into an answer in terms of what I want! Please see the code below.


2) Is there a way that I can update the maple integration database manaully?

Example.mw

Hi,

I am new to the Maple Forum and have the following question.I am calculating some Gaussian error propagations and other equations and did this in this way:

[eval(diff(x(y,z),y),[y=...,z=...])²*(dy)²+eval(diff(x(y,z),z),[y=...,z=...])²*(dz)²]^1/2

Now I am having several dozens of different y and z for which I have to calculate the above equation. How can I define these variables y and z only once at the beginning before all equations and press the button !!! that everything afterwards is just calculated with the defined variables? This way I would only have to change the variables once instead of several times in each term and for each equation.

Thank you very much. I appreciate your help!

L

Is it possible to evaluate a function at multiple points described by an array or something of that sort and have Maple return the evaluations as an array. I need approximations of a function at various values of its argument so it would be nice to do it with a single command.

Thanks

How do I make "simplify" function to recognize complex exponentials. Maple created some exponentiol functions with a square root of negative expression in the denominator of the exponent. It refuses to simplify it. If I manually edit it, by taking negative sign under the root and adding immaginary number, the simplification works. How do I simplify it without manual edit?

The Eq 33 is manually edited line. Simplify function correctly uses cos function.

The Eq 34 is original expression. I tried to tell maple to assume real numbers hoping that it will wotk, but it did not.

I have question about how to write the expression to get the order in the sequence?

For exmple, if I have this sequence,

E:=[0,2,7,15,26,40]

I want to write a procedure that tells me the location of any input,x in the sequence E.

For example, if I choose x:=3, then the number 3 is actually between 2 and 7, so it will give me the answer C(x)=3 (because 7 is the third elemet).

I try to write the procedure but there always wrong! I do not know what expression should I write!

C:=proc(x)
local
for i from 1 to nops(E) do
if x<=E[i] then
c:=E[i]
fi;od;
end;

Please help! 

hi

I need your help,it is very necessary.I want to write two dimensional arrays to a file ,and then I should be able to read it again.I appericiate your help.

How do i use d'Alembert formula to solve,plot and animate with Maple software

Hi!

I seem to run into problems with (quantum) perturbation theory. In the following minimal working example, an energy denominator, as occuring in perturbation theory is not evaluated if I previously assume that the quantum number is a positive integer. It's supposed to return an error, as the energy denominator is 0.

Download energy_denominator.mw

Best regards,

Sören

how to calculate the cobordism between two ideals

Hi,

I was helping for a computing session today.

Maple 17 and 18 were not plotting the following:

restart:

with(plots):
spacecurve([x,cos(x), sin(x)], x = 0..10);

On some of the machines, with campus site license, windows 7, x64.

The plot came up with a "frame" only. And nothing was plotted.

We really can't figure out why?

Something to do with the settings(options)?

Had anyone had a similar experience?

Thanks,

casper

Find a series solution of the differental equation

y'=2*x*y

do graph have invariant for invariant of cayley graph

for example, how to convert below word relation into graph

a^2 = 1

a*b = b*a

my code can only do for one variable, 

how to make divisible checking for multivariable cases with the ordering such as plex

IsDivisible(LP(h, t), LP(g[i], t), x)

it is not only x when multivariable

f:=LP(y^2*x,plex(x, y))[2];
g:=LP(y*x-y,plex(x, y))[2];
Remainder(f, g, gcd(f,g));
degree(Remainder(f, g, x),x);
degree(g, x);

remainder has error expect its 3rd argument x, to be of type or but received y*x

how to do if have ordering

do it need to check whether both f and g have variable x using indets and then apply remainder?

do it need to check each variable starting from the first variable in the ordering? 

how about if f has variable x but g do not have variable x, or f do not have variable x and g have variable x

if so, i try to replace below code in the bottom code, it has error

Error, (in FindDivisble) cannot determine if this expression is true or false: 0 < Search(x, {x, y})

FindDivisble := proc(g, h, t)
with(ListTools):
result := 0;
for i from 1 to nops(g) do
mainvariable := 0;
for j from 1 to nops(t) do
mainvariable := op(j, t);
if mainvariable <> 0 then
if Search(mainvariable, indets(h)) > 0 and Search(mainvariable, indets(g[i])) > 0 then
if IsDivisible(LP(h,t), LP(g[i],t), mainvariable) = 0 then
return i;
else
result := 0;
end if:
end if:
end if:
od:
od:
return result;
end proc:

with(Groebner):
LP := proc(f, t)
return LeadingTerm(f, t)/LeadingCoefficient(f, t);
end proc:
IsDivisible := proc(f, g, x)
with(Algebraic):
if Remainder(f, g, x) = 0 or degree(Remainder(f, g, x),x) < degree(g, x) then
return 0;
else
return 1;
end if:
end proc:
FindDivisble := proc(g, h, t)
result := 0;
for i from 1 to nops(g) do
if IsDivisible(LP(h, t), LP(g[i], t), x) = 0 then
return i;
else
result := 0;
end if:
od:
return result;
end proc:
MD := proc(f, g, t)
r := 0;
u := Matrix(nops(g), 1);
for j from 1 to nops(g) do
u[j] := 0;
od:
h := f;
while h <> 0 do
i := FindDivisble(g, h, t);
if i > 0 then
u[i] := u[i] + LeadingTerm(h, t)/LeadingTerm(f[i], t);
h := h - LeadingTerm(h, t)/LeadingTerm(f[i], t)*f[i];
else
r := r + LeadingTerm(h, t);
h := h - LeadingTerm(h, t);
end if:
od:
end proc:
f:=y^2*x;
f1 := y*x-y;
f2 := y^2-x;
MD(f,[f1,f2],plex(x, y));

So I'm trying to make a procedure to tell is a sequence is graphical or not.
seqgraph:= proc (L::list)

local k::integer, i::integer, n::integer, a::integer, S;

n := numelems(L);

S := convert(L, `+`);

a := 0;

if type(S, odd) then print("not graphical")

else for k to n do

if add(L[i], i = 1 .. k) <= k(k-1)+add(min(k, L[i]), i = k+1 .. n) then a := a+1

else a := a+2

end if;

end do;

end if;
if n = a then print(graphical)

else print("not graphical")

end if;

end proc;

 I'm trying to say that if that equality (which is part of the erdos gallai theorem) holds for that value of k then we'll add one to a value (a). Thus, if a=n at the end then the ineuqality was true for each k and thus it would it should print "graphical" but every list I test it one prints 'not graphical'. Where is my mistake? I get an error saying it can't execute add?