Artifact cff9158b0ae8a1e9d09ef3e6e29b223aff65dd2cd70ae9867c9fd1561d92a817:

• Executable file r37/lisp/csl/html/r37_0398.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: 873) [annotate] [blame] [check-ins using] [more...]

<A NAME=preducet>

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



<B>PREDUCET</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
 <P> <H3> 
syntax: </H3>
<P>
<P>
<em>preduce</em>(&lt;p&gt;,{&lt;v&gt;=&lt;exp&gt;...}) 
<P>
<P>
<P>
where &lt;p&gt; is an expression, &lt;v&gt; are kernels 
(simple or indexed variables), 
<em>exp</em> are polynomials. 
<P>
<P>
<em>preducet</em>computes the remainder of &lt;p&gt; modulo {&lt;exp&gt;,...} 
similar to 
<A HREF=r37_0386.html>preduce</A>, but the result is an equation 
which expresses the remainder as combination of the polynomials. 
 <P> <H3> 
example: </H3>
<P><PRE><TT>
                             
   GB2 := {G1=2*X - Y + 1,G2=9*Y**2  - 2*Y - 199}
   preducet(q=x**2,gb2);

 - 16*Y + 208= - 18*X*G1 - 9*Y*G1 + 36*Q + 9*G1 - G2
</TT></PRE><P><P>
<P>