<?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: Another Look at Prime Numbers	</title>
	<atom:link href="https://betterexplained.com/articles/another-look-at-prime-numbers/feed/" rel="self" type="application/rss+xml" />
	<link>https://betterexplained.com/articles/another-look-at-prime-numbers/</link>
	<description>Math lessons that click</description>
	<lastBuildDate>Thu, 02 Jun 2022 01:18:30 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	
	<item>
		<title>
		By: juanmf		</title>
		<link>https://betterexplained.com/articles/another-look-at-prime-numbers/#comment-568231</link>

		<dc:creator><![CDATA[juanmf]]></dc:creator>
		<pubDate>Thu, 02 Jun 2022 01:18:30 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/another-look-at-prime-numbers/#comment-568231</guid>

					<description><![CDATA[&lt;p&gt;Take a look at this article I&#039;m writing on the dynamic behind prime numbers distribution:&lt;br&gt;&lt;a href=&quot;https://mirror.xyz/0x62514E8C74B1B188dFCD76D2171c96EF1845Ba02/PhwGsMoDsGGfbagtxAhjM5OyvIPnFfF6dhBYb4QICfQ&quot; title=&quot;https://mirror.xyz/0x62514E8C74B1B188dFCD76D2171c96EF1845Ba02/PhwGsMoDsGGfbagtxAhjM5OyvIPnFfF6dhBYb4QICfQ&quot; rel=&quot;nofollow ugc&quot;&gt;https://mirror.xyz/0x62514E...&lt;/a&gt;&lt;/p&gt;]]></description>
			<content:encoded><![CDATA[<p>Take a look at this article I&#8217;m writing on the dynamic behind prime numbers distribution:<br /><a href="https://mirror.xyz/0x62514E8C74B1B188dFCD76D2171c96EF1845Ba02/PhwGsMoDsGGfbagtxAhjM5OyvIPnFfF6dhBYb4QICfQ" title="https://mirror.xyz/0x62514E8C74B1B188dFCD76D2171c96EF1845Ba02/PhwGsMoDsGGfbagtxAhjM5OyvIPnFfF6dhBYb4QICfQ" rel="nofollow ugc"></a><a href="https://mirror.xyz/0x62514E" rel="nofollow ugc">https://mirror.xyz/0x62514E</a>&#8230;</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: George Lee		</title>
		<link>https://betterexplained.com/articles/another-look-at-prime-numbers/#comment-359367</link>

		<dc:creator><![CDATA[George Lee]]></dc:creator>
		<pubDate>Wed, 12 Dec 2018 14:43:00 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/another-look-at-prime-numbers/#comment-359367</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://betterexplained.com/articles/another-look-at-prime-numbers/#comment-332688&quot;&gt;Daniel Stanev&lt;/a&gt;.

27 and 57 are not prime.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://betterexplained.com/articles/another-look-at-prime-numbers/#comment-332688">Daniel Stanev</a>.</p>
<p>27 and 57 are not prime.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: William P. G. Shaw		</title>
		<link>https://betterexplained.com/articles/another-look-at-prime-numbers/#comment-336472</link>

		<dc:creator><![CDATA[William P. G. Shaw]]></dc:creator>
		<pubDate>Sun, 18 Feb 2018 16:38:28 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/another-look-at-prime-numbers/#comment-336472</guid>

					<description><![CDATA[Prime numbers and composite numbers can be studied using linear algebra. The fallacy is to pl;ace prime two and the infinite set of the other prime numbers into one class. Rather place [2] and [3, 5, 7, 11, ... ] into these two separate classes. Every prime [not two] or composite can be represented as a unique column vector except that the number of elements in the vector has to be at least [N + 1] and can be any finite number of elements more than [N + 1]. Here the prime or composite lies in an interval between 2^{N} and 2^{N + 1}, where N = 1, 2, ...  For example, 23 lies between 2^{4} and 2^{5}. 
23 = 2^{4} + 2^{3} + r[1].2^{2} + r[2].2^{1} + r[3].2^{0}  The remainders are seen to be r[1] = - 1,
r[2] = 1 and r[3] = 1. As a vector, 23 is: [16,  8, - 4,  2, 1]. The remainders are found by dividing an uneven integer sucessively by two to give an uneven quotient and the remainder that may be either + 1 or - 1. repeating this process for a succession of primes or composites gives column vectors to fill up a matrix of coefficients, resulting in a system of linear homogeneous equations. The non-zero exponents of prime two cancel in the linear equations leaving only the reminders: [1, 1, - 1,  1,  1], in the case of prime 23. The number of components in a vector representing an uneven number can be increased in view of the fact that: 2^{N} = 2^{N + 1} - 2^{N} and likewise: 2^{N + 1} = 2^{N + 2} - 2^{N + 1] etc. 
It just looks very much like linear algebra is the key to solving the mystery of the erratic prime sequence. The sequence of the primes has remained unsolved since at least since the time of Euclid of Alexandria. Not to be confused with Euclid of Megara.]]></description>
			<content:encoded><![CDATA[<p>Prime numbers and composite numbers can be studied using linear algebra. The fallacy is to pl;ace prime two and the infinite set of the other prime numbers into one class. Rather place [2] and [3, 5, 7, 11, &#8230; ] into these two separate classes. Every prime [not two] or composite can be represented as a unique column vector except that the number of elements in the vector has to be at least [N + 1] and can be any finite number of elements more than [N + 1]. Here the prime or composite lies in an interval between 2^{N} and 2^{N + 1}, where N = 1, 2, &#8230;  For example, 23 lies between 2^{4} and 2^{5}.<br />
23 = 2^{4} + 2^{3} + r[1].2^{2} + r[2].2^{1} + r[3].2^{0}  The remainders are seen to be r[1] = &#8211; 1,<br />
r[2] = 1 and r[3] = 1. As a vector, 23 is: [16,  8, &#8211; 4,  2, 1]. The remainders are found by dividing an uneven integer sucessively by two to give an uneven quotient and the remainder that may be either + 1 or &#8211; 1. repeating this process for a succession of primes or composites gives column vectors to fill up a matrix of coefficients, resulting in a system of linear homogeneous equations. The non-zero exponents of prime two cancel in the linear equations leaving only the reminders: [1, 1, &#8211; 1,  1,  1], in the case of prime 23. The number of components in a vector representing an uneven number can be increased in view of the fact that: 2^{N} = 2^{N + 1} &#8211; 2^{N} and likewise: 2^{N + 1} = 2^{N + 2} &#8211; 2^{N + 1] etc.<br />
It just looks very much like linear algebra is the key to solving the mystery of the erratic prime sequence. The sequence of the primes has remained unsolved since at least since the time of Euclid of Alexandria. Not to be confused with Euclid of Megara.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Kelly		</title>
		<link>https://betterexplained.com/articles/another-look-at-prime-numbers/#comment-334189</link>

		<dc:creator><![CDATA[Kelly]]></dc:creator>
		<pubDate>Wed, 04 Jan 2017 14:07:11 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/another-look-at-prime-numbers/#comment-334189</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://betterexplained.com/articles/another-look-at-prime-numbers/#comment-332757&quot;&gt;Boris Sklyar&lt;/a&gt;.

True but NOT lololololololololololol]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://betterexplained.com/articles/another-look-at-prime-numbers/#comment-332757">Boris Sklyar</a>.</p>
<p>True but NOT lololololololololololol</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
