<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/1.5.2" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments on: Sums, differences, and surprises</title>
	<link>http://bit-player.org/2006/sums-differences-and-surprises</link>
	<description>An amateur's outlook on computation and mathematics.</description>
	<pubDate>Fri, 29 Aug 2008 07:51:55 +0000</pubDate>
	<generator>http://wordpress.org/?v=1.5.2</generator>

	<item>
 		<title>Comment on Sums, differences, and surprises by: Barry Cipra</title>
		<link>http://bit-player.org/2006/sums-differences-and-surprises#comment-888</link>
		<pubDate>Sat, 26 Aug 2006 17:04:08 +0000</pubDate>
		<guid>http://bit-player.org/2006/sums-differences-and-surprises#comment-888</guid>
					<description>&quot; ...I had generated the series by looking at differences of distinct elements, but it turns out that sums of not-necessarily-distinct elements yield the same series. Curious.&quot;

You say curious, I say obvious.  If a-b=c-d, then a+d=b+c.  Either all four are distinct, or else two are equal, say a=d.

My own decline is apparent in the assertion that {1,2,...,m-1} is the difference set for {0,1,2,...,m}.  I meant {1,2,...,m}.

As one randomly &quot;grows&quot; a set S from among the numbers 0 to m, the number of duplicates, either sum or difference, with each new number goes from none to all -- that is, when you add the n+1st number, you (usually) get no duplicates when n is small (compared to m) and nothing but duplicates when n is large.  In general you get some fraction, k/n.  I wonder what the transition looks like.</description>
		<content:encoded><![CDATA[	<p>&#8221; &#8230;I had generated the series by looking at differences of distinct elements, but it turns out that sums of not-necessarily-distinct elements yield the same series. Curious.&#8221;</p>
	<p>You say curious, I say obvious.  If a-b=c-d, then a+d=b+c.  Either all four are distinct, or else two are equal, say a=d.</p>
	<p>My own decline is apparent in the assertion that {1,2,&#8230;,m-1} is the difference set for {0,1,2,&#8230;,m}.  I meant {1,2,&#8230;,m}.</p>
	<p>As one randomly &#8220;grows&#8221; a set S from among the numbers 0 to m, the number of duplicates, either sum or difference, with each new number goes from none to all &#8212; that is, when you add the n+1st number, you (usually) get no duplicates when n is small (compared to m) and nothing but duplicates when n is large.  In general you get some fraction, k/n.  I wonder what the transition looks like.
</p>
]]></content:encoded>
				</item>
</channel>
</rss>
