Artifact 32999688d8efa82d1c22ca5250dda10abc5525ee17c23831c1952bd7d1ec3e33:

• Executable file r37/lisp/csl/html/r37_0386.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=preduce>

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



<B>PREDUCE</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
 <P> <H3> 
syntax: </H3>
<P>
<P>
<em>preduce</em>(&lt;p&gt;, {&lt;exp&gt;, ... }) 
<P>
<P>
<P>
<P>
where &lt;p&gt; is an expression, and {&lt;exp&gt;, ... } is 
a list of expressions or equations. 
<P>
<P>
<em>preduce</em>computes the remainder of <em>exp</em> 
modulo the given set of polynomials resp. equations. 
This result is unique (canonical) only if the given set 
is a <em>groebner</em> basis under the current 
<A HREF=r37_0353.html>term order</A> 
<P>
<P>
see also: 
<A HREF=r37_0398.html>preducet</A> operator. 
<P>
<P>