The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math.symbolic

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Automatic solving of unprepared polynomial equation systems?
Replies: 8   Last Post: Apr 1, 2013 7:50 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Nasser Abbasi

Posts: 6,677
Registered: 2/7/05
Re: Automatic solving of unprepared polynomial equation systems?
Posted: Mar 31, 2013 4:01 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On 3/31/2013 10:24 AM, Axel Vogt wrote:
> On 31.03.2013 16:15, IV wrote:
> > ...
> [c1=A*B/C, c2=C*A/D, D=c3-A, C=A-B];
> solve(%, [A, B, C, D]);
> Maple 17 solves it, using roots of a cubic (and ignoring
> cases where a denominatror may vanish).

Mathematica V 9.01 solves it as well. But D and A are
reserved. So changed them to lower cases.

eq1 = c1 == A*B/c;
eq2 = c2 == c*A/d;
eq3 = d == c3 - A;
eq4 = c == A - B;
Solve[{eq1, eq2, eq3, eq4}, {A, B, c, d}]

The answer is too long to post here.

Reduce can be attempted also here:

Reduce[{eq1, eq2, eq3, eq4}, {A, B, c, d}]

"Reduce reduces the statement by solving equations or inequalities for
vars and eliminating quantifiers."

screen shot, with Maple answer


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.