217 Reputation

7 Badges

5 years, 127 days

MaplePrimes Activity

These are replies submitted by MDD

@Preben Alsholm You are right. But in my study, parameters a, b, c,... can specialize in real number. I want one command that could conclude that when a^13b^17 is none zero then a<>0 and b<>0.

@Carl Love What is your idea about the following example?


@Carl Love Thanks I think that the assuming command is better.

@Carl Love Therefore you suggest me to use assuming command in my procedure?

@Carl Love Thanks. I want use from above assume command (Kitonum answer) in my procedure. Can I use at middle of procedure from interface(showassumed= 0) command, automatically?

@Kitonum Thank you so much. When I use your answer and then type 'a' it is appears to form 'a~'. Why this is happen?

@Kitonum When this error is appear usually?

@Kitonum I used from your short procedure in my implementation. In the middle of running of my implementation appears the following error where is related with your short procedure. The error is

"Error, (in unknown) invalid input: `expand/power` uses a 2nd argument, e, which is missing"


In fact at the middle of my implementation the input of your short procedure is



If I use from your short proc for these inputs seperatly, it work correctly but, in the middle of run, when program call your short proc, the above error is appeared. What is problem?

@Kitonum Is this a general method?


@Markiyan Hirnyk But your input is two list. I want C only.

@Kitonum Thanks but I want a general method.

@roman_pearce I want not happend this error in the running of my algorithm. What I have to do?


lt(p,T)=LeadingCoefficient(p,T)*LeadingTerm(p,T). Is there any question?


I think that the coeffs command use from my procedure.


There is a minor fault in the answer of Carl. For example if p=x^2 then by using Maple 14 we have


For this simple question I implement the following procedure: In this procedure f is a polynomial and T is a monomial ordering such as lex or tdeg ordering.


FL := proc (f, T)
local L, p;
L := [];
p := f;
while p <> 0 do
    L := [op(L), lt(p, T)];
    p := simplify(p-lt(p, T))
end do;
end proc:




3 4 5 6 7 8 9 Page 5 of 9