<?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: Print Prime Numbers from 1 to N &#124; Sieve of Eratosthenes	</title>
	<atom:link href="https://webrewrite.com/program-to-generate-prime-numbers-between-1-to-n/feed/" rel="self" type="application/rss+xml" />
	<link>https://webrewrite.com/program-to-generate-prime-numbers-between-1-to-n/</link>
	<description>Technology Blog Where You Find Programming Tips and Tricks</description>
	<lastBuildDate>Thu, 10 Jun 2021 02:51:40 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>
	<item>
		<title>
		By: saicharan cherry		</title>
		<link>https://webrewrite.com/program-to-generate-prime-numbers-between-1-to-n/#comment-938</link>

		<dc:creator><![CDATA[saicharan cherry]]></dc:creator>
		<pubDate>Sun, 16 Jul 2017 16:35:00 +0000</pubDate>
		<guid isPermaLink="false">http://webrewrite.com/?p=1754#comment-938</guid>

					<description><![CDATA[this been very useful to me.]]></description>
			<content:encoded><![CDATA[<p>this been very useful to me.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Raj Kumar Singh		</title>
		<link>https://webrewrite.com/program-to-generate-prime-numbers-between-1-to-n/#comment-793</link>

		<dc:creator><![CDATA[Raj Kumar Singh]]></dc:creator>
		<pubDate>Tue, 01 Nov 2016 23:34:00 +0000</pubDate>
		<guid isPermaLink="false">http://webrewrite.com/?p=1754#comment-793</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://webrewrite.com/program-to-generate-prime-numbers-between-1-to-n/#comment-792&quot;&gt;Peter Tate&lt;/a&gt;.

Thanks Peter,
I have corrected the mistake.]]></description>
			<content:encoded><![CDATA[<p>Thanks Peter,<br />
I have corrected the mistake.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Peter Tate		</title>
		<link>https://webrewrite.com/program-to-generate-prime-numbers-between-1-to-n/#comment-792</link>

		<dc:creator><![CDATA[Peter Tate]]></dc:creator>
		<pubDate>Tue, 01 Nov 2016 18:39:00 +0000</pubDate>
		<guid isPermaLink="false">http://webrewrite.com/?p=1754#comment-792</guid>

					<description><![CDATA[This has been very helpful in engaging a student I have in the use of algorithms,  Thanks!  May I correct one problem in your implementation?  Your while statement checks for &#060; square root but needs an equality check too - run your program for 9 and the value 9 appears as a prime.]]></description>
			<content:encoded><![CDATA[<p>This has been very helpful in engaging a student I have in the use of algorithms,  Thanks!  May I correct one problem in your implementation?  Your while statement checks for &lt; square root but needs an equality check too &#8211; run your program for 9 and the value 9 appears as a prime.</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
