<?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: Roots of integers</title>
	<atom:link href="http://www.johndcook.com/blog/2009/12/20/roots-of-integers/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/</link>
	<description>The blog of John D. Cook</description>
	<lastBuildDate>Sat, 11 Feb 2012 01:10:06 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Weiwei</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-123707</link>
		<dc:creator>Weiwei</dc:creator>
		<pubDate>Tue, 20 Dec 2011 16:26:40 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-123707</guid>
		<description>@caio Indeed! Thanks for the clarification :)</description>
		<content:encoded><![CDATA[<p>@caio Indeed! Thanks for the clarification <img src='http://www.johndcook.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: (Quadrat-)Wurzeln aus ganzen Zahlen &#171; Flos Mathe-Blog</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-123704</link>
		<dc:creator>(Quadrat-)Wurzeln aus ganzen Zahlen &#171; Flos Mathe-Blog</dc:creator>
		<pubDate>Tue, 20 Dec 2011 16:06:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-123704</guid>
		<description>[...] fast jeder noch aus der eigenen Schulzeit. In dem vor zwei Jahren veröffentlichten Artikel &#8220;Roots of integers&#8221; in John D. Cook&#8217;s Blog (&#8220;The Endeavour&#8220;) entdeckte ich heute einen viel [...]</description>
		<content:encoded><![CDATA[<p>[...] fast jeder noch aus der eigenen Schulzeit. In dem vor zwei Jahren veröffentlichten Artikel &#8220;Roots of integers&#8221; in John D. Cook&#8217;s Blog (&#8220;The Endeavour&#8220;) entdeckte ich heute einen viel [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Caio Braz</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-123507</link>
		<dc:creator>Caio Braz</dc:creator>
		<pubDate>Tue, 20 Dec 2011 01:27:53 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-123507</guid>
		<description>Weiwei, we&#039;ve got the two cases covered:
Part 1 is ok, if n is an integer, if its square root is an integer, its ok!

Part 2: if some integer has a rational (i.e. a number in form a/b, with a and b integers) square root, then, some fraction (a/b)^2 will be this integer.

The proof stands that it&#039;s impossible to a fraction yield this result, so if the square root is not an integer, it can&#039;t be a rational, so, it&#039;s irrational</description>
		<content:encoded><![CDATA[<p>Weiwei, we&#8217;ve got the two cases covered:<br />
Part 1 is ok, if n is an integer, if its square root is an integer, its ok!</p>
<p>Part 2: if some integer has a rational (i.e. a number in form a/b, with a and b integers) square root, then, some fraction (a/b)^2 will be this integer.</p>
<p>The proof stands that it&#8217;s impossible to a fraction yield this result, so if the square root is not an integer, it can&#8217;t be a rational, so, it&#8217;s irrational</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Weiwei</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-123490</link>
		<dc:creator>Weiwei</dc:creator>
		<pubDate>Tue, 20 Dec 2011 00:18:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-123490</guid>
		<description>The statement is that an integer is either (1) a perfect square or (2) its square root is &lt;b&gt;irrational&lt;/b&gt;. What about the 2nd part?</description>
		<content:encoded><![CDATA[<p>The statement is that an integer is either (1) a perfect square or (2) its square root is <b>irrational</b>. What about the 2nd part?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: sherifffruitfly</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-121759</link>
		<dc:creator>sherifffruitfly</dc:creator>
		<pubDate>Tue, 13 Dec 2011 16:37:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-121759</guid>
		<description>&quot;Denise, I agree that is seems odd that proofs in high school are limited to geometry.&quot;

The intellectual horsepower level of education majors doesn&#039;t permit anything more than that.</description>
		<content:encoded><![CDATA[<p>&#8220;Denise, I agree that is seems odd that proofs in high school are limited to geometry.&#8221;</p>
<p>The intellectual horsepower level of education majors doesn&#8217;t permit anything more than that.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-30245</link>
		<dc:creator>John</dc:creator>
		<pubDate>Tue, 05 Jan 2010 16:32:34 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-30245</guid>
		<description>Denise, I agree that is seems odd that proofs in high school are limited to geometry. (And from what I understand, proofs have largely been removed from geometry.) Number theory seems like a reasonable place to learn proofs.</description>
		<content:encoded><![CDATA[<p>Denise, I agree that is seems odd that proofs in high school are limited to geometry. (And from what I understand, proofs have largely been removed from geometry.) Number theory seems like a reasonable place to learn proofs.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Denise Gaskins</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-30239</link>
		<dc:creator>Denise Gaskins</dc:creator>
		<pubDate>Tue, 05 Jan 2010 14:06:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-30239</guid>
		<description>I remember being amazed when I first saw this proof, at how easy it was. I wondered then (and still do) why we never had it in school. We never did any proofs except in geometry and trig.</description>
		<content:encoded><![CDATA[<p>I remember being amazed when I first saw this proof, at how easy it was. I wondered then (and still do) why we never had it in school. We never did any proofs except in geometry and trig.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: I. J. Kennedy</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-29340</link>
		<dc:creator>I. J. Kennedy</dc:creator>
		<pubDate>Mon, 21 Dec 2009 21:43:07 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-29340</guid>
		<description>Perhaps you&#039;re right, but I&#039;m not sure. In any case we know &lt;i&gt;a&lt;/i&gt;^n and &lt;i&gt;b&lt;/i&gt;^n are relatively prime by the &lt;a href=&#039;http://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic&#039; rel=&quot;nofollow&quot;&gt;Fundamental Theorem of Arithmetic&lt;/a&gt;. If  &lt;i&gt;a&lt;/i&gt;  factors to certain primes, then multiplying  &lt;i&gt;a&lt;/i&gt;  times itself  isn&#039;t going to yield any new primes. So the factorizations of  &lt;i&gt;a&lt;/i&gt;^n  and  &lt;i&gt;b&lt;/i&gt;^n  have no primes in common, because  &lt;i&gt;a&lt;/i&gt;  and  &lt;i&gt;b&lt;/i&gt;  don&#039;t.</description>
		<content:encoded><![CDATA[<p>Perhaps you&#8217;re right, but I&#8217;m not sure. In any case we know <i>a</i>^n and <i>b</i>^n are relatively prime by the <a href='http://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic' rel="nofollow">Fundamental Theorem of Arithmetic</a>. If  <i>a</i>  factors to certain primes, then multiplying  <i>a</i>  times itself  isn&#8217;t going to yield any new primes. So the factorizations of  <i>a</i>^n  and  <i>b</i>^n  have no primes in common, because  <i>a</i>  and  <i>b</i>  don&#8217;t.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Armstrong</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-29337</link>
		<dc:creator>John Armstrong</dc:creator>
		<pubDate>Mon, 21 Dec 2009 21:09:56 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-29337</guid>
		<description>How do you know that an and bn are relatively prime? The work amounts to the messy parts in the post.  This version is only simpler because it hides the hard bits in a lemma.</description>
		<content:encoded><![CDATA[<p>How do you know that an and bn are relatively prime? The work amounts to the messy parts in the post.  This version is only simpler because it hides the hard bits in a lemma.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-29332</link>
		<dc:creator>John</dc:creator>
		<pubDate>Mon, 21 Dec 2009 17:02:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-29332</guid>
		<description>I think your proof is easier to follow than mine.</description>
		<content:encoded><![CDATA[<p>I think your proof is easier to follow than mine.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: I. J. Kennedy</title>
		<link>http://www.johndcook.com/blog/2009/12/20/roots-of-integers/comment-page-1/#comment-29330</link>
		<dc:creator>I. J. Kennedy</dc:creator>
		<pubDate>Mon, 21 Dec 2009 16:57:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=3944#comment-29330</guid>
		<description>Another way to get the same result is to assume a/b is fraction in lowest terms and is not an integer (i.e. b ≠ 1), and consider powers (a/b)&lt;sup&gt;n&lt;/sup&gt;. Clearly a&lt;sup&gt;n&lt;/sup&gt; and b&lt;sup&gt;n&lt;/sup&gt; are relatively prime, and the denominator b&lt;sup&gt;n&lt;/sup&gt; ≠ 1, so a&lt;sup&gt;n&lt;/sup&gt;/b&lt;sup&gt;n&lt;/sup&gt; is not an integer. In other words, no (non-integer) fraction, when raised to a power, can produce an integer.</description>
		<content:encoded><![CDATA[<p>Another way to get the same result is to assume a/b is fraction in lowest terms and is not an integer (i.e. b ≠ 1), and consider powers (a/b)<sup>n</sup>. Clearly a<sup>n</sup> and b<sup>n</sup> are relatively prime, and the denominator b<sup>n</sup> ≠ 1, so a<sup>n</sup>/b<sup>n</sup> is not an integer. In other words, no (non-integer) fraction, when raised to a power, can produce an integer.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.374 seconds -->

