<?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: Calculating whether A is a quadratic residue mod N, N composite?</title>
	<atom:link href="http://www.andersoncompositesquadron.org/composite-properties/calculating-whether-a-is-a-quadratic-residue-mod-n-n-composite/feed" rel="self" type="application/rss+xml" />
	<link>http://www.andersoncompositesquadron.org/composite-properties/calculating-whether-a-is-a-quadratic-residue-mod-n-n-composite</link>
	<description></description>
	<lastBuildDate>Sun, 11 Jul 2010 12:55:59 -0400</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: cheeser1234567890</title>
		<link>http://www.andersoncompositesquadron.org/composite-properties/calculating-whether-a-is-a-quadratic-residue-mod-n-n-composite/comment-page-1#comment-213</link>
		<dc:creator>cheeser1234567890</dc:creator>
		<pubDate>Tue, 29 Sep 2009 09:14:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.andersoncompositesquadron.org/composite-properties/calculating-whether-a-is-a-quadratic-residue-mod-n-n-composite#comment-213</guid>
		<description>I think you&#039;re confused:

http://en.wikipedia.org/wiki/Legendre_symbol
http://en.wikipedia.org/wiki/Euler%27s_criterion
http://en.wikipedia.org/wiki/Jacobi_symbol

The Jacobi symbol is what allows the Legendre symbol to be used in a way that makes sense for composite numbers. It&#039;s the way to do it. When I say the way, I really mean the way, not just a way. As far as I&#039;ve ever seen, there aren&#039;t better ways to do it, unless the Jacobi symbol itself simplifies into something more sensible.

What you&#039;re hoping is that Euler&#039;s criterion holds for a composite modulus. This is not generally true, and when it is true, I believe what you&#039;re looking for is Euler-Jacobi pseudoprimes. See:
http://en.wikipedia.org/wiki/Euler-Jacobi_pseudoprime&lt;br&gt;&lt;b&gt;References : &lt;/b&gt;&lt;br&gt;</description>
		<content:encoded><![CDATA[<p>I think you&#8217;re confused:</p>
<p><a href="http://en.wikipedia.org/wiki/Legendre_symbol" rel="nofollow">http://en.wikipedia.org/wiki/Legendre_symbol</a><br />
<a href="http://en.wikipedia.org/wiki/Euler%27s_criterion" rel="nofollow">http://en.wikipedia.org/wiki/Euler%27s_criterion</a><br />
<a href="http://en.wikipedia.org/wiki/Jacobi_symbol" rel="nofollow">http://en.wikipedia.org/wiki/Jacobi_symbol</a></p>
<p>The Jacobi symbol is what allows the Legendre symbol to be used in a way that makes sense for composite numbers. It&#8217;s the way to do it. When I say the way, I really mean the way, not just a way. As far as I&#8217;ve ever seen, there aren&#8217;t better ways to do it, unless the Jacobi symbol itself simplifies into something more sensible.</p>
<p>What you&#8217;re hoping is that Euler&#8217;s criterion holds for a composite modulus. This is not generally true, and when it is true, I believe what you&#8217;re looking for is Euler-Jacobi pseudoprimes. See:<br />
<a href="http://en.wikipedia.org/wiki/Euler-Jacobi_pseudoprime" rel="nofollow">http://en.wikipedia.org/wiki/Euler-Jacobi_pseudoprime</a><br /><b>References : </b></p>
]]></content:encoded>
	</item>
</channel>
</rss>
