Artifact ed6a43327055aebf71c2263401f1c07b14ec1b851696af156affe16a5de06e98:

• Executable file r37/lisp/csl/html/r37_0404.html — part of check-in [f2fda60abd] at 2011-09-02 18:13:33 on branch master — Some historical releases purely for archival purposes

  git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 727) [annotate] [blame] [check-ins using] [more...]

<A NAME=gsplit>

<TITLE>gsplit</TITLE></A>
<b><a href=r37_idx.html>INDEX</a></b><p><p>



<B>GSPLIT</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
 <P>
<P>
 <P> <H3> 
syntax: </H3>
<em>gsplit</em>(&lt;p&gt;[,&lt;vars&gt;]); 
<P>
<P>
<P>
where &lt;p&gt; is a polynomial or a list of polynomials. 
<P>
<P>
The polynomial is reordered corresponding to the 
the current 
<A HREF=r37_0353.html>term order</A> and then 
separated into leading term and reductum. Result is 
a list with the leading term as first and the reductum 
as second element. 
 <P> <H3> 
examples: </H3>
<P><PRE><TT>

  torder lex;
  
  gsplit(x**2+2x*y+y**2,{y,x}); 

  {y**2,2y*x+x**2}

</TT></PRE><P><P>
<P>