Hello everyone
thanks for the help here.
In Mathematica, Reduce[] works like Solve, except that it returns a
Boolean list of possible solutions. I use it to check what
the necessary conditions for the"real" solution to work:
MMA> Reduce[a*x == b, {x}]
MMA> (b == 0 && a == 0) || (a != 0 &&
On Aug 19, 5:39 pm, robin hankin wrote:
> Hello Simon
>
> thanks for this. One problem
> with the solution you mention is that I can't do the
> general case. What I need is the sage equivalent
> of mathematica's Reduce[] function.
>
I think that solve() is the closest that comes to this (thoug
Hello Simon
thanks for this. One problem
with the solution you mention is that I can't do the
general case. What I need is the sage equivalent
of mathematica's Reduce[] function.
Is there one?
rksh
On Thu, Aug 19, 2010 at 10:06 PM, Simon King wrote:
> Hi!
>
> On 19 Aug., 22:41, robin hankin
Hi!
On 19 Aug., 22:41, robin hankin wrote:
> sage>solve([a*b==15*I-5,a*conjugate(b)==-13*I+9],[a,b])
> []
>
> So, from the first two lines I know that a=2+I, b=1+7I should
> be a solution to the system in the third, yet solve() returns empty.
Admittedly I am no expert for symbolics, and I don't
The system is has solutions.
You can use Singular, which is part of Sage:
http://www.singular.uni-kl.de/Manual/3-1-0/sing_1273.htm
> ring r=0,(x,y),lp;
> ideal i=x2+y2-25, x2-y2-y-5;
> LIB "solve.lib";
// ** loaded /sw/share/Singular/LIB/solve.lib (1.39,2009/04/15)
// ** loaded /sw/share/Singu
On Tuesday 14 October 2008, vpv wrote:
> Hello Martin,
>
> Thank you very much for your reply. As you suggested, I computed the
> lexicographical Gröbner basis of the ideal generated by the
> polynomials e. It is:
>
> G = [x15 + x111 + 1, x20 + x111, x21 + x111, x28 + x111 + 1, x29 +
> x111 + 1, x
Hello Martin,
Thank you very much for your reply. As you suggested, I computed the
lexicographical Gröbner basis of the ideal generated by the
polynomials e. It is:
G = [x15 + x111 + 1, x20 + x111, x21 + x111, x28 + x111 + 1, x29 +
x111 + 1, x31 + x111, x39, x46, x47 + x111, x63 + 1, x79 + x111
On Sunday 12 October 2008, vpv wrote:
> Can someone please tell me why it is impossible to solve the following
> system of boolean equations in SAGE:
>
> sage: N=144
> sage: P = BooleanPolynomialRing(N,'x',order='lex')
> sage: t = []
> sage: for i in range(0,N):
> t.append(var(P.gen(i)))
> sag
