<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Math is Fun! by Jai</title>
      <link>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef</link>
      <description>Learn mathematical concepts for Intermediate Grades
</description>
      <language>en-us</language>
      <pubDate>2021-10-23 15:37:01 UTC</pubDate>
      <lastBuildDate>2022-03-06 13:40:00 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title></title>
         <author>jairealnotfake</author>
         <link>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/1838551296</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/1419662176/b2bc52dcbf55861ca1f57ca0b181a5a5/images__2_.jpeg" />
         <pubDate>2021-10-23 23:35:46 UTC</pubDate>
         <guid>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/1838551296</guid>
      </item>
      <item>
         <title>Number Theory</title>
         <author>jairealnotfake</author>
         <link>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079896386</link>
         <description><![CDATA[<div>A&nbsp;<strong><em>Prime Number&nbsp;</em></strong>is a whole number greater than 1 which has only two factors (1 and the number itself).<br><br>A&nbsp;<strong><em>Composite Number&nbsp;</em></strong>is a whole number with three or more factors.</div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/1419662176/20782abcfe1f4c69e95d2b77427fff46/images__3_.jpeg" />
         <pubDate>2022-03-06 13:14:27 UTC</pubDate>
         <guid>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079896386</guid>
      </item>
      <item>
         <title>Prime Factorization</title>
         <author>jairealnotfake</author>
         <link>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079898295</link>
         <description><![CDATA[<div>Prime Factorization is a process of expressing a composite number as a product of its prime factors.</div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/1419662176/af8fec8b69353c6548685f9c4ef5e0c4/images__4_.jpeg" />
         <pubDate>2022-03-06 13:17:10 UTC</pubDate>
         <guid>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079898295</guid>
      </item>
      <item>
         <title>Greatest Common Factor</title>
         <author>jairealnotfake</author>
         <link>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079900341</link>
         <description><![CDATA[<div>Greatest Common Factor or GCF is the biggest number that can exactly divide the given numbers. </div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-06 13:19:41 UTC</pubDate>
         <guid>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079900341</guid>
      </item>
      <item>
         <title>Euclidian Algorithm</title>
         <author>jairealnotfake</author>
         <link>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079901491</link>
         <description><![CDATA[<div>The method of finding the GCF of two or more numbers are listing, Prime Factorization, Continuos Division and Euclidian Algorithm.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-06 13:21:26 UTC</pubDate>
         <guid>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079901491</guid>
      </item>
      <item>
         <title>Least Common Multiple</title>
         <author>jairealnotfake</author>
         <link>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079904658</link>
         <description><![CDATA[<div><strong>Multiples</strong> are products of a given number and the natural/counting numbers.<br><br><strong>Least Common Multiple (LCM) </strong>is the least number that can exactly be divided by the given numbers.<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-06 13:26:17 UTC</pubDate>
         <guid>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079904658</guid>
      </item>
      <item>
         <title>Methods of Finding LCM</title>
         <author>jairealnotfake</author>
         <link>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079911010</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/1419662176/d36d4d19a3bb06e6a56541d2530a50de/images__5_.jpeg" />
         <pubDate>2022-03-06 13:34:53 UTC</pubDate>
         <guid>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079911010</guid>
      </item>
      <item>
         <title>Continuous Division</title>
         <author>jairealnotfake</author>
         <link>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079914650</link>
         <description><![CDATA[<div>To find the LCM by division method, we write the given numbers in a row separately by commas, then divide the numbers by a common prime number.</div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/1419662176/4f8b11488af754bca02c949ef582e902/images__7_.jpeg" />
         <pubDate>2022-03-06 13:40:00 UTC</pubDate>
         <guid>https://padlet.com/jairealnotfake/e5kzgd42bt8qtsef/wish/2079914650</guid>
      </item>
   </channel>
</rss>
