<?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: Easy Permutations and Combinations	</title>
	<atom:link href="https://betterexplained.com/articles/easy-permutations-and-combinations/feed/" rel="self" type="application/rss+xml" />
	<link>https://betterexplained.com/articles/easy-permutations-and-combinations/</link>
	<description>Math lessons that click</description>
	<lastBuildDate>Wed, 02 Sep 2026 21:26:08 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	
	<item>
		<title>
		By: Emmanuel		</title>
		<link>https://betterexplained.com/articles/easy-permutations-and-combinations/#comment-568433</link>

		<dc:creator><![CDATA[Emmanuel]]></dc:creator>
		<pubDate>Wed, 02 Sep 2026 21:26:08 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/easy-permutations-and-combinations/#comment-568433</guid>

					<description><![CDATA[&lt;p&gt;Maths is sweet&lt;/p&gt;]]></description>
			<content:encoded><![CDATA[<p>Maths is sweet</p>
]]></content:encoded>
		
			</item>
	<item>
		<title>
		By: ssgcmwatson		</title>
		<link>https://betterexplained.com/articles/easy-permutations-and-combinations/#comment-568397</link>

		<dc:creator><![CDATA[ssgcmwatson]]></dc:creator>
		<pubDate>Mon, 15 Dec 2025 18:06:34 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/easy-permutations-and-combinations/#comment-568397</guid>

					<description><![CDATA[&lt;p&gt;Not to be overly pedantic, but we should say that it is &lt;i&gt;closer&lt;/i&gt; to being a permutation lock than a combination lock, but neither term is perfectly accurate.&lt;/p&gt;&lt;p&gt;In both combinations and permutations, we must draw elements from a set without repetition.  (e.g., the same runner cannot win both 1st and 2nd place, nor the same person serve on two seats of the same committee).&lt;/p&gt;&lt;p&gt;However, in what we call a &quot;combination lock,&quot; something like 35-12-35 is generally a perfectly valid series of numbers.&lt;/p&gt;]]></description>
			<content:encoded><![CDATA[<p>Not to be overly pedantic, but we should say that it is <i>closer</i> to being a permutation lock than a combination lock, but neither term is perfectly accurate.</p>
<p>In both combinations and permutations, we must draw elements from a set without repetition.  (e.g., the same runner cannot win both 1st and 2nd place, nor the same person serve on two seats of the same committee).</p>
<p>However, in what we call a "combination lock," something like 35-12-35 is generally a perfectly valid series of numbers.</p>
]]></content:encoded>
		
			</item>
	<item>
		<title>
		By: thatkid		</title>
		<link>https://betterexplained.com/articles/easy-permutations-and-combinations/#comment-568365</link>

		<dc:creator><![CDATA[thatkid]]></dc:creator>
		<pubDate>Sun, 26 Jan 2025 04:55:51 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/easy-permutations-and-combinations/#comment-568365</guid>

					<description><![CDATA[&lt;p&gt;what abt those things where you can count duplicates&lt;/p&gt;]]></description>
			<content:encoded><![CDATA[<p>what abt those things where you can count duplicates</p>
]]></content:encoded>
		
			</item>
	<item>
		<title>
		By: thatkid		</title>
		<link>https://betterexplained.com/articles/easy-permutations-and-combinations/#comment-568364</link>

		<dc:creator><![CDATA[thatkid]]></dc:creator>
		<pubDate>Sun, 26 Jan 2025 04:55:30 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/easy-permutations-and-combinations/#comment-568364</guid>

					<description><![CDATA[&lt;p&gt;aw thx so much&lt;/p&gt;]]></description>
			<content:encoded><![CDATA[<p>aw thx so much</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
