<?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: Elementary Version of Riemann Hypothesis</title>
	<atom:link href="http://www.arsmathematica.net/archives/2005/07/03/elementary-version-of-riemann-hypothesis/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.arsmathematica.net/archives/2005/07/03/elementary-version-of-riemann-hypothesis/</link>
	<description>Dedicated to the mathematical arts.</description>
	<pubDate>Fri, 05 Dec 2008 13:03:54 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>By: Ars Mathematica &#187; Blog Archive &#187; Why the Riemann Hypothesis?</title>
		<link>http://www.arsmathematica.net/archives/2005/07/03/elementary-version-of-riemann-hypothesis/#comment-58293</link>
		<dc:creator>Ars Mathematica &#187; Blog Archive &#187; Why the Riemann Hypothesis?</dc:creator>
		<pubDate>Sun, 20 Jan 2008 18:36:25 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/?p=78#comment-58293</guid>
		<description>[...] back when, I had a post about explaining the Riemann hypothesis in elementary terms. I thought I&#8217;d go into some more [...]</description>
		<content:encoded><![CDATA[<p>[...] back when, I had a post about explaining the Riemann hypothesis in elementary terms. I thought I&#8217;d go into some more [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Walt</title>
		<link>http://www.arsmathematica.net/archives/2005/07/03/elementary-version-of-riemann-hypothesis/#comment-62</link>
		<dc:creator>Walt</dc:creator>
		<pubDate>Tue, 05 Jul 2005 03:17:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/?p=78#comment-62</guid>
		<description>I imagine the bound is pretty sharp.  The Riemann hypothesis is supposed to be a best possible kind of result, and I'd think that applies here.  Most numbers won't be close to the bound (for example, for primes the left-hand side is n+1), but for a strictly-increasing right-hand side, it's probably the best you can do.</description>
		<content:encoded><![CDATA[<p>I imagine the bound is pretty sharp.  The Riemann hypothesis is supposed to be a best possible kind of result, and I&#8217;d think that applies here.  Most numbers won&#8217;t be close to the bound (for example, for primes the left-hand side is n+1), but for a strictly-increasing right-hand side, it&#8217;s probably the best you can do.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: michael</title>
		<link>http://www.arsmathematica.net/archives/2005/07/03/elementary-version-of-riemann-hypothesis/#comment-61</link>
		<dc:creator>michael</dc:creator>
		<pubDate>Mon, 04 Jul 2005 20:22:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/?p=78#comment-61</guid>
		<description>I am not suprised I have never heard of it, but I do find myself asking the question (yes, I realize I could read the paper, but I figure you aready have :) ) How sharp is that?</description>
		<content:encoded><![CDATA[<p>I am not suprised I have never heard of it, but I do find myself asking the question (yes, I realize I could read the paper, but I figure you aready have <img src='http://www.arsmathematica.net/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> ) How sharp is that?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
