<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Counting &amp; Combinatorics &#8211; Sumthing Else</title>
	<atom:link href="https://sumthing-else.com/product-category/counting-combinatorics/feed/" rel="self" type="application/rss+xml" />
	<link>https://sumthing-else.com</link>
	<description>Curiosity. Learning. Something more.</description>
	<lastBuildDate>Thu, 08 Oct 2026 08:12:15 +0000</lastBuildDate>
	<language>en-GB</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1.3</generator>

<image>
	<url>https://sumthing-else.com/wp-content/uploads/2026/09/square_public_image-100x100.png</url>
	<title>Counting &amp; Combinatorics &#8211; Sumthing Else</title>
	<link>https://sumthing-else.com</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>Counting &#038; Combinatorics — Complete Course</title>
		<link>https://sumthing-else.com/product/counting-combinatorics-complete-course/</link>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Sat, 26 Sep 2026 03:04:16 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=2135</guid>

					<description><![CDATA[A complete six-lesson introduction to combinatorics, from systematic counting and tree diagrams through factorials, combinations, Pascal’s triangle and clever counting strategies. Includes printable materials and answers.]]></description>
										<content:encoded><![CDATA[<p><strong>Explore six lessons of puzzles, patterns and powerful counting ideas.</strong></p>
<p><em>Counting &amp; Combinatorics</em> begins with a simple question: how can we count every possibility without missing one or counting anything twice? Across six lessons, learners progress from systematic lists and tree diagrams to multiplication, arrangements, combinations, Pascal’s triangle and flexible counting strategies.</p>
<p>The course is designed for exploration rather than memorising formulas. Learners are encouraged to organise possibilities, test ideas, compare methods and explain why their counting works.</p>
<h3>The complete course includes</h3>
<ul>
<li><a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/1-how-many-possibilities/"><strong>Lesson 1: How many possibilities?</strong></a> — systematic lists, tables and tree diagrams;</li>
<li><a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/2-choices-in-stages/"><strong>Lesson 2: Choices in stages</strong></a> — the multiplication principle and multi-stage counting;</li>
<li><a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/3-arrangements/"><strong>Lesson 3: Arrangements</strong></a> — order, factorials and restricted arrangements;</li>
<li><a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/4-choosing-without-ordering/"><strong>Lesson 4: Choosing without ordering</strong></a> — combinations, teams and selections;</li>
<li><a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/5-pascals-triangle/"><strong>Lesson 5: Pascal’s triangle</strong></a> — combination numbers, symmetry and patterns;</li>
<li><a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/6-clever-counting/"><strong>Lesson 6: Clever counting</strong></a> — complements, cases, symmetry, double counting and other strategies;</li>
<li>printable handouts;</li>
<li>supplementary exercises;</li>
<li>answers and discussion.</li>
</ul>
<p>Suitable for learners aged 10 and over. No formal prerequisites are required, although the lessons are designed to be followed in order.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to<br />
support the creation of more free mathematics resources, you can<br />
<a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener"><br />
support Sumthing Else on Ko-fi<br />
</a>.</p>
<p>This download brings together the full 6-part Beyond Curriculum: <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/">Counting &amp; Combinatorics</a> course.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>Counting &#038; Combinatorics – Lesson 6: Clever Counting</title>
		<link>https://sumthing-else.com/product/counting-combinatorics-lesson-6-clever-counting/</link>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Sat, 26 Sep 2026 02:57:22 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=2133</guid>

					<description><![CDATA[Discover when counting the opposite, splitting into cases, using symmetry or double counting makes a problem simpler. A strategy-focused final lesson with practice and challenge problems.]]></description>
										<content:encoded><![CDATA[<p><strong>Sometimes the quickest way to count something is not to count it directly.</strong></p>
<p>In Lesson 6 of <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/"><em>Counting &amp; Combinatorics</em></a>, learners bring together the ideas from the course and explore a collection of powerful counting strategies.</p>
<p>They investigate counting the opposite, splitting a problem into cases, using symmetry, counting the same thing in two ways and replacing a complicated object with a simpler one.</p>
<h3>This lesson includes</h3>
<ul>
<li>complementary counting — counting what is easier instead;</li>
<li>splitting problems into separate cases;</li>
<li>using symmetry to avoid repeated work;</li>
<li>double counting and counting the same set in two ways;</li>
<li>matching complicated objects with simpler objects;</li>
<li>problems involving coin tosses, codes, handshakes, diagonals and subsets;</li>
<li>a rectangle-counting challenge;</li>
<li>answers and discussion;</li>
<li>supplementary exercises for extra practice and revision.</li>
</ul>
<p>Suitable for learners aged 10 and over. This lesson draws on ideas developed throughout Lessons 1–5.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to<br />
support the creation of more free mathematics resources, you can<br />
<a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener"><br />
support Sumthing Else on Ko-fi<br />
</a>.</p>
<p>This is <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/6-clever-counting/">Lesson 6</a> of the 6-part Beyond Curriculum: Counting &amp; Combinatorics course.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>Counting &#038; Combinatorics – Lesson 5: Pascal’s Triangle</title>
		<link>https://sumthing-else.com/product/counting-combinatorics-lesson-5-pascals-triangle/</link>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Sat, 26 Sep 2026 02:38:05 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=2131</guid>

					<description><![CDATA[Build Pascal’s triangle and uncover why its entries count combinations. Explore its addition rule, symmetry, patterns and connections with choosing groups.]]></description>
										<content:encoded><![CDATA[<p><strong>Why does Pascal’s triangle appear whenever we count combinations?</strong></p>
<p>In Lesson 5 of <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/"><em>Counting &amp; Combinatorics</em></a>, learners build Pascal’s triangle row by row and investigate the patterns hidden inside it. They then connect each row with the numbers of ways to choose different-sized groups.</p>
<p>The lesson explains why neighbouring entries add together, explores symmetry and row sums, and shows how Pascal’s triangle can answer combination questions without starting again from scratch.</p>
<h3>This lesson includes</h3>
<ul>
<li>building and continuing Pascal’s triangle;</li>
<li>the rule that each inside entry is the sum of the two above it;</li>
<li>the connection between Pascal’s triangle and combinations;</li>
<li>committee and team-selection problems;</li>
<li>an explanation of the Pascal recurrence using two cases;</li>
<li>symmetry and other patterns in the triangle;</li>
<li>answers and discussion;</li>
<li>supplementary exercises for extra practice and revision.</li>
</ul>
<p>Suitable for learners aged 10 and over. Familiarity with combinations from Lesson 4 is recommended.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to<br />
support the creation of more free mathematics resources, you can<br />
<a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener"><br />
support Sumthing Else on Ko-fi<br />
</a>.</p>
<p>This is <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/5-pascals-triangle/">Lesson 5</a> of the 6-part Beyond Curriculum: Counting &amp; Combinatorics course.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>Counting &#038; Combinatorics – Lesson 4: Choosing Without Ordering</title>
		<link>https://sumthing-else.com/product/counting-combinatorics-lesson-4-choosing-without-ordering/</link>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Sat, 26 Sep 2026 01:44:47 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=2129</guid>

					<description><![CDATA[Does changing the order create a genuinely new choice? Explore combinations, teams, committees and why ordered selections sometimes need to be divided by repeated arrangements.]]></description>
										<content:encoded><![CDATA[<p><strong>What changes when the group matters, but the order does not?</strong></p>
<p>In Lesson 4 of <em>Counting &amp; Combinatorics</em>, learners compare arrangements with selections such as teams, committees and pizza toppings. They see why Alice–Ben and Ben–Alice describe the same team and why ordered counting can overcount.</p>
<p>The lesson develops from choosing two people to choosing larger groups, leading to combination notation and the idea of dividing by the orders that do not matter.</p>
<h3>This lesson includes</h3>
<ul>
<li>practice deciding whether order matters;</li>
<li>two-person team examples showing duplicate ordered choices;</li>
<li>choosing larger groups by arranging first and dividing by unwanted orders;</li>
<li>combination notation;</li>
<li>the symmetry between choosing what stays and choosing what is left out;</li>
<li>team, committee and pizza-topping problems;</li>
<li>answers and discussion;</li>
<li>supplementary exercises for extra practice and revision.</li>
</ul>
<p>Suitable for learners aged 10 and over. Lesson 3 on arrangements is recommended first.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to support the creation of more free mathematics resources, you can <a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener">support Sumthing Else on Ko-fi</a>.</p>
<p>This is Lesson 4 of the 6-part Beyond Curriculum: Counting &amp; Combinatorics course.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>Counting &#038; Combinatorics – Lesson 3: Arrangements</title>
		<link>https://sumthing-else.com/product/counting-combinatorics-lesson-3-arrangements/</link>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Sat, 26 Sep 2026 01:26:43 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=2113</guid>

					<description><![CDATA[How many different orders can the same objects make? Explore arrangements, factorials, fixed positions and the block method through visual examples, practice questions and challenges.]]></description>
										<content:encoded><![CDATA[<p><strong>How many different orders can the same objects make?</strong></p>
<p>In Lesson 3 of <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/"><em>Counting &amp; Combinatorics</em></a>, learners explore arrangements by placing books, people and letters in different orders. They discover how the multiplication principle leads naturally to factorials.</p>
<p>The lesson then develops the idea through fixed positions, restricted positions and problems where two objects must stay together.</p>
<h3>This lesson includes</h3>
<ul>
<li>a clear introduction to arrangements and why order matters;</li>
<li>worked examples using books, people and letters;</li>
<li>factorial notation and the rule for arranging <em>n</em> different objects;</li>
<li>problems with fixed and restricted positions;</li>
<li>the block method for objects that must stay together;</li>
<li>a challenge on keeping two friends together;</li>
<li>answers and discussion;</li>
<li>supplementary exercises for extra practice and revision.</li>
</ul>
<p>Suitable for learners aged 10 and over. Familiarity with the multiplication principle from Lesson 2 is helpful.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to<br />
support the creation of more free mathematics resources, you can<br />
<a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener"><br />
support Sumthing Else on Ko-fi<br />
</a>.</p>
<p>This is <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/3-arrangements/">Lesson 3</a> of the 6-part Beyond Curriculum: Counting &amp; Combinatorics course.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>Counting &#038; Combinatorics Lesson 2 – Choices in Stages</title>
		<link>https://sumthing-else.com/product/counting-combinatorics-lesson-2-choices-in-stages/</link>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Sat, 26 Sep 2026 00:05:03 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=2093</guid>

					<description><![CDATA[Explore the multiplication principle through choices in stages, codes, no-repetition problems and factor challenges. Includes a guided handout, exercises and answers.]]></description>
										<content:encoded><![CDATA[<p><strong>Learn how to count choices in stages using multiplication.</strong></p>
<p>In Lesson 2 of <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/"><em>Counting &amp; Combinatorics</em></a>, learners discover the multiplication principle: when a process happens in stages, the number of possibilities can often be found by multiplying the number of choices available at each stage.</p>
<p>The lesson develops this idea through outfits, ice creams, game characters, codes, café orders and coloured-ball problems. Learners also explore what happens when earlier choices reduce the number of later options, and when separate cases should be added rather than multiplied.</p>
<h3>Included</h3>
<ul>
<li><strong>Lesson Handout</strong> — guided examples, practice, learning prompts and the Mystery Balls challenge.</li>
<li><strong>Exercises</strong> — extra problems on multi-stage counting, no repetition, separate cases and working backwards from a total.</li>
<li><strong>Answers and discussion</strong> at the back of both resources.</li>
</ul>
<p><strong>Topics include:</strong></p>
<ul>
<li>the multiplication principle;</li>
<li>two-stage and multi-stage choices;</li>
<li>counting codes;</li>
<li>choices without repetition;</li>
<li>multiplying through stages;</li>
<li>adding separate cases;</li>
<li>factor problems and working backwards.</li>
</ul>
<p>The materials are designed for a parent and child to explore together or for an older learner to work through independently.</p>
<p>This is the printable companion to <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/2-choices-in-stages/"><strong>Lesson 2: Choices in stages</strong></a> in the free Sumthing Else Counting &amp; Combinatorics course.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to<br />
support the creation of more free mathematics resources, you can<br />
<a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener"><br />
support Sumthing Else on Ko-fi<br />
</a>.</p>
]]></content:encoded>
					
		
		
			</item>
		<item>
		<title>Counting &#038; Combinatorics Lesson 1 – How Many Possibilities?</title>
		<link>https://sumthing-else.com/product/counting-combinatorics-lesson-1-how-many-possibilities/</link>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Fri, 25 Sep 2026 22:57:36 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=2078</guid>

					<description><![CDATA[<blockquote>Explore systematic counting with lists, tables and tree diagrams. Includes a guided handout, supplementary exercises, challenges and answers.</blockquote>]]></description>
										<content:encoded><![CDATA[<p><strong>Learn how to count possibilities without missing any — or counting the same one twice.</strong></p>
<p>In Lesson 1 of <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/"><em>Counting &amp; Combinatorics</em></a>, learners explore systematic ways of organising possibilities using lists, tables and tree diagrams.</p>
<p>Along the way they investigate outfits, codes, handshakes and triangles, and begin thinking about an important question in combinatorics: <strong>does order matter?</strong></p>
<h3>Included</h3>
<ul>
<li><strong>Lesson Handout</strong> — guided examples, practice, learning prompts and a challenge.</li>
<li><strong>Exercises</strong> — extra questions for practice, extension and revision.</li>
<li><strong>Answers and discussion</strong> at the back of both resources.</li>
</ul>
<p>The materials are designed for a parent and child to explore together or for an older learner to work through independently.</p>
<p><strong>Topics include:</strong></p>
<ul>
<li>systematic lists;</li>
<li>tables;</li>
<li>tree diagrams;</li>
<li>counting codes;</li>
<li>avoiding double counting;</li>
<li>deciding whether order matters.</li>
</ul>
<p>This is a printable companion to <a href="https://sumthing-else.com/beyond-curriculum/counting-combinatorics/1-how-many-possibilities/"><strong>Lesson 1: How many possibilities?</strong></a> in the free Sumthing Else Counting &amp; Combinatorics course.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to<br />
support the creation of more free mathematics resources, you can<br />
<a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener"><br />
support Sumthing Else on Ko-fi<br />
</a>.</p>
]]></content:encoded>
					
		
		
			</item>
	</channel>
</rss>
