<?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: A regular expression to check for prime numbers</title>
	<atom:link href="http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/</link>
	<description>My opinion on Teaching, Programming, Technology and Web 2.0 in Mauritius</description>
	<lastBuildDate>Sun, 14 Mar 2010 03:05:13 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Makovec</title>
		<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-223601</link>
		<dc:creator>Makovec</dc:creator>
		<pubDate>Thu, 04 Feb 2010 16:29:41 +0000</pubDate>
		<guid isPermaLink="false">http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-223601</guid>
		<description>Oh, hell - my bloody English. Forgot my previous note :( Shit</description>
		<content:encoded><![CDATA[<p>Oh, hell &#8211; my bloody English. Forgot my previous note <img src='http://www.noulakaz.net/weblog/wp-includes/images/smilies/icon_sad.gif' alt=':(' class='wp-smiley' />  Shit</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Makovec</title>
		<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-223600</link>
		<dc:creator>Makovec</dc:creator>
		<pubDate>Thu, 04 Feb 2010 16:24:50 +0000</pubDate>
		<guid isPermaLink="false">http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-223600</guid>
		<description>I would rather see pattern like this: &quot;^\d*[13579]$&quot; in my scripts.

It&#039;s clear, easy and I think it&#039;s also faster then the one described. If you want negative numbers it&#039;s easy to change.

Anyway it&#039;s nice work and idea!

David</description>
		<content:encoded><![CDATA[<p>I would rather see pattern like this: &#8220;^\d*[13579]$&#8221; in my scripts.</p>
<p>It&#8217;s clear, easy and I think it&#8217;s also faster then the one described. If you want negative numbers it&#8217;s easy to change.</p>
<p>Anyway it&#8217;s nice work and idea!</p>
<p>David</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Weekend miscellany &#8212; The Endeavour</title>
		<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-211022</link>
		<dc:creator>Weekend miscellany &#8212; The Endeavour</dc:creator>
		<pubDate>Sat, 21 Nov 2009 12:01:41 +0000</pubDate>
		<guid isPermaLink="false">http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-211022</guid>
		<description>[...] A regular expression to check for prime numbers [...]</description>
		<content:encoded><![CDATA[<p>[...] A regular expression to check for prime numbers [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pras Sarkar</title>
		<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-210772</link>
		<dc:creator>Pras Sarkar</dc:creator>
		<pubDate>Wed, 18 Nov 2009 18:23:55 +0000</pubDate>
		<guid isPermaLink="false">http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-210772</guid>
		<description>This is really intriguing, but I&#039;m unclear about your explanation about how it works (it definitely works). For example, try the number 49 (not prime) - 1111111111111111111111111111111111111111111111111 - neither (11)+ matches nor (111)+ matches, so you would think the regex would classify 49 as prime (it does not). So how does it really work?</description>
		<content:encoded><![CDATA[<p>This is really intriguing, but I&#8217;m unclear about your explanation about how it works (it definitely works). For example, try the number 49 (not prime) &#8211; 1111111111111111111111111111111111111111111111111 &#8211; neither (11)+ matches nor (111)+ matches, so you would think the regex would classify 49 as prime (it does not). So how does it really work?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: perler</title>
		<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-208869</link>
		<dc:creator>perler</dc:creator>
		<pubDate>Tue, 03 Nov 2009 12:14:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-208869</guid>
		<description>this was good shit. thanks!</description>
		<content:encoded><![CDATA[<p>this was good shit. thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: akash</title>
		<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-203561</link>
		<dc:creator>akash</dc:creator>
		<pubDate>Thu, 17 Sep 2009 01:23:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-203561</guid>
		<description>a language such that a string is made of binary alphabet( of 0s and 1s) and the number of zeros in the string is a 3 digit prime number.......is this language regular...??
can u pls help me out in this ......its a ques appeared in GATE entrance</description>
		<content:encoded><![CDATA[<p>a language such that a string is made of binary alphabet( of 0s and 1s) and the number of zeros in the string is a 3 digit prime number&#8230;&#8230;.is this language regular&#8230;??<br />
can u pls help me out in this &#8230;&#8230;its a ques appeared in GATE entrance</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Walking Randomly &#187; Finding prime numbers using voodoo regular expressions</title>
		<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-201449</link>
		<dc:creator>Walking Randomly &#187; Finding prime numbers using voodoo regular expressions</dc:creator>
		<pubDate>Thu, 27 Aug 2009 10:19:32 +0000</pubDate>
		<guid isPermaLink="false">http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-201449</guid>
		<description>[...] Update (27th August 2009): Someone pointed me to an alternative explanation here. [...]</description>
		<content:encoded><![CDATA[<p>[...] Update (27th August 2009): Someone pointed me to an alternative explanation here. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Using the regular expression backtracking engine for prime number magic &#124; Barklund.org</title>
		<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-199806</link>
		<dc:creator>Using the regular expression backtracking engine for prime number magic &#124; Barklund.org</dc:creator>
		<pubDate>Mon, 10 Aug 2009 15:33:50 +0000</pubDate>
		<guid isPermaLink="false">http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-199806</guid>
		<description>[...] just saw the most impressive, intelligent use of the regular expression backtracking engine and simply have to re-post it in order to give my own decryption of the infinitely simple [...]</description>
		<content:encoded><![CDATA[<p>[...] just saw the most impressive, intelligent use of the regular expression backtracking engine and simply have to re-post it in order to give my own decryption of the infinitely simple [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick Atambo</title>
		<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-197852</link>
		<dc:creator>Patrick Atambo</dc:creator>
		<pubDate>Thu, 16 Jul 2009 19:25:32 +0000</pubDate>
		<guid isPermaLink="false">http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-197852</guid>
		<description>WOW, pretty cool! I have to revisit regular expressions it seems. :)</description>
		<content:encoded><![CDATA[<p>WOW, pretty cool! I have to revisit regular expressions it seems. <img src='http://www.noulakaz.net/weblog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: avinash</title>
		<link>http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-197301</link>
		<dc:creator>avinash</dc:creator>
		<pubDate>Sun, 12 Jul 2009 18:48:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/#comment-197301</guid>
		<description>Thanks for pointing this out...</description>
		<content:encoded><![CDATA[<p>Thanks for pointing this out&#8230;</p>
]]></content:encoded>
	</item>
</channel>
</rss>
