<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>AOL3 by ZIYAN WANG</title>
      <link>https://padlet.com/ziyanwang958/bzgif2jmypl61oqj</link>
      <description></description>
      <language>en-us</language>
      <pubDate>2025-05-19 01:53:29 UTC</pubDate>
      <lastBuildDate>2025-05-20 01:50:07 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>Fundamental Counting Principle</title>
         <author>ziyanwang958</author>
         <link>https://padlet.com/ziyanwang958/bzgif2jmypl61oqj/wish/3456299423</link>
         <description><![CDATA[<p>Definition:</p><p>The total number of ways to complete a process with multiple independent stages is the product of the number of choices at each stage.</p><p>Keyword: "And" </p><p>Formula:</p><p>Total Choices = m*n <em>p ..........</em>*1</p><p>m, n, p : Choices at Stage 1, 2, 3, etc.</p>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/3146124895/e3fdda9411be9e3b302e3b2d90566136/_____20250518225923.jpg" />
         <pubDate>2025-05-19 02:02:27 UTC</pubDate>
         <guid>https://padlet.com/ziyanwang958/bzgif2jmypl61oqj/wish/3456299423</guid>
      </item>
      <item>
         <title> Rule of Sum</title>
         <author>ziyanwang958</author>
         <link>https://padlet.com/ziyanwang958/bzgif2jmypl61oqj/wish/3456300882</link>
         <description><![CDATA[<p>Definition:</p><p>For mutually exclusive events (cannot happen simultaneously), the total number of ways to perform either event is the sum of their individual ways. For non-mutually exclusive events, subtract the overlap.</p><p>Keyword: "Or" </p><p>Formulas:</p><p>Mutually Exclusive:</p><p>Total Ways = m + n</p><p>Non-Mutually Exclusive:</p><p>Total Ways} = m + n - Overlap</p>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/3146124895/1a1a0dc229e376f90ece2831c48b368a/_____20250518230457.jpg" />
         <pubDate>2025-05-19 02:03:11 UTC</pubDate>
         <guid>https://padlet.com/ziyanwang958/bzgif2jmypl61oqj/wish/3456300882</guid>
      </item>
      <item>
         <title>Indirect Method</title>
         <author>ziyanwang958</author>
         <link>https://padlet.com/ziyanwang958/bzgif2jmypl61oqj/wish/3456301110</link>
         <description><![CDATA[<p>Definition:</p><p>Calculate the number of desired outcomes by subtracting the number of unwanted  outcomes from the total number of outcomes.</p><p>Logic Formula:</p><p>Desired Outcomes = Total Outcomes - Unwanted Outcomes</p><p><br></p>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/3146124895/b5d030f0858ba147670758475dcc37ae/_____20250519214930.jpg" />
         <pubDate>2025-05-19 02:03:18 UTC</pubDate>
         <guid>https://padlet.com/ziyanwang958/bzgif2jmypl61oqj/wish/3456301110</guid>
      </item>
      <item>
         <title>Formula Summary</title>
         <author>ziyanwang958</author>
         <link>https://padlet.com/ziyanwang958/bzgif2jmypl61oqj/wish/3456315042</link>
         <description><![CDATA[<p>Key Takeaways:</p><p>1 Use FCP for sequential "and" choices .</p><p>2 Use Rule of Sum for "or" choices .</p><p>3 Use Indirect Method when counting "not" cases is easier than direct counting.</p><p><br/></p>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/3146124895/dd6cff8ef781d591d4a392c93967b88f/_____20250518224638.jpg" />
         <pubDate>2025-05-19 02:09:48 UTC</pubDate>
         <guid>https://padlet.com/ziyanwang958/bzgif2jmypl61oqj/wish/3456315042</guid>
      </item>
   </channel>
</rss>
