<?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"
	>
<channel>
	<title>Comments on: Groups of Order Sixteen</title>
	<atom:link href="http://www.arsmathematica.net/archives/2008/04/08/652/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.arsmathematica.net/archives/2008/04/08/652/</link>
	<description>Dedicated to the mathematical arts.</description>
	<pubDate>Tue, 02 Dec 2008 01:54:45 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>By: Jacob Freeze</title>
		<link>http://www.arsmathematica.net/archives/2008/04/08/652/#comment-59665</link>
		<dc:creator>Jacob Freeze</dc:creator>
		<pubDate>Wed, 16 Apr 2008 22:15:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/archives/2008/04/08/652/#comment-59665</guid>
		<description>A few links into the references on this post turned up an unfamiliar  way of appreciating the rarity of non-solvable groups: 

If you call a number "solvable" if every group of that order is solvable, then... 

&lt;a href="http://www.research.att.com/~njas/sequences/A056866" rel="nofollow"&gt;A positive integer n is a non-solvable number if and only if it is a multiple of any of the following numbers: a) 2^p(2^2p-1), p any prime. b) 3^p(3^2p-1)/2, p odd prime. c) p(p^2-1)/2, p prime greater than 3 such that p^2+1 = 0 (mod 5). d) 2^4*3^3*13. e) 2^2p(2^2p+1)(2^p-1), p odd prime. &lt;/a&gt;</description>
		<content:encoded><![CDATA[<p>A few links into the references on this post turned up an unfamiliar  way of appreciating the rarity of non-solvable groups: </p>
<p>If you call a number &#8220;solvable&#8221; if every group of that order is solvable, then&#8230; </p>
<p><a href="http://www.research.att.com/~njas/sequences/A056866" rel="nofollow">A positive integer n is a non-solvable number if and only if it is a multiple of any of the following numbers: a) 2^p(2^2p-1), p any prime. b) 3^p(3^2p-1)/2, p odd prime. c) p(p^2-1)/2, p prime greater than 3 such that p^2+1 = 0 (mod 5). d) 2^4*3^3*13. e) 2^2p(2^2p+1)(2^p-1), p odd prime. </a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jan</title>
		<link>http://www.arsmathematica.net/archives/2008/04/08/652/#comment-59657</link>
		<dc:creator>Jan</dc:creator>
		<pubDate>Tue, 15 Apr 2008 21:55:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/archives/2008/04/08/652/#comment-59657</guid>
		<description>Just curious, but who is the author of this great blog? You should make yourself known.</description>
		<content:encoded><![CDATA[<p>Just curious, but who is the author of this great blog? You should make yourself known.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jimcp</title>
		<link>http://www.arsmathematica.net/archives/2008/04/08/652/#comment-59650</link>
		<dc:creator>jimcp</dc:creator>
		<pubDate>Sat, 12 Apr 2008 10:36:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/archives/2008/04/08/652/#comment-59650</guid>
		<description>Another thank you for pointing to this article.</description>
		<content:encoded><![CDATA[<p>Another thank you for pointing to this article.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Cook</title>
		<link>http://www.arsmathematica.net/archives/2008/04/08/652/#comment-59631</link>
		<dc:creator>John Cook</dc:creator>
		<pubDate>Wed, 09 Apr 2008 10:18:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/archives/2008/04/08/652/#comment-59631</guid>
		<description>Thanks for pointing out the article. Simplifying previous results is not often rewarded professionally, but is greatly appreciated.</description>
		<content:encoded><![CDATA[<p>Thanks for pointing out the article. Simplifying previous results is not often rewarded professionally, but is greatly appreciated.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
