<?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:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for The Math Less Traveled</title>
	<atom:link href="http://mathlesstraveled.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://mathlesstraveled.com</link>
	<description>Explorations in mathematical beauty</description>
	<lastBuildDate>Sat, 18 Feb 2012 16:13:24 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>Comment on Combinatorial proofs by Antony Goddard (@d4maths)</title>
		<link>http://mathlesstraveled.com/2012/02/17/combinatorial-proofs/#comment-9201</link>
		<dc:creator><![CDATA[Antony Goddard (@d4maths)]]></dc:creator>
		<pubDate>Sat, 18 Feb 2012 16:13:24 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1525#comment-9201</guid>
		<description><![CDATA[If sequence space  X is the set of sequences A = a[0],a[1],a[2]....

define the difference operator D A = {a[i+1]-a[i]}

The set of sequences where a[i] = some polynomial in i = P(i) is a vector space in X.
The difference operator D is linear: for scalars k and l, and polynomials p and q
D (kp+lq) = kDp+llDq 
The  the polynomials p(k,n) = n, n(n+1)/2, n(n+1)(n+2)/3, ... n(n+1)(n+2)..(n+k-1)/k!
all satisfy the relation D p(k,n) = p(k-1,n) ... easily proved by induction.
furthermore D is nilpotent on any particular polynomial. i.e. there exists k, D^k( p )= 0
we know D^k p(k,n) = 1
 D^k (q) = 0 for polynomials of lower degree.

now p(k,n) = n^k/k! + lower order terms
D^k p(k,n) = 1 = (1/k!) * D^k (n^k)
D^k n^k = k!]]></description>
		<content:encoded><![CDATA[<p>If sequence space  X is the set of sequences A = a[0],a[1],a[2]&#8230;.</p>
<p>define the difference operator D A = {a[i+1]-a[i]}</p>
<p>The set of sequences where a[i] = some polynomial in i = P(i) is a vector space in X.<br />
The difference operator D is linear: for scalars k and l, and polynomials p and q<br />
D (kp+lq) = kDp+llDq<br />
The  the polynomials p(k,n) = n, n(n+1)/2, n(n+1)(n+2)/3, &#8230; n(n+1)(n+2)..(n+k-1)/k!<br />
all satisfy the relation D p(k,n) = p(k-1,n) &#8230; easily proved by induction.<br />
furthermore D is nilpotent on any particular polynomial. i.e. there exists k, D^k( p )= 0<br />
we know D^k p(k,n) = 1<br />
 D^k (q) = 0 for polynomials of lower degree.</p>
<p>now p(k,n) = n^k/k! + lower order terms<br />
D^k p(k,n) = 1 = (1/k!) * D^k (n^k)<br />
D^k n^k = k!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Combinatorial proofs by Brent</title>
		<link>http://mathlesstraveled.com/2012/02/17/combinatorial-proofs/#comment-9199</link>
		<dc:creator><![CDATA[Brent]]></dc:creator>
		<pubDate>Sat, 18 Feb 2012 15:30:09 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1525#comment-9199</guid>
		<description><![CDATA[Ah, neat.  Maybe this is what AB was referring to above.]]></description>
		<content:encoded><![CDATA[<p>Ah, neat.  Maybe this is what AB was referring to above.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Combinatorial proofs by Matt Gardner Spencer</title>
		<link>http://mathlesstraveled.com/2012/02/17/combinatorial-proofs/#comment-9198</link>
		<dc:creator><![CDATA[Matt Gardner Spencer]]></dc:creator>
		<pubDate>Sat, 18 Feb 2012 15:12:57 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1525#comment-9198</guid>
		<description><![CDATA[I have a proof, but I wouldn&#039;t call it algebraic, since I&#039;m taking derivatives.  Start with the original sum.  Expand out the $latex (k+i)^n$ and switch the order of summation, factoring out everything that is not in the inner sum.  

Now go to the binomial theorem: $latex (1+x)^n=\sum_{j=0}^n{n\choose k}x^j.$  Taking derivatives and plugging in $latex x=-1$ gives you 0 on the left, and the terms of the inner sum on the right.  At least for the first $latex n-1$ derivatives.  The $latex n$-th derivative gives you $latex n!$ on the left, and the very last term of the inner sum (and only for one value of the outer sum).  So everything cancels except for one term: $latex n!$]]></description>
		<content:encoded><![CDATA[<p>I have a proof, but I wouldn&#8217;t call it algebraic, since I&#8217;m taking derivatives.  Start with the original sum.  Expand out the <img src='http://s0.wp.com/latex.php?latex=%28k%2Bi%29%5En&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='(k+i)^n' title='(k+i)^n' class='latex' /> and switch the order of summation, factoring out everything that is not in the inner sum.  </p>
<p>Now go to the binomial theorem: <img src='http://s0.wp.com/latex.php?latex=%281%2Bx%29%5En%3D%5Csum_%7Bj%3D0%7D%5En%7Bn%5Cchoose+k%7Dx%5Ej.&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='(1+x)^n=&#92;sum_{j=0}^n{n&#92;choose k}x^j.' title='(1+x)^n=&#92;sum_{j=0}^n{n&#92;choose k}x^j.' class='latex' />  Taking derivatives and plugging in <img src='http://s0.wp.com/latex.php?latex=x%3D-1&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='x=-1' title='x=-1' class='latex' /> gives you 0 on the left, and the terms of the inner sum on the right.  At least for the first <img src='http://s0.wp.com/latex.php?latex=n-1&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='n-1' title='n-1' class='latex' /> derivatives.  The <img src='http://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='n' title='n' class='latex' />-th derivative gives you <img src='http://s0.wp.com/latex.php?latex=n%21&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='n!' title='n!' class='latex' /> on the left, and the very last term of the inner sum (and only for one value of the outer sum).  So everything cancels except for one term: <img src='http://s0.wp.com/latex.php?latex=n%21&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='n!' title='n!' class='latex' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Combinatorial proofs by Brent</title>
		<link>http://mathlesstraveled.com/2012/02/17/combinatorial-proofs/#comment-9194</link>
		<dc:creator><![CDATA[Brent]]></dc:creator>
		<pubDate>Sat, 18 Feb 2012 11:21:43 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1525#comment-9194</guid>
		<description><![CDATA[Ah, interesting!  I think I see what you are getting at---taking pairwise differences is a discrete analog of differentiation.  I&#039;m not sure I see how to work out the details, though. If you have time to expand it into something a bit more detailed I would certainly be interested to see it.]]></description>
		<content:encoded><![CDATA[<p>Ah, interesting!  I think I see what you are getting at&#8212;taking pairwise differences is a discrete analog of differentiation.  I&#8217;m not sure I see how to work out the details, though. If you have time to expand it into something a bit more detailed I would certainly be interested to see it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Combinatorial proofs by Brent</title>
		<link>http://mathlesstraveled.com/2012/02/17/combinatorial-proofs/#comment-9193</link>
		<dc:creator><![CDATA[Brent]]></dc:creator>
		<pubDate>Sat, 18 Feb 2012 11:15:35 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1525#comment-9193</guid>
		<description><![CDATA[It does look wrong, doesn&#039;t it?  But surprisingly, the k is in fact correct!  It turns out that the equation is true for all values of k.  This corresponds to the fact that we can start with any sequence of (n+1) consecutive integers and we still end up with the factorial of n; k represents the first integer in the sequence.]]></description>
		<content:encoded><![CDATA[<p>It does look wrong, doesn&#8217;t it?  But surprisingly, the k is in fact correct!  It turns out that the equation is true for all values of k.  This corresponds to the fact that we can start with any sequence of (n+1) consecutive integers and we still end up with the factorial of n; k represents the first integer in the sequence.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Combinatorial proofs by Jon wilson</title>
		<link>http://mathlesstraveled.com/2012/02/17/combinatorial-proofs/#comment-9192</link>
		<dc:creator><![CDATA[Jon wilson]]></dc:creator>
		<pubDate>Sat, 18 Feb 2012 08:29:37 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1525#comment-9192</guid>
		<description><![CDATA[Why do you have a &#039;k&#039; in your alternate expression for the factorial of &#039;n&#039;? I think you may in fact mean n (instead of k)
Maybe that is why you had trouble proving it algebraically!]]></description>
		<content:encoded><![CDATA[<p>Why do you have a &#8216;k&#8217; in your alternate expression for the factorial of &#8216;n&#8217;? I think you may in fact mean n (instead of k)<br />
Maybe that is why you had trouble proving it algebraically!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Combinatorial proofs by AB</title>
		<link>http://mathlesstraveled.com/2012/02/17/combinatorial-proofs/#comment-9190</link>
		<dc:creator><![CDATA[AB]]></dc:creator>
		<pubDate>Sat, 18 Feb 2012 05:07:06 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1525#comment-9190</guid>
		<description><![CDATA[Well, I don&#039;t know about algebraic, but if you notice that you are taking $latex x^n$ and differentiating it $latex n$ times, the fact that you get $latex n!$ as a result becomes not as surprising. And yes, this argument can be expanded into a proof. 

I&#039;m really waiting to see how you&#039;ll do it combinatorially.]]></description>
		<content:encoded><![CDATA[<p>Well, I don&#8217;t know about algebraic, but if you notice that you are taking <img src='http://s0.wp.com/latex.php?latex=x%5En&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='x^n' title='x^n' class='latex' /> and differentiating it <img src='http://s0.wp.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='n' title='n' class='latex' /> times, the fact that you get <img src='http://s0.wp.com/latex.php?latex=n%21&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='n!' title='n!' class='latex' /> as a result becomes not as surprising. And yes, this argument can be expanded into a proof. </p>
<p>I&#8217;m really waiting to see how you&#8217;ll do it combinatorially.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Differences of powers of consecutive integers, part II by Combinatorial proofs &#124; The Math Less Traveled</title>
		<link>http://mathlesstraveled.com/2012/02/16/differences-of-powers-of-consecutive-integers-part-ii/#comment-9186</link>
		<dc:creator><![CDATA[Combinatorial proofs &#124; The Math Less Traveled]]></dc:creator>
		<pubDate>Sat, 18 Feb 2012 02:04:22 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1444#comment-9186</guid>
		<description><![CDATA[[...] The Math Less Traveled   Explorations in mathematical beauty      Skip to content HomeAbout&#160;meAbout this blog&#160;(FAQ)AppendicesComplex&#160;NumbersFactorial!Sigma&#160;NotationLicense        &#8592; Differences of powers of consecutive integers, part&#160;II [...]]]></description>
		<content:encoded><![CDATA[<p>[...] The Math Less Traveled   Explorations in mathematical beauty      Skip to content HomeAbout&nbsp;meAbout this blog&nbsp;(FAQ)AppendicesComplex&nbsp;NumbersFactorial!Sigma&nbsp;NotationLicense        &larr; Differences of powers of consecutive integers, part&nbsp;II [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Sigma Notation by Differences of powers of consecutive integers, part II &#124; The Math Less Traveled</title>
		<link>http://mathlesstraveled.com/appendices/sigma-notation/#comment-9185</link>
		<dc:creator><![CDATA[Differences of powers of consecutive integers, part II &#124; The Math Less Traveled]]></dc:creator>
		<pubDate>Fri, 17 Feb 2012 23:31:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.mathlesstraveled.com/?page_id=50#comment-9185</guid>
		<description><![CDATA[[...]  Skip to content HomeAbout&#160;meAbout this blog&#160;(FAQ)AppendicesComplex&#160;NumbersFactorial!Sigma&#160;NotationLicense        &#8592; 17&#215;17 4-coloring with no [...]]]></description>
		<content:encoded><![CDATA[<p>[...]  Skip to content HomeAbout&nbsp;meAbout this blog&nbsp;(FAQ)AppendicesComplex&nbsp;NumbersFactorial!Sigma&nbsp;NotationLicense        &larr; 17&#215;17 4-coloring with no [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Sigma Notation by Differences of powers of consecutive integers, part II &#124; The Math Less Traveled</title>
		<link>http://mathlesstraveled.com/appendices/sigma-notation/#comment-9171</link>
		<dc:creator><![CDATA[Differences of powers of consecutive integers, part II &#124; The Math Less Traveled]]></dc:creator>
		<pubDate>Fri, 17 Feb 2012 02:16:39 +0000</pubDate>
		<guid isPermaLink="false">http://www.mathlesstraveled.com/?page_id=50#comment-9171</guid>
		<description><![CDATA[[...]  Skip to content HomeAbout&#160;meAbout this blog&#160;(FAQ)AppendicesComplex&#160;NumbersFactorial!Sigma&#160;NotationLicense        &#8592; Differences of powers of consecutive&#160;integers Computing with [...]]]></description>
		<content:encoded><![CDATA[<p>[...]  Skip to content HomeAbout&nbsp;meAbout this blog&nbsp;(FAQ)AppendicesComplex&nbsp;NumbersFactorial!Sigma&nbsp;NotationLicense        &larr; Differences of powers of consecutive&nbsp;integers Computing with [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
