<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Sonnet primes</title>
	<atom:link href="http://www.johndcook.com/blog/2011/03/08/sonnet-primes/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.johndcook.com/blog/2011/03/08/sonnet-primes/</link>
	<description>John D. Cook</description>
	<lastBuildDate>Thu, 23 May 2013 10:27:37 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
	<item>
		<title>By: Sonnet primes in Python &#8212; The Endeavour</title>
		<link>http://www.johndcook.com/blog/2011/03/08/sonnet-primes/comment-page-1/#comment-8611</link>
		<dc:creator>Sonnet primes in Python &#8212; The Endeavour</dc:creator>
		<pubDate>Tue, 08 Jan 2013 13:02:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=7994#comment-8611</guid>
		<description><![CDATA[[...] while back I wrote about sonnet primes, primes of the form ababcdcdefefgg where the letters a through g represent digits and a is not [...] ]]></description>
		<content:encoded><![CDATA[<p>[...] while back I wrote about sonnet primes, primes of the form ababcdcdefefgg where the letters a through g represent digits and a is not [...] </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John V.</title>
		<link>http://www.johndcook.com/blog/2011/03/08/sonnet-primes/comment-page-1/#comment-8610</link>
		<dc:creator>John V.</dc:creator>
		<pubDate>Wed, 09 Mar 2011 17:18:35 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=7994#comment-8610</guid>
		<description><![CDATA[I bet this is impossible without allowing leading zeros to be part of the pattern -- since I seem to recall that the total number of primes with N digits is not between 10^(N-1) and (10^N)-1.]]></description>
		<content:encoded><![CDATA[<p>I bet this is impossible without allowing leading zeros to be part of the pattern &#8212; since I seem to recall that the total number of primes with N digits is not between 10^(N-1) and (10^N)-1.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John V.</title>
		<link>http://www.johndcook.com/blog/2011/03/08/sonnet-primes/comment-page-1/#comment-8609</link>
		<dc:creator>John V.</dc:creator>
		<pubDate>Wed, 09 Mar 2011 17:11:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=7994#comment-8609</guid>
		<description><![CDATA[Hey John -- here&#039;s a real he-man prime challenge:

Find a non-trivial pattern (p1, p2, ... pn) such that the size of the set of primes with that pattern is itself a member of the set!]]></description>
		<content:encoded><![CDATA[<p>Hey John &#8212; here&#8217;s a real he-man prime challenge:</p>
<p>Find a non-trivial pattern (p1, p2, &#8230; pn) such that the size of the set of primes with that pattern is itself a member of the set!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Albert</title>
		<link>http://www.johndcook.com/blog/2011/03/08/sonnet-primes/comment-page-1/#comment-8608</link>
		<dc:creator>Michael Albert</dc:creator>
		<pubDate>Wed, 09 Mar 2011 03:25:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=7994#comment-8608</guid>
		<description><![CDATA[Still obsessed with base 7. All the sonnet numbers are multiples of 6 there, but 204 of them are of the form 6 times a prime.]]></description>
		<content:encoded><![CDATA[<p>Still obsessed with base 7. All the sonnet numbers are multiples of 6 there, but 204 of them are of the form 6 times a prime.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Albert</title>
		<link>http://www.johndcook.com/blog/2011/03/08/sonnet-primes/comment-page-1/#comment-8607</link>
		<dc:creator>Michael Albert</dc:creator>
		<pubDate>Wed, 09 Mar 2011 02:52:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=7994#comment-8607</guid>
		<description><![CDATA[Seemed natural to work in base 7 instead, but of course odd bases are no good. In base 8, there are 1057 solutions, all of which use the digit 0. So, 10 is the first base where there&#039;s a sonnet prime that doesn&#039;t include a 0 digit (and in fact there are 6367 of those.]]></description>
		<content:encoded><![CDATA[<p>Seemed natural to work in base 7 instead, but of course odd bases are no good. In base 8, there are 1057 solutions, all of which use the digit 0. So, 10 is the first base where there&#8217;s a sonnet prime that doesn&#8217;t include a 0 digit (and in fact there are 6367 of those.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
