<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Real numbers by vinutha g</title>
      <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz</link>
      <description>Make a quick recall </description>
      <language>en-us</language>
      <pubDate>2021-05-23 16:57:35 UTC</pubDate>
      <lastBuildDate>2021-06-11 06:33:39 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url>https://padlet.net/icons/png/263a.png</url>
      </image>
      <item>
         <title>Real numbers</title>
         <author>vinuthag29</author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1551556900</link>
         <description><![CDATA[<div>Recall<br>1. Euclid's division lemma.<br>2. Examples of prime numbers<br>3. Fundamental theorem of arithmetic<br>4. See the picture below and try to explain the method of calculating HCF and LCM using factor tree</div>]]></description>
         <enclosure url="https://image.slidesharecdn.com/fundamentaltheoremofarithmeticrealnumber-140715002157-phpapp01/95/real-numbers-fundamental-theorem-of-arithmetic-real-number-for-class-10th-maths-3-638.jpg?cb=1409632160" />
         <pubDate>2021-05-23 17:00:43 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1551556900</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341431</link>
         <description><![CDATA[<div>BHAVANA&nbsp;<br><br>Euclids division lemma&nbsp;<br>a=bq+r&nbsp;<br><br>Fundamental theorem of arithmetic:every composite number can be expressed as a product of prime and this factorization is unique apart from order in which prime factors occur.<br>Eg:30=2×3×5</div>]]></description>
         <pubDate>2021-05-24 02:34:48 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341431</guid>
      </item>
      <item>
         <title>Charunya</title>
         <author>charunyac9</author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341672</link>
         <description><![CDATA[<div>1. a=bq+r<br>2. prime numbers have only 2 factors&nbsp;<br>ex:2,3,5<br>3. every composite number can be expressed as product of prime numbers where the factorisation is unique.<br>4. hcf can be calculated through factor tree by checking out the common factors between them<br>in the question, 16 and 36 have 2 as common factor twice (2^2) hence hcf is 4<br>lcm can be found out by factorising through factor tree and the product of primes gives lcm<br>like 16=2^4 and 36 =2^2 * 3^2</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:34:54 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341672</guid>
      </item>
      <item>
         <title>MONISH GOWDA.B.C </title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341708</link>
         <description><![CDATA[<div>1. a=bq+r<br>2.eg;- 2,3,5,7,11<br>3.every composite number can be expressed as product of prime no were the factorization is unique.<br>4.. hcf can be calculated through factor tree by checking out the common factors between them<br>in the question, 16 and 36 have 2 as common factor twice (2^2) hence hcf is 4<br>lcm can be found out by factorizing through factor tree and the product of primes gives<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:34:55 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341708</guid>
      </item>
      <item>
         <title>Manogna N</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341710</link>
         <description><![CDATA[<div>1) a=bq+r where 'a' is the dividend, 'b' is the divisor, 'q' is the quotient and 'r' is the remainder where 0&lt;_ r &lt;b<br>2) 2.3.5.7.11.13.17.19<br>3)Every prime number can be written as the product of prime numbers and this factorization of each composite number is unique.</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:34:55 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341710</guid>
      </item>
      <item>
         <title>keerthi </title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341756</link>
         <description><![CDATA[<div>we learnt&nbsp;<br>euclids division lemma -&nbsp; a=bq+r<br>prime number - 2, 3,5,7,11,9 etc&nbsp;<br>fundamental theorem of arithmetic - every composite number is made up of unique set of prime number but the order of prime number can be changed&nbsp;<br>eg - 6=2*3 or 6=3*2&nbsp;<br>where 3 *2 cannot be the factor of any other number </div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:34:55 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341756</guid>
      </item>
      <item>
         <title>Gurujnan R Achar</title>
         <author>hgr8087</author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341995</link>
         <description><![CDATA[<div>1. a=bq+r <br>2. 2,3,5,7,11,23,29,......<br>3. <strong><em>&nbsp;Any composite number can be expressed as a product of its numbers. It has a unique factorization.</em></strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:34:59 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552341995</guid>
      </item>
      <item>
         <title>Lakshan</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342249</link>
         <description><![CDATA[<div>1. a=bq+r&nbsp;<br>prime factorisation<br>euclids division lemma<br><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:35:04 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342249</guid>
      </item>
      <item>
         <title>Naija</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342253</link>
         <description><![CDATA[<div>1. a=bq+r where r is greater or =0 r is lesser than b.<br>2. 2,11,17,3,5<br>3.fta states&nbsp; that any composite number can be expressed as a product of its prime factors . It has a unique factorisation.<br>ex:20,15,30<br>4.we can find hcf by checking out the common factors.<br>lcm can be found when prime numbers are multiplied to&nbsp; find the product</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:35:04 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342253</guid>
      </item>
      <item>
         <title>Trisha D  N </title>
         <author>trishadavanam</author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342336</link>
         <description><![CDATA[<div>1. a = bq + r<br>2. 3, 5 , 7, 9 <br>3.&nbsp; any composite number can be expressed as the product of prime numbers : E g :&nbsp; 5+5+5+5= 25 <br>5 is a prime number<br>4.&nbsp; To <strong>find</strong> the <strong>HCF</strong>, <strong>find</strong> any prime factors that are in common between the products<br>To <strong>find</strong> the <strong>LCM</strong>, multiply the <strong>HCF</strong> by all the numbers in the products that have not yet been used.</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:35:06 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342336</guid>
      </item>
      <item>
         <title>Yashika</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342485</link>
         <description><![CDATA[<div>1. a=bq+r<br>2. 2, 3, 5,&nbsp; 7, 11.......&nbsp;<br>3. every composite number can be factorized&nbsp;as a product of prime numbers<br>4.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:35:10 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342485</guid>
      </item>
      <item>
         <title>Tejas P</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342530</link>
         <description><![CDATA[<div>1) a= bq +r<br>2) 2,3,7,5,11,17<br><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:35:11 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342530</guid>
      </item>
      <item>
         <title>Manya</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342779</link>
         <description><![CDATA[<div>1) a= bq+r<br>2)&nbsp; EDL<br>3)prime number<br>4) HCF<br>5) 2,3,5,7,......</div>]]></description>
         <pubDate>2021-05-24 02:35:16 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342779</guid>
      </item>
      <item>
         <title>Rishi</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342796</link>
         <description><![CDATA[<div>.EDL=a=bq+r<br><br>.prime numbers:no.which have only two numbers as there factors that is 1 and the no. itself. eg :2,3,5,7<br><br>.fundemental theorem of arithmetic states that every composite no. can be expressed as a product of prime no.<br><br><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:35:16 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552342796</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552343484</link>
         <description><![CDATA[<div>shashank&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:35:33 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552343484</guid>
      </item>
      <item>
         <title>Chinmayee</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552344671</link>
         <description><![CDATA[<div>1.a=bq+r<br>2.2,3,5,7,etc<br>3.every composits number can be expressed as a product of prime number .Eg:30=2×5×3<br>4.</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:36:03 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552344671</guid>
      </item>
      <item>
         <title>mithun.v</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552345726</link>
         <description><![CDATA[<div>euclids division lema - a=bq+r<br>where 0(=r( b<br>prime factorisation<br>factor tree</div>]]></description>
         <enclosure url="https://www.onlinemathlearning.com/image-files/xprime-factorization.png.pagespeed.ic.hzChSK4LoK.png" />
         <pubDate>2021-05-24 02:36:29 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552345726</guid>
      </item>
      <item>
         <title>poshika</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552345749</link>
         <description><![CDATA[<div>1)a=bq+r, where r is equal or greater than 0 but lesser than b .<br>2)prime numbers - 2,11,3,5<br>3) every composite number can be expressed as a product of 2 prime numbers .</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:36:30 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552345749</guid>
      </item>
      <item>
         <title>Harshith Suryavanshi.N</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552346118</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://uploads-cdn.omnicalculator.com/images/factor-tree-3.png" />
         <pubDate>2021-05-24 02:36:39 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552346118</guid>
      </item>
      <item>
         <title>Rakshith</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552347754</link>
         <description><![CDATA[<div><br>1.EDL=a=bq+r<br>2.2,3,5,7 etc<br>3.Every composite number can be expressed in the form of 2 prime numbers.<br><br></div>]]></description>
         <pubDate>2021-05-24 02:37:24 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552347754</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552348770</link>
         <description><![CDATA[<div>Chandan<br>a=bq+r<br>Prime number&nbsp;<br>2,3,5,7,11,13,17,19,23,29,31....<br>FTA=Every composite number can be expressed as a product of prime numbers, and this is unique factorisation apart&nbsp;<br><br><br><br><br></div>]]></description>
         <pubDate>2021-05-24 02:37:50 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552348770</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552350026</link>
         <description><![CDATA[<div>Rakshitha 1)a=bq+r (2) examples of prime numbers is 3,5,7,11,13,17,19,23..( 3) FTA states&nbsp;</div>]]></description>
         <pubDate>2021-05-24 02:38:20 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552350026</guid>
      </item>
      <item>
         <title>Hrithik </title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552351178</link>
         <description><![CDATA[<div>1. a=bq+r<br>2. 5,11,9<br>3.&nbsp;<strong><em>&nbsp;Any composite number can be expressed as a product of its numbers. It has a unique factorization.<br>4. hcf&nbsp;<br>5. 3,5,7<br></em></strong><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:38:48 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552351178</guid>
      </item>
      <item>
         <title>harshith suryavanshi.N                  </title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552352311</link>
         <description><![CDATA[<div>prime numbers -&nbsp;<br>2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97.<br><br><br></div>]]></description>
         <pubDate>2021-05-24 02:39:18 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552352311</guid>
      </item>
      <item>
         <title> Gurukiran.S</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552353186</link>
         <description><![CDATA[<div>Ex:2,3,5,7<br>Every composite numbers can be expressed as a product of 2 prime numbers.<br>EDL=a=bq+r<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:39:36 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552353186</guid>
      </item>
      <item>
         <title>shashank </title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552355137</link>
         <description><![CDATA[<div>a = bq +r</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:40:25 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552355137</guid>
      </item>
      <item>
         <title>Likitha</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552356244</link>
         <description><![CDATA[<div>if two positive integers “a” and “b”, then there exists unique integers “q” and “r” such that it satisfies the condition a = bq + r where 0 ≤ r ≤ b</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:40:56 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552356244</guid>
      </item>
      <item>
         <title>BS SAMARTHA</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552357352</link>
         <description><![CDATA[<div>1. a=bq+r<br>2.LCM<br>3.HCF<br>4.PRIME FACTORS<br>5.PRIME NUMBER</div>]]></description>
         <pubDate>2021-05-24 02:41:26 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552357352</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552374136</link>
         <description><![CDATA[<div>a = Bq + r</div>]]></description>
         <enclosure url="" />
         <pubDate>2021-05-24 02:48:51 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1552374136</guid>
      </item>
      <item>
         <title>i am rascal</title>
         <author></author>
         <link>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1600502857</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2021-06-11 06:33:35 UTC</pubDate>
         <guid>https://padlet.com/vinuthag29/gpldnyafs75zluqz/wish/1600502857</guid>
      </item>
   </channel>
</rss>
