<?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/"
	xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd"
	xmlns:media="http://search.yahoo.com/mrss/"
	>
<channel>
	<title>Comments on: ET. Your Holiday Shopping Guide</title>
	<atom:link href="http://mathfactor.uark.edu/2008/12/et-your-holiday-shopping-guide/feed/" rel="self" type="application/rss+xml" />
	<link>http://mathfactor.uark.edu/2008/12/et-your-holiday-shopping-guide/</link>
	<description>The Math Factor Podcast Site</description>
	<lastBuildDate>Sat, 07 Nov 2009 01:28:00 -0600</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.5</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Alan</title>
		<link>http://mathfactor.uark.edu/2008/12/et-your-holiday-shopping-guide/comment-page-1/#comment-410</link>
		<dc:creator>Alan</dc:creator>
		<pubDate>Thu, 04 Dec 2008 20:39:26 +0000</pubDate>
		<guid isPermaLink="false">http://mathfactor.uark.edu/?p=280#comment-410</guid>
		<description>Referring to today&#039;s puzzle, where n times the average of a set is added iteratively to the set: 
n = 1 : 1 1 1 1 1 1
n = 2 : 1 2 3 4 5 6 
n = 3 : 1 3 6 10 15 21
etc

&lt;spoiler&gt;I&#039;ve been fascinated with Pascal&#039;s triangle since childhood. Each sequence for n can be derived from the previous: the delta for the n+1&#039;th sequence is the nth sequence. You can see each as diagonals in the Triangle. Here&#039;s an helpful image:
 &lt;a href=&quot;http://en.wikipedia.org/wiki/Image:Pascal%27s_Triangle_rows_0-16.svg&quot; rel=&quot;nofollow&quot;&gt;http://en.wikipedia.org/wiki/Image:Pascal%27s_Triangle_rows_0-16.svg&lt;/a&gt;
&lt;/spoiler&gt;
-Alan
</description>
		<content:encoded><![CDATA[<p>Referring to today&#8217;s puzzle, where n times the average of a set is added iteratively to the set: <br />
n = 1 : 1 1 1 1 1 1<br />
n = 2 : 1 2 3 4 5 6 <br />
n = 3 : 1 3 6 10 15 21<br />
etc</p>
<p><a href="javascript:void(null);" onclick="s_toggleDisplay(document.getElementById('SID290559341'), this, 'Show Spoiler &#9660;', 'Hide Spoiler &#9650;');">Show Spoiler &#9660;</a></p>
<div id='SID290559341' style='display:none;'>
I&#8217;ve been fascinated with Pascal&#8217;s triangle since childhood. Each sequence for n can be derived from the previous: the delta for the n+1&#8242;th sequence is the nth sequence. You can see each as diagonals in the Triangle. Here&#8217;s an helpful image:<br />
 <a href="http://en.wikipedia.org/wiki/Image:Pascal%27s_Triangle_rows_0-16.svg" rel="nofollow">http://en.wikipedia.org/wiki/Image:Pascal%27s_Triangle_rows_0-16.svg</a></p>
</div>
<p>-Alan</p>
]]></content:encoded>
	</item>
</channel>
</rss>
