<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Organized Counting by </title>
      <link>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg</link>
      <description></description>
      <language>en-us</language>
      <pubDate>2025-05-20 02:56:08 UTC</pubDate>
      <lastBuildDate>2025-05-20 03:46:24 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>1. What Is Organized Counting?</title>
         <author>fangyuantu2025</author>
         <link>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458388571</link>
         <description><![CDATA[<p><strong>Combinatorics:</strong> A branch of mathematics that deals with <strong>counting methods</strong>, especially in complex situations.<br>It helps you organize choices and outcomes to <strong>avoid overcounting or undercounting</strong>.</p>]]></description>
         <enclosure url="" />
         <pubDate>2025-05-20 03:05:59 UTC</pubDate>
         <guid>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458388571</guid>
      </item>
      <item>
         <title>2. Tree Diagrams</title>
         <author>fangyuantu2025</author>
         <link>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458391858</link>
         <description><![CDATA[<p> <strong>Example 1: Town Route Problem</strong></p><ul><li><p>3 roads from Ayre to Brantown</p></li><li><p>2 roads from Brantown to Cashcart</p></li><li><p>Total routes: <strong>3 × 2 = 6</strong></p></li><li><p>Includes a <strong>tree diagram</strong> showing all 6 options.</p></li></ul><p> <strong>Example 2: Coin Flips</strong></p><ul><li><p>Flip a coin <strong>3 times</strong></p></li><li><p>Outcomes: H or T each time</p></li><li><p>Total possible results: <strong>2 × 2 × 2 = 8</strong></p></li><li><p>Tree diagram shows all 8 paths (HHH, HHT, ..., TTT)</p></li></ul><p> <strong>Conclusion:</strong> Tree diagrams help <strong>visually organize</strong> all possible outcomes clearly.</p>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/2890583000/b7ff0cffa2ef7aafb1e727748bac5adf/1747711900627.png" />
         <pubDate>2025-05-20 03:07:23 UTC</pubDate>
         <guid>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458391858</guid>
      </item>
      <item>
         <title>2. Tree Diagrams</title>
         <author>fangyuantu2025</author>
         <link>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458440219</link>
         <description><![CDATA[<p> <strong>Example 1: Town Route Problem</strong></p><ul><li><p>3 roads from Ayre to Brantown</p></li><li><p>2 roads from Brantown to Cashcart</p></li><li><p>Total routes: <strong>3 × 2 = 6</strong></p></li><li><p>Includes a <strong>tree diagram</strong> showing all 6 options.</p></li></ul><p> <strong>Example 2: Coin Flips</strong></p><ul><li><p>Flip a coin <strong>3 times</strong></p></li><li><p>Outcomes: H or T each time</p></li><li><p>Total possible results: <strong>2 × 2 × 2 = 8</strong></p></li><li><p>Tree diagram shows all 8 paths (HHH, HHT, ..., TTT)</p></li></ul><p> <strong>Conclusion:</strong> Tree diagrams help <strong>visually organize</strong> all possible outcomes clearly.</p>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/2890583000/58d5528d9ac1c25a9c70625187917c11/1747711827856.png" />
         <pubDate>2025-05-20 03:32:57 UTC</pubDate>
         <guid>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458440219</guid>
      </item>
      <item>
         <title>3. Fundamental Counting Principle </title>
         <author>fangyuantu2025</author>
         <link>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458449217</link>
         <description><![CDATA[<p><strong>Rule of Product:</strong><br>If a task has multiple stages, multiply the number of options for each stage:<br><strong>Total = m × n × p × …</strong></p><p><strong>Keyword:</strong> <em>“AND”</em></p>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/2890583000/d049f831f604e7b76e03ccd1021e16a6/1747712230316.png" />
         <pubDate>2025-05-20 03:37:46 UTC</pubDate>
         <guid>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458449217</guid>
      </item>
      <item>
         <title>4Rule of Sum</title>
         <author>fangyuantu2025</author>
         <link>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458456789</link>
         <description><![CDATA[<p><br></p><p>If one action can be performed in m ways and another action can be performed in n ways and the first and second action are mutualy exclusive,then there are m+ n ways in which either the first action or the second action can be performed.</p><p>The keyword for these problems is “ or "</p><p><strong>To solve these problems, there are four steps:actions</strong></p><p>1.Determne the number of actions</p><p>2.Determine if the actions are mutuauy exclusive</p><p>3.Determine the possblties for each action.</p><p>4. Add the number of possibilities together.</p>]]></description>
         <enclosure url="" />
         <pubDate>2025-05-20 03:42:07 UTC</pubDate>
         <guid>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458456789</guid>
      </item>
      <item>
         <title>5.Indirect Method</title>
         <author>fangyuantu2025</author>
         <link>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458460651</link>
         <description><![CDATA[<p>A problem solving technique for finding a quantity by determining another (opposite)quantity from which the first can be derived, in some situations, the indirect method makes calculations easier.</p>]]></description>
         <enclosure url="" />
         <pubDate>2025-05-20 03:44:14 UTC</pubDate>
         <guid>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458460651</guid>
      </item>
      <item>
         <title>My Original Practice Questions</title>
         <author>fangyuantu2025</author>
         <link>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458464258</link>
         <description><![CDATA[<p><strong>Example 1:</strong></p><blockquote><p>You roll a 6-sided die twice. How many total outcomes?</p></blockquote><p><strong>Answer:</strong><br>6 options for each roll → <strong>6 × 6 = 36 outcomes</strong></p><p><strong>Example 2:</strong></p><blockquote><p>You choose a shirt (3 options) and a pair of shoes (2 options).<br>How many outfit combinations?</p></blockquote><p><strong>Answer:</strong><br>3 × 2 = <strong>6 combinations</strong></p>]]></description>
         <enclosure url="" />
         <pubDate>2025-05-20 03:46:23 UTC</pubDate>
         <guid>https://padlet.com/fangyuantu2025/cunkiqdmsmai0rcg/wish/3458464258</guid>
      </item>
   </channel>
</rss>
