<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" version="2.0">
  <channel>
    <title>MaplePrimes - answers and comments on Question, multiplying congruence classes</title>
    <link>http://www.mapleprimes.com/questions/35490-Multiplying-Congruence-Classes</link>
    <language>en-us</language>
    <copyright>2026 Maplesoft, A Division of Waterloo Maple Inc.</copyright>
    <generator>Maplesoft Document System</generator>
    <lastBuildDate>Fri, 12 Jun 2026 04:50:47 GMT</lastBuildDate>
    <pubDate>Fri, 12 Jun 2026 04:50:47 GMT</pubDate>
    <itunes:subtitle />
    <itunes:summary />
    <description>The latest answers and comments added to the Question, multiplying congruence classes</description>
    <image>
      <url>http://www.mapleprimes.com/images/mapleprimeswhite.jpg</url>
      <title>MaplePrimes - answers and comments on Question, multiplying congruence classes</title>
      <link>http://www.mapleprimes.com/questions/35490-Multiplying-Congruence-Classes</link>
    </image>
    <item>
      <title>multiplying congruence classes</title>
      <link>http://www.mapleprimes.com/questions/35490-Multiplying-Congruence-Classes?ref=Feed:MaplePrimes:multiplying congruence classes:Comments#answer44059</link>
      <itunes:summary>Manually compute a remainder mod 2.
&lt;pre&gt;
p := x^3+x+1:
f := x^2+x+1:
g := x^2+1:
Rem(f*g, p, x) mod 2;
&lt;/pre&gt;

The upper case Rem works mod p.  Use lowercase rem to compute remainders over the rationals. </itunes:summary>
      <description>Manually compute a remainder mod 2.
&lt;pre&gt;
p := x^3+x+1:
f := x^2+x+1:
g := x^2+1:
Rem(f*g, p, x) mod 2;
&lt;/pre&gt;

The upper case Rem works mod p.  Use lowercase rem to compute remainders over the rationals. </description>
      <guid>44059</guid>
      <pubDate>Wed, 17 Mar 2010 19:57:12 Z</pubDate>
      <itunes:author>roman_pearce</itunes:author>
      <author>roman_pearce</author>
    </item>
  </channel>
</rss>