<?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: Prime numbers and primality tests</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8127114&amp;tstart=0#8127114</link>

        

            <description><![CDATA[The original post had this comment:<br>"It is interesting to note, however, that the Lucas pseudo prime<br>method of primality testing apparently]]></description>

        

            <jf:creationDate>Jan 22, 2013 11:18:44 PM</jf:creationDate>
            <jf:modificationDate>Jan 22, 2013 11:18:44 PM</jf:modificationDate>
            <jf:author>bobbaillie@frii.com</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>

        <item>
            <title>Re: Prime numbers and primality tests</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8116211&amp;tstart=0#8116211</link>

        

            <description><![CDATA[I forgot to say:  if a composite N passes the usual probable prime<br>test<br>  b^(N-1) = 1 (mod N)<br>for one base b, then it is more likely than]]></description>

        

            <jf:creationDate>Jan 21, 2013 12:06:23 AM</jf:creationDate>
            <jf:modificationDate>Jan 21, 2013 12:06:23 AM</jf:modificationDate>
            <jf:author>bobbaillie@frii.com</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>

        <item>
            <title>Re: Prime numbers and primality tests</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8113745&amp;tstart=0#8113745</link>

        

            <description><![CDATA[I wouldn't use the Lucas pseudoprime test by itself.  The key is to<br>use a regular pseudoprime test a^(N-1) = 1 (mod N) (like Miller-Rabin)<br>AND]]></description>

        

            <jf:creationDate>Jan 20, 2013 1:25:30 AM</jf:creationDate>
            <jf:modificationDate>Jan 20, 2013 1:25:30 AM</jf:modificationDate>
            <jf:author>bobbaillie@frii.com</jf:author>
            <jf:replyCount>1</jf:replyCount>
        </item>

        <item>
            <title>Re: Prime numbers and primality tests</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8109712&amp;tstart=0#8109712</link>

        

            <description><![CDATA[On Monday, January 14, 2013 8:28:20 PM UTC-8, john...@gmail.com wrote:<br><font color="#660066">&gt; A straightforward way to test a prime number]]></description>

        

            <jf:creationDate>Jan 19, 2013 1:14:00 AM</jf:creationDate>
            <jf:modificationDate>Jan 19, 2013 1:14:00 AM</jf:modificationDate>
            <jf:author>amzoti@gmail.com</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>

        <item>
            <title>Prime numbers and primality tests</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=8068772&amp;tstart=0#8068772</link>

        

            <description><![CDATA[A straightforward way to test a prime number candidate is the Miller-Rabin test (sometimes called the Rabin-Miller test).  This well known and]]></description>

        

            <jf:creationDate>Jan 14, 2013 11:28:20 PM</jf:creationDate>
            <jf:modificationDate>Jan 14, 2013 11:28:20 PM</jf:modificationDate>
            <jf:author>johnfeth@gmail.com</jf:author>
            <jf:replyCount>4</jf:replyCount>
        </item>


    </channel>
</rss>

