<?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: The state of the spamosphere</title>
	<atom:link href="http://bit-player.org/2010/the-state-of-the-spamosphere/feed" rel="self" type="application/rss+xml" />
	<link>http://bit-player.org/2010/the-state-of-the-spamosphere</link>
	<description>An amateur's outlook on computation and mathematics.</description>
	<pubDate>Thu, 17 May 2012 10:19:14 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.3</generator>
		<item>
		<title>By: Bernhard W. Marx</title>
		<link>http://bit-player.org/2010/the-state-of-the-spamosphere#comment-3264</link>
		<dc:creator>Bernhard W. Marx</dc:creator>
		<pubDate>Wed, 03 Nov 2010 11:25:33 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=742#comment-3264</guid>
		<description>There is no ONE right answer to such questions, although there may be  one, which seems most plausible to most people.
Any sequence of  n numbers can be thought  to be the values of polynome of degree below n with the independant variable x running from 0 (zero) to n-1. As such a next number can be developed as
p(n)  -- by the way without any multiplication, just additions and subtractions, unless one were interested in a closed form of the polynome.
By the same token one could choose ANY next number and have these n+1 numbers be generated by a polynome q of degree not above n -- and upon being challenged for an algorithm by which this next number was got at, exhibit this polynome q.
What is the next number in the sequence 0,1,0,1, ... ?
Of course it must be 8.
Or whatever you fancy.</description>
		<content:encoded><![CDATA[<p>There is no ONE right answer to such questions, although there may be  one, which seems most plausible to most people.<br />
Any sequence of  n numbers can be thought  to be the values of polynome of degree below n with the independant variable x running from 0 (zero) to n-1. As such a next number can be developed as<br />
p(n)  &#8212; by the way without any multiplication, just additions and subtractions, unless one were interested in a closed form of the polynome.<br />
By the same token one could choose ANY next number and have these n+1 numbers be generated by a polynome q of degree not above n &#8212; and upon being challenged for an algorithm by which this next number was got at, exhibit this polynome q.<br />
What is the next number in the sequence 0,1,0,1, &#8230; ?<br />
Of course it must be 8.<br />
Or whatever you fancy.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: brian</title>
		<link>http://bit-player.org/2010/the-state-of-the-spamosphere#comment-3228</link>
		<dc:creator>brian</dc:creator>
		<pubDate>Mon, 20 Sep 2010 13:43:05 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=742#comment-3228</guid>
		<description>Fred Merk writes: 
&lt;blockquote&gt;The typical vanity of mathematicians - never apologise, never explain.&lt;/blockquote&gt;

Obviously the correct response to this comment is enigmatic silence. But since I'm not actually a mathematician, I'm not required to observe all the usual vanities.

By way of explanation, if not apology, I would note that when someone has taken the initiative to go to work on a problem and has run into difficulties, simply giving away the answer is not often the most helpful response. Isn't the process of finding the answer more important and more enjoyable than the answer itself? (In this case I happen to know through private back-channel communication that Amy Hayes did indeed solve the problem on her own shortly after posting her comment.)

As for the alternative solution offered by Mr and Mrs. OEIS, those who simply want to know the answer can run off to &lt;a href="http://www.research.att.com/~njas/sequences/A100016" rel="nofollow"&gt;consult the OEIS&lt;/a&gt;. For those who would rather puzzle it out, I'll offer one more term of the sequence as a hint:

1, 2, 6, 42, 1806, 3270666, 10697259354222,...</description>
		<content:encoded><![CDATA[<p>Fred Merk writes: </p>
<blockquote><p>The typical vanity of mathematicians - never apologise, never explain.</p></blockquote>
<p>Obviously the correct response to this comment is enigmatic silence. But since I&#8217;m not actually a mathematician, I&#8217;m not required to observe all the usual vanities.</p>
<p>By way of explanation, if not apology, I would note that when someone has taken the initiative to go to work on a problem and has run into difficulties, simply giving away the answer is not often the most helpful response. Isn&#8217;t the process of finding the answer more important and more enjoyable than the answer itself? (In this case I happen to know through private back-channel communication that Amy Hayes did indeed solve the problem on her own shortly after posting her comment.)</p>
<p>As for the alternative solution offered by Mr and Mrs. OEIS, those who simply want to know the answer can run off to <a href="http://www.research.att.com/~njas/sequences/A100016" rel="nofollow">consult the OEIS</a>. For those who would rather puzzle it out, I&#8217;ll offer one more term of the sequence as a hint:</p>
<p>1, 2, 6, 42, 1806, 3270666, 10697259354222,&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Fred Merk</title>
		<link>http://bit-player.org/2010/the-state-of-the-spamosphere#comment-3227</link>
		<dc:creator>Fred Merk</dc:creator>
		<pubDate>Mon, 20 Sep 2010 04:36:38 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=742#comment-3227</guid>
		<description>The typical vanity of mathematicians - never apologise, never explain. I'm going to help out the lady by expanding on Dave of Tucson's answer: 1x2, 2x3, 6x7, 42x43, 1806x1807 = 3263442. Now if only Mr and Mrs OEIS will be so good as to explain theirs. Of course a pattern can be completed in more than one way - it's all a question of taste. Discrimination precedes measurement. And communication is a wonderful thing.</description>
		<content:encoded><![CDATA[<p>The typical vanity of mathematicians - never apologise, never explain. I&#8217;m going to help out the lady by expanding on Dave of Tucson&#8217;s answer: 1&#215;2, 2&#215;3, 6&#215;7, 42&#215;43, 1806&#215;1807 = 3263442. Now if only Mr and Mrs OEIS will be so good as to explain theirs. Of course a pattern can be completed in more than one way - it&#8217;s all a question of taste. Discrimination precedes measurement. And communication is a wonderful thing.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Amy Hayes</title>
		<link>http://bit-player.org/2010/the-state-of-the-spamosphere#comment-3223</link>
		<dc:creator>Amy Hayes</dc:creator>
		<pubDate>Tue, 14 Sep 2010 16:43:07 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=742#comment-3223</guid>
		<description>Okay, the math gene clearly skipped a generation. I have no idea what the answer to this problem is despite spending 15 minutes trying to figure it out.   My only comfort is that two of the commenters came up with different responses.</description>
		<content:encoded><![CDATA[<p>Okay, the math gene clearly skipped a generation. I have no idea what the answer to this problem is despite spending 15 minutes trying to figure it out.   My only comfort is that two of the commenters came up with different responses.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jason</title>
		<link>http://bit-player.org/2010/the-state-of-the-spamosphere#comment-3133</link>
		<dc:creator>Jason</dc:creator>
		<pubDate>Mon, 09 Aug 2010 21:00:28 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=742#comment-3133</guid>
		<description>Dave: same experience here, usually I have to try several things to get an answer but I spotted the pattern almost immediately.  

Pattern recognition is so mysterious to me, I think I've found what I'm going to read about for the  rest of the afternoon.</description>
		<content:encoded><![CDATA[<p>Dave: same experience here, usually I have to try several things to get an answer but I spotted the pattern almost immediately.  </p>
<p>Pattern recognition is so mysterious to me, I think I&#8217;ve found what I&#8217;m going to read about for the  rest of the afternoon.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: unekdoud</title>
		<link>http://bit-player.org/2010/the-state-of-the-spamosphere#comment-3131</link>
		<dc:creator>unekdoud</dc:creator>
		<pubDate>Mon, 09 Aug 2010 02:01:38 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=742#comment-3131</guid>
		<description>It would take us an average of 25 seconds longer to post comments :)
Time to try this on some Accounting Experts and Number Numbs, whoever those are.</description>
		<content:encoded><![CDATA[<p>It would take us an average of 25 seconds longer to post comments :)<br />
Time to try this on some Accounting Experts and Number Numbs, whoever those are.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mr and Mrs. OEIS</title>
		<link>http://bit-player.org/2010/the-state-of-the-spamosphere#comment-3130</link>
		<dc:creator>Mr and Mrs. OEIS</dc:creator>
		<pubDate>Mon, 09 Aug 2010 01:58:55 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=742#comment-3130</guid>
		<description>3270666

The OEIS thinks different.</description>
		<content:encoded><![CDATA[<p>3270666</p>
<p>The OEIS thinks different.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dave in Tucson</title>
		<link>http://bit-player.org/2010/the-state-of-the-spamosphere#comment-3129</link>
		<dc:creator>Dave in Tucson</dc:creator>
		<pubDate>Mon, 09 Aug 2010 01:29:43 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=742#comment-3129</guid>
		<description>3263442

Normally, I get brain freeze on questions like this unless they're pretty easy.  I got this one in just a few seconds, so...?</description>
		<content:encoded><![CDATA[<p>3263442</p>
<p>Normally, I get brain freeze on questions like this unless they&#8217;re pretty easy.  I got this one in just a few seconds, so&#8230;?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

