<?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: Computer Algorithms: Determine if a Number is Prime</title>
	<atom:link href="/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/feed/" rel="self" type="application/rss+xml" />
	<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/</link>
	<description>on web development</description>
	<lastBuildDate>Fri, 26 Oct 2018 21:40:18 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.0.3</generator>
	<item>
		<title>By: zubin</title>
		<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/comment-page-1/#comment-489184</link>
		<dc:creator><![CDATA[zubin]]></dc:creator>
		<pubDate>Wed, 09 May 2018 12:07:43 +0000</pubDate>
		<guid isPermaLink="false">/?p=3100#comment-489184</guid>
		<description><![CDATA[second case wont work.
Take the example of 19.
19 is prime. 19/2 = 9 if you check for prime it will come as not prime.]]></description>
		<content:encoded><![CDATA[<p>second case wont work.<br />
Take the example of 19.<br />
19 is prime. 19/2 = 9 if you check for prime it will come as not prime.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/comment-page-1/#comment-438714</link>
		<dc:creator><![CDATA[Anonymous]]></dc:creator>
		<pubDate>Tue, 17 Jan 2017 16:56:47 +0000</pubDate>
		<guid isPermaLink="false">/?p=3100#comment-438714</guid>
		<description><![CDATA[It isnt]]></description>
		<content:encoded><![CDATA[<p>It isnt</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Upendra</title>
		<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/comment-page-1/#comment-434982</link>
		<dc:creator><![CDATA[Upendra]]></dc:creator>
		<pubDate>Sun, 18 Dec 2016 07:50:12 +0000</pubDate>
		<guid isPermaLink="false">/?p=3100#comment-434982</guid>
		<description><![CDATA[Needed simple pseudo code with explanation]]></description>
		<content:encoded><![CDATA[<p>Needed simple pseudo code with explanation</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Cimino</title>
		<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/comment-page-1/#comment-413000</link>
		<dc:creator><![CDATA[Michael Cimino]]></dc:creator>
		<pubDate>Sat, 09 Jul 2016 12:39:36 +0000</pubDate>
		<guid isPermaLink="false">/?p=3100#comment-413000</guid>
		<description><![CDATA[I would lie to know if algorithm would be able to match numbers to a history numbers database, for example!!
23
34.                       Here
10.                       Another
and so on.          Column 
For another.       Of fresh
1000.                    Data entry to scroll
Entries.                  Up &#038; down
                                To match old
                                  Data]]></description>
		<content:encoded><![CDATA[<p>I would lie to know if algorithm would be able to match numbers to a history numbers database, for example!!<br />
23<br />
34.                       Here<br />
10.                       Another<br />
and so on.          Column<br />
For another.       Of fresh<br />
1000.                    Data entry to scroll<br />
Entries.                  Up &amp; down<br />
                                To match old<br />
                                  Data</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: tesfaye</title>
		<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/comment-page-1/#comment-411158</link>
		<dc:creator><![CDATA[tesfaye]]></dc:creator>
		<pubDate>Thu, 16 Jun 2016 05:51:53 +0000</pubDate>
		<guid isPermaLink="false">/?p=3100#comment-411158</guid>
		<description><![CDATA[it is partialy good]]></description>
		<content:encoded><![CDATA[<p>it is partialy good</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: TJ Callahan</title>
		<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/comment-page-1/#comment-409695</link>
		<dc:creator><![CDATA[TJ Callahan]]></dc:creator>
		<pubDate>Thu, 02 Jun 2016 18:40:53 +0000</pubDate>
		<guid isPermaLink="false">/?p=3100#comment-409695</guid>
		<description><![CDATA[I would like to see an algorithm in vb.net or c++ that checks a large number, e.g. 100 digits long, for primality. I have written some code to do so but I have to convert the input to an array of decimal data types not greater than 9 digits (because the compiler will convert anything larger than like 21 digits to scientific notation which essentially makes the number even). Then I must use several conversions from string to decimal and back. It is not very efficient. Thanks for you advice.]]></description>
		<content:encoded><![CDATA[<p>I would like to see an algorithm in vb.net or c++ that checks a large number, e.g. 100 digits long, for primality. I have written some code to do so but I have to convert the input to an array of decimal data types not greater than 9 digits (because the compiler will convert anything larger than like 21 digits to scientific notation which essentially makes the number even). Then I must use several conversions from string to decimal and back. It is not very efficient. Thanks for you advice.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Engr ASHIQ ALI</title>
		<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/comment-page-1/#comment-405109</link>
		<dc:creator><![CDATA[Engr ASHIQ ALI]]></dc:creator>
		<pubDate>Tue, 19 Apr 2016 12:40:05 +0000</pubDate>
		<guid isPermaLink="false">/?p=3100#comment-405109</guid>
		<description><![CDATA[plz any one can help me to make algorithm for Word  A &#038; H using slop concept ....]]></description>
		<content:encoded><![CDATA[<p>plz any one can help me to make algorithm for Word  A &amp; H using slop concept &#8230;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jfghjknvcf</title>
		<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/comment-page-1/#comment-403028</link>
		<dc:creator><![CDATA[jfghjknvcf]]></dc:creator>
		<pubDate>Fri, 01 Apr 2016 19:09:06 +0000</pubDate>
		<guid isPermaLink="false">/?p=3100#comment-403028</guid>
		<description><![CDATA[what do you think if we use this approch we calculate (n-1)!/n
if we get an integer  number than n isnt a prime number

if we get a decimal mumber than this is a prime numbet]]></description>
		<content:encoded><![CDATA[<p>what do you think if we use this approch we calculate (n-1)!/n<br />
if we get an integer  number than n isnt a prime number</p>
<p>if we get a decimal mumber than this is a prime numbet</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: aj</title>
		<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/comment-page-1/#comment-388760</link>
		<dc:creator><![CDATA[aj]]></dc:creator>
		<pubDate>Sat, 12 Dec 2015 14:49:56 +0000</pubDate>
		<guid isPermaLink="false">/?p=3100#comment-388760</guid>
		<description><![CDATA[i wanted a basic easy explanation was very complicated]]></description>
		<content:encoded><![CDATA[<p>i wanted a basic easy explanation was very complicated</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Faizoor rahman</title>
		<link>/2012/05/08/computer-algorithms-determine-if-a-number-is-prime/comment-page-1/#comment-376513</link>
		<dc:creator><![CDATA[Faizoor rahman]]></dc:creator>
		<pubDate>Wed, 21 Oct 2015 08:22:47 +0000</pubDate>
		<guid isPermaLink="false">/?p=3100#comment-376513</guid>
		<description><![CDATA[I couldn&#039;t understand anything.]]></description>
		<content:encoded><![CDATA[<p>I couldn&#8217;t understand anything.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
