<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Factorials and Permutations by 垃圾桶</title>
      <link>https://padlet.com/taot0803/omn2u1ivtf8u23y7</link>
      <description></description>
      <language>en-us</language>
      <pubDate>2025-05-20 03:06:21 UTC</pubDate>
      <lastBuildDate>2025-05-20 03:31:00 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>📌 Key Concepts:</title>
         <author>taot0803</author>
         <link>https://padlet.com/taot0803/omn2u1ivtf8u23y7/wish/3458429030</link>
         <description><![CDATA[<p>🔹 <strong>Factorial (n!)</strong></p><ul><li><p>Definition: The product of all positive integers from 1 to n.</p></li><li><p>Formula:</p><p>n!=n×(n−1)×(n−2)×⋯×2×1</p></li><li><p>Special Case:</p><p>0!=1</p><p><br/></p></li></ul><p>🔹 <strong>Permutations</strong></p><ul><li><p><strong>Definition:</strong> The number of <strong>arrangements</strong> of objects where <strong>order matters</strong>.</p></li><li><p><strong>Formula (no repetition):</strong></p><p>P(n,r)=n!/(n−r)!</p><p><br/></p><p>Where:</p><ul><li><p>n: total items</p></li><li><p>r: number of items being chosen/arranged</p></li></ul></li><li><p><strong>With Repetition:</strong></p><p>Total&nbsp;permutations=n!/n1!×n2!×⋯×nk!</p><p>Use this when there are repeated elements (like letters in "LEVEL").</p></li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2025-05-20 03:26:45 UTC</pubDate>
         <guid>https://padlet.com/taot0803/omn2u1ivtf8u23y7/wish/3458429030</guid>
      </item>
      <item>
         <title>🎯 Tips to Remember:</title>
         <author>taot0803</author>
         <link>https://padlet.com/taot0803/omn2u1ivtf8u23y7/wish/3458429632</link>
         <description><![CDATA[<ul><li><p>Use <strong>permutations</strong> when the <strong>order matters</strong> (e.g., rankings, passwords).</p></li><li><p>Use <strong>factorials</strong> to count total arrangements.</p></li><li><p>Repetition reduces total permutations — divide by factorials of repeated elements!</p></li></ul>]]></description>
         <enclosure url="" />
         <pubDate>2025-05-20 03:27:05 UTC</pubDate>
         <guid>https://padlet.com/taot0803/omn2u1ivtf8u23y7/wish/3458429632</guid>
      </item>
      <item>
         <title>🧠 Question 1 </title>
         <author>taot0803</author>
         <link>https://padlet.com/taot0803/omn2u1ivtf8u23y7/wish/3458431061</link>
         <description><![CDATA[<p>Q: How many ways can the letters in the word "MATH" be arranged?</p><p><br/></p><p>A:</p><p>All 4 letters are unique:</p><p>4!=4×3×2×1=24</p><p>​</p>]]></description>
         <enclosure url="" />
         <pubDate>2025-05-20 03:27:55 UTC</pubDate>
         <guid>https://padlet.com/taot0803/omn2u1ivtf8u23y7/wish/3458431061</guid>
      </item>
      <item>
         <title>🧠 Question 2</title>
         <author>taot0803</author>
         <link>https://padlet.com/taot0803/omn2u1ivtf8u23y7/wish/3458432514</link>
         <description><![CDATA[<p><strong>Q:</strong> How many distinct arrangements are there for the word <strong>"PEPPER"?</strong></p><p><strong>A:</strong><br>There are 6 letters, with repeated letters:</p><ul><li><p>P appears 3 times</p></li><li><p>E appears 2 times</p></li><li><p>R appears once</p></li></ul><p>6!/3!×2!×1!=720/6×2=60</p>]]></description>
         <enclosure url="" />
         <pubDate>2025-05-20 03:28:48 UTC</pubDate>
         <guid>https://padlet.com/taot0803/omn2u1ivtf8u23y7/wish/3458432514</guid>
      </item>
   </channel>
</rss>
