 LIB "solve.lib";
ring r = 0,(x,y),lp;
// compute the intersection points of two curves
ideal s = x2 + y2  10, x2 + xy + 2y2  16;
def R = triangM_solve(s,10);
==>
==> // 'triangM_solve' created a ring, in which a list rlist of numbers (the
==> // complex solutions) is stored.
==> // To access the list of complex solutions, type (if the name R was assig\
ned
==> // to the return value):
==> setring R; rlist;
setring R; rlist;
==> [1]:
==> [1]:
==> 1
==> [2]:
==> 3
==> [2]:
==> [1]:
==> 2.8284271247
==> [2]:
==> 1.4142135624
==> [3]:
==> [1]:
==> 2.8284271247
==> [2]:
==> 1.4142135624
==> [4]:
==> [1]:
==> 1
==> [2]:
==> 3
