<?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: Navigate a Grid Using Combinations And Permutations	</title>
	<atom:link href="https://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/feed/" rel="self" type="application/rss+xml" />
	<link>https://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/</link>
	<description>Math lessons that click</description>
	<lastBuildDate>Thu, 14 Oct 2021 00:00:53 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	
	<item>
		<title>
		By: Eli Ruben Barber		</title>
		<link>https://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/#comment-568163</link>

		<dc:creator><![CDATA[Eli Ruben Barber]]></dc:creator>
		<pubDate>Thu, 14 Oct 2021 00:00:53 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/?p=205#comment-568163</guid>

					<description><![CDATA[&lt;p&gt;You have several great posts to Combinations and Permutations. However, I didn&#039;t see one about Combinations with repetition. I.e. C(k + n - 1, n - 1)... Any chance you have thought of an intuitive way to explain this one? Great stuff!&lt;/p&gt;]]></description>
			<content:encoded><![CDATA[<p>You have several great posts to Combinations and Permutations. However, I didn't see one about Combinations with repetition. I.e. C(k + n - 1, n - 1)... Any chance you have thought of an intuitive way to explain this one? Great stuff!</p>
]]></content:encoded>
		
			</item>
	<item>
		<title>
		By: Emma		</title>
		<link>https://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/#comment-568115</link>

		<dc:creator><![CDATA[Emma]]></dc:creator>
		<pubDate>Wed, 09 Jun 2021 17:43:31 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/?p=205#comment-568115</guid>

					<description><![CDATA[&lt;p&gt;Thank you so much for writing this article. This explanation finally made it click. Truly a lifesaver!&lt;/p&gt;]]></description>
			<content:encoded><![CDATA[<p>Thank you so much for writing this article. This explanation finally made it click. Truly a lifesaver!</p>
]]></content:encoded>
		
			</item>
	<item>
		<title>
		By: fusi brandon		</title>
		<link>https://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/#comment-568039</link>

		<dc:creator><![CDATA[fusi brandon]]></dc:creator>
		<pubDate>Mon, 11 Jan 2021 11:34:39 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/?p=205#comment-568039</guid>

					<description><![CDATA[&lt;p&gt;bloody well explained Azad !! You saved me once more from the torture of reading standard literature.&lt;/p&gt;&lt;p&gt;Could you work your magic on the catalan numbers??&lt;/p&gt;]]></description>
			<content:encoded><![CDATA[<p>bloody well explained Azad !! You saved me once more from the torture of reading standard literature.</p>
<p>Could you work your magic on the catalan numbers??</p>
]]></content:encoded>
		
			</item>
	<item>
		<title>
		By: Rahul Nair		</title>
		<link>https://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/#comment-568021</link>

		<dc:creator><![CDATA[Rahul Nair]]></dc:creator>
		<pubDate>Fri, 11 Dec 2020 07:07:45 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/?p=205#comment-568021</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/#comment-331886&quot;&gt;aashu&lt;/a&gt;.

&lt;p&gt;it does make a huge difference aashu if you consider moving left and bottom,then you are basically moving in circles which would make amount of ways infinite.&lt;/p&gt;&lt;p&gt;&lt;u&gt;solution: -&lt;/u&gt;&lt;br /&gt;&lt;u&gt;explanation:-&lt;/u&gt;&lt;/p&gt;&lt;p&gt;its a 8*8 chess board so you basically have a total of 16 ways. which could be either right or up, but to move from lower left corner to upper right corner you need to use all of 8 ups and 8 rights.&lt;/p&gt;&lt;p&gt;&lt;u&gt;mathematics:-&lt;/u&gt;&lt;br /&gt;consider there are 16 dash/ spaces (_____) where you need to fill with 8 ups and 8 rights. according to permutations the number of arrangements possible is:&lt;br /&gt;16!/(8!*8!) = 16C8.&lt;/p&gt;]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/#comment-331886">aashu</a>.</p>
<p>it does make a huge difference aashu if you consider moving left and bottom,then you are basically moving in circles which would make amount of ways infinite.</p>
<p><u>solution: -</u><br />
<u>explanation:-</u></p>
<p>its a 8*8 chess board so you basically have a total of 16 ways. which could be either right or up, but to move from lower left corner to upper right corner you need to use all of 8 ups and 8 rights.</p>
<p><u>mathematics:-</u><br />
consider there are 16 dash/ spaces (_____) where you need to fill with 8 ups and 8 rights. according to permutations the number of arrangements possible is:<br />
16!/(8!*8!) = 16C8.</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
