<?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: Is there a polynomial time algorithm for enumerating prime numbers?</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7834057&amp;tstart=0#7834057</link>

        

            <description><![CDATA[hm; reminds of "the nth binary digit of pi."<br><br><font color="#660066">&gt; of the 5000 largest known primes.<br>&gt; Presumably they don't know]]></description>

        

            <jf:creationDate>Jun 6, 2012 9:53:45 PM</jf:creationDate>
            <jf:modificationDate>Jun 6, 2012 9:53:45 PM</jf:modificationDate>
            <jf:author>Space998@hotmail.com</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>

        <item>
            <title>Re: Is there a polynomial time algorithm for enumerating prime numbers?</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7833651&amp;tstart=0#7833651</link>

        

            <description><![CDATA[On Jun 5, 7:37 pm, "Peter Percival" &lt;peterxperci...@hotmail.com&gt;<br>wrote:<br><font color="#660066">&gt; Let p_n be the n-th prime number (p_1]]></description>

        

            <jf:creationDate>Jun 6, 2012 12:13:12 AM</jf:creationDate>
            <jf:modificationDate>Jun 6, 2012 12:13:12 AM</jf:modificationDate>
            <jf:author>grahamcooper7@gmail.com</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>

        <item>
            <title>Re: Is there a polynomial time algorithm for enumerating prime numbers?</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7833575&amp;tstart=0#7833575</link>

        

            <description><![CDATA[On Jun 5, 5:49 pm, "christian.bau" &lt;christian....@cbau.wanadoo.co.uk&gt;<br>wrote:<br><font color="#660066">&gt; On Jun 5, 3:58 pm, "Peter]]></description>

        

            <jf:creationDate>Jun 5, 2012 6:37:28 PM</jf:creationDate>
            <jf:modificationDate>Jun 5, 2012 6:37:28 PM</jf:modificationDate>
            <jf:author>pubkeybreaker@aol.com</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>

        <item>
            <title>Re: Is there a polynomial time algorithm for enumerating prime numbers?</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7833562&amp;tstart=0#7833562</link>

        

            <description><![CDATA[On Jun 5, 3:58 pm, "Peter Percival" &lt;peterxperci...@hotmail.com&gt;<br>wrote:<br><br><font color="#660066">&gt; Suppose that, having read Timothy]]></description>

        

            <jf:creationDate>Jun 5, 2012 5:49:47 PM</jf:creationDate>
            <jf:modificationDate>Jun 5, 2012 5:49:47 PM</jf:modificationDate>
            <jf:author>christian.bau@cbau.wanadoo.co.uk</jf:author>
            <jf:replyCount>1</jf:replyCount>
        </item>

        <item>
            <title>Re: Is there a polynomial time algorithm for enumerating prime numbers?</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7833414&amp;tstart=0#7833414</link>

        

            <description><![CDATA["Peter Percival" wrote:<br><font color="#660066">&gt;Pubkeybreaker wrote:</font><br><font color="#007777">&gt;&gt;"Peter Percival"]]></description>

        

            <jf:creationDate>Jun 5, 2012 12:12:07 PM</jf:creationDate>
            <jf:modificationDate>Jun 5, 2012 12:12:07 PM</jf:modificationDate>
            <jf:author>quasi@null.set</jf:author>
            <jf:replyCount>1</jf:replyCount>
        </item>

        <item>
            <title>Re: Is there a polynomial time algorithm for enumerating prime numbers?</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7833409&amp;tstart=0#7833409</link>

        

            <description><![CDATA[On Jun 5, 10:58 am, "Peter Percival" &lt;peterxperci...@hotmail.com&gt;<br>wrote:<br><font color="#660066">&gt; On Tue, 05 Jun 2012 11:49:50 +0100,]]></description>

        

            <jf:creationDate>Jun 5, 2012 11:33:34 AM</jf:creationDate>
            <jf:modificationDate>Jun 5, 2012 11:33:34 AM</jf:modificationDate>
            <jf:author>pubkeybreaker@aol.com</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>

        <item>
            <title>Re: Is there a polynomial time algorithm for enumerating prime&lt;br> numbers?</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7833383&amp;tstart=0#7833383</link>

        

            <description><![CDATA[On Tue, 05 Jun 2012 11:49:50 +0100, Pubkeybreaker &lt;pubkeybreaker@aol.com&gt;  <br>wrote:<br><br><font color="#660066">&gt; On Jun 5, 5:37 am,]]></description>

        

            <jf:creationDate>Jun 5, 2012 10:58:47 AM</jf:creationDate>
            <jf:modificationDate>Jun 5, 2012 10:58:47 AM</jf:modificationDate>
            <jf:author>peterxpercival@hotmail.com</jf:author>
            <jf:replyCount>5</jf:replyCount>
        </item>

        <item>
            <title>Re: Is there a polynomial time algorithm for enumerating prime&lt;br> numbers?</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7833382&amp;tstart=0#7833382</link>

        

            <description><![CDATA[On Tue, 05 Jun 2012 12:05:59 +0100, Timothy Murphy &lt;gayleard@eircom.net&gt;  <br>wrote:<br><br><font color="#660066">&gt; Peter Percival]]></description>

        

            <jf:creationDate>Jun 5, 2012 10:54:17 AM</jf:creationDate>
            <jf:modificationDate>Jun 5, 2012 10:54:17 AM</jf:modificationDate>
            <jf:author>peterxpercival@hotmail.com</jf:author>
            <jf:replyCount>0</jf:replyCount>
        </item>

        <item>
            <title>Re: Is there a polynomial time algorithm for enumerating prime numbers?</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7833307&amp;tstart=0#7833307</link>

        

            <description><![CDATA[Peter Percival wrote:<br><br><font color="#660066">&gt; Let p_n be the n-th prime number (p_1 = 2, etc).  Is there a polynomial<br>&gt; P(n), and an]]></description>

        

            <jf:creationDate>Jun 5, 2012 7:05:59 AM</jf:creationDate>
            <jf:modificationDate>Jun 5, 2012 7:05:59 AM</jf:modificationDate>
            <jf:author>gayleard@eircom.net</jf:author>
            <jf:replyCount>1</jf:replyCount>
        </item>

        <item>
            <title>Re: Is there a polynomial time algorithm for enumerating prime numbers?</title>
        
            <link>http://mathforum.org/kb/thread.jspa?messageID=7833324&amp;tstart=0#7833324</link>

        

            <description><![CDATA[On Jun 5, 5:37 am, "Peter Percival" &lt;peterxperci...@hotmail.com&gt;<br>wrote:<br><font color="#660066">&gt; Let p_n be the n-th prime number (p_1]]></description>

        

            <jf:creationDate>Jun 5, 2012 6:49:50 AM</jf:creationDate>
            <jf:modificationDate>Jun 5, 2012 6:49:50 AM</jf:modificationDate>
            <jf:author>pubkeybreaker@aol.com</jf:author>
            <jf:replyCount>6</jf:replyCount>
        </item>


    </channel>
</rss>

