<?xml version="1.0" encoding="UTF-8"?>










<rss version="2.0" xmlns:jf="http://www.jivesoftware.com/xmlns/jiveforums/rss">
    <channel>
        <title>Math Forum</title>
        <link>http://mathforum.org/kb</link>
        <description>List of forum topics</description>
        <language>en</language>


        <item>
            <title>Re: for all integers x coprime to n, x^(n-1) = 1 mod n -&amp;gt; that n square  	free</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=6877823&amp;tstart=0#6877823</link>

        

            <description><![CDATA[<br><font color="#660066">&gt; G Patel &lt;gaya.patel@gmail.com&gt; writes:<br>&gt; </font><br><font color="#007777">&gt; &gt; How can I show that if]]></description>

        

            <jf:creationDate>Oct 25, 2009 6:48:54 PM</jf:creationDate>
            <jf:modificationDate>Oct 25, 2009 6:48:54 PM</jf:modificationDate>
            <jf:author>israel@math.MyUniversitysInitials.ca</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>

        <item>
            <title>Re: for all integers x coprime to n, x^(n-1) = 1 mod n -&amp;gt; that n square  	free</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=6877814&amp;tstart=0#6877814</link>

        

            <description><![CDATA[G Patel &lt;gaya.patel@gmail.com&gt; writes:<br><br><font color="#660066">&gt; How can I show that if for all integers x coprime to n,  x^(n-1) =]]></description>

        

            <jf:creationDate>Oct 25, 2009 6:29:58 PM</jf:creationDate>
            <jf:modificationDate>Oct 25, 2009 6:29:58 PM</jf:modificationDate>
            <jf:author>israel@math.MyUniversitysInitials.ca</jf:author>
            <jf:replyCount>1</jf:replyCount>
        </item>

        <item>
            <title>for all integers x coprime to n, x^(n-1) = 1 mod n -&amp;gt; that n square &lt;br>	free</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=6877760&amp;tstart=0#6877760</link>

        

            <description><![CDATA[How can I show that if for all integers x coprime to n,  x^(n-1) = 1<br>(mod n),  then  n is necessarily square free?<br>]]></description>

        

            <jf:creationDate>Oct 25, 2009 5:03:14 PM</jf:creationDate>
            <jf:modificationDate>Oct 25, 2009 5:03:14 PM</jf:modificationDate>
            <jf:author>gaya.patel@gmail.com</jf:author>
            <jf:replyCount>2</jf:replyCount>
        </item>


    </channel>
</rss>

