I agree, that would be nice.

I agree, that would be nice.

Carl, Now I can make all my calculations ina very easy way...thank You again

Carl, Now I can make all my calculations ina very easy way...thank You again

@Carl Love 

In Maple 11 Expand is instantaneous too but only if I execute the command after executing expand. But If I leave the program and start again, this time with Expand, it lasts 10,5 seconds too.

@Carl Love 

In Maple 11 Expand is instantaneous too but only if I execute the command after executing expand. But If I leave the program and start again, this time with Expand, it lasts 10,5 seconds too.

@Carl Love 

They both spend more or less the same amount of time: 10,5 seconds aprox.

But now I know the difference between these commands.

@Carl Love 

They both spend more or less the same amount of time: 10,5 seconds aprox.

But now I know the difference between these commands.

@Carl Love 

If I write in Maple:

(1+x)*x mod 2;

I allways obtain (1+x)*x.

Then I have to expand the expression:

expand((1+x)*x) mod 2;

To obtain x+x^2.

I didn't see any difference when I use "Expand" with capital "E" .

( In fact, the expression I wrote in the first post:

a*b*c+a^2*c*d+d+c^2*d^2*a^2*b^2+d^2*a*b^2*c+d^2*a*b^2+a*c+c*d+d*b+d*a^2*b*c+c+c^2+d^2*a^2*c+d^2*a^2*b^2*c+d^2*b^2+d^2*a+
d^2+b*c^2+c^2*d^2+b*c^2*d+a^2*c^2*b*d+c^2*d^2*a^2+c*d*a*b+a*b^2*c*d+b^2*c*d+b^2*c^2*d+d^2*a*c+a^2*b^2*c^2*d+b*c+d*a*b+d*a+
a^2*c^2+a^2*c^2*b+c^2*d^2*b^2

is obtained after using the "expand" command on my original expression).

That's why I thougt that although Maple has to treat X^2 + X as an irreducible polynomial
it could "simplify" the expression under some command like "expand" or similar as an exception in Z[2].
But this work is done with the redefinition you propose.

If I do the same with the redefinition of command 'mod', when I write

expand((1+x)*x) mod 2;

I obtain "0" directly. 

Thank You very much for your help.
 

@Carl Love 

If I write in Maple:

(1+x)*x mod 2;

I allways obtain (1+x)*x.

Then I have to expand the expression:

expand((1+x)*x) mod 2;

To obtain x+x^2.

I didn't see any difference when I use "Expand" with capital "E" .

( In fact, the expression I wrote in the first post:

a*b*c+a^2*c*d+d+c^2*d^2*a^2*b^2+d^2*a*b^2*c+d^2*a*b^2+a*c+c*d+d*b+d*a^2*b*c+c+c^2+d^2*a^2*c+d^2*a^2*b^2*c+d^2*b^2+d^2*a+
d^2+b*c^2+c^2*d^2+b*c^2*d+a^2*c^2*b*d+c^2*d^2*a^2+c*d*a*b+a*b^2*c*d+b^2*c*d+b^2*c^2*d+d^2*a*c+a^2*b^2*c^2*d+b*c+d*a*b+d*a+
a^2*c^2+a^2*c^2*b+c^2*d^2*b^2

is obtained after using the "expand" command on my original expression).

That's why I thougt that although Maple has to treat X^2 + X as an irreducible polynomial
it could "simplify" the expression under some command like "expand" or similar as an exception in Z[2].
But this work is done with the redefinition you propose.

If I do the same with the redefinition of command 'mod', when I write

expand((1+x)*x) mod 2;

I obtain "0" directly. 

Thank You very much for your help.
 

Carl,
thank You very much  for your answer, it is exactly what I need.
I was wondering if it could be possible to implement an exception under the command "expand" or something similar when dealing with Z[p] and p = 2. But the redefinition of the command "mod" you suggest is simply perfect.

Carl,
thank You very much  for your answer, it is exactly what I need.
I was wondering if it could be possible to implement an exception under the command "expand" or something similar when dealing with Z[p] and p = 2. But the redefinition of the command "mod" you suggest is simply perfect.

Dear Markiyan.

First of all thank You for Your interest in my post.

I know the logic package, and I think is amazing.

But please, forget everthing I have said about propositional logic and let's see that the technical point is:

If Maple "knows" that "x+x" is "0" modulo 2, it should "know" that "x*x" is "x" modulo 2. Maple doesn't take into account that variables modulo 2 are idempotent, and this has nothing to do with propositional logic.

I made a mistake talking about what has motivated the subject, sorry.

I am not asking how to know if a proposition is true with Maple. I am talking about something that from my point of view can improve the calculations modulo 2 in Maple.

Best regards

Dear Markiyan.

First of all thank You for Your interest in my post.

I know the logic package, and I think is amazing.

But please, forget everthing I have said about propositional logic and let's see that the technical point is:

If Maple "knows" that "x+x" is "0" modulo 2, it should "know" that "x*x" is "x" modulo 2. Maple doesn't take into account that variables modulo 2 are idempotent, and this has nothing to do with propositional logic.

I made a mistake talking about what has motivated the subject, sorry.

I am not asking how to know if a proposition is true with Maple. I am talking about something that from my point of view can improve the calculations modulo 2 in Maple.

Best regards