<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Lowest Common Factor? by Tracey Otsuji</title>
      <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz</link>
      <description>Why is there no such thing as an LCF?</description>
      <language>en-us</language>
      <pubDate>2019-08-12 01:44:35 UTC</pubDate>
      <lastBuildDate>2019-08-20 21:39:53 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>well i think because factors are few there is not a lot of room to work with. so they maybe thought it was to easy.</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374149921</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-12 17:00:42 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374149921</guid>
      </item>
      <item>
         <title>Its Easy!</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374169964</link>
         <description><![CDATA[<div>i like it because its fast and easy, all you have to do is find a number that can be multiplied into both of the numbers, then find how much you have to multiply to get your numbers, and once you reach a number that can't be multiplied, add all the numbers that can be multiplied into both numbers, and WALLA, you have your answer</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-12 18:36:16 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374169964</guid>
      </item>
      <item>
         <title>Well....</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374372381</link>
         <description><![CDATA[<div>I think that there is no such thing as a LCF because they just wanted it to be different from GCF. Also, they might have thought it would be too easy.<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 18:06:00 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374372381</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374372909</link>
         <description><![CDATA[<div>There is no such thing as an LCF because there are multiple LCFs</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 18:09:11 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374372909</guid>
      </item>
      <item>
         <title></title>
         <author>narmstrong0025</author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374373378</link>
         <description><![CDATA[
I think that there is no such thing as a LCF because they just wanted it to be different from GCF. Also, they might have thought it would be too easy.


more_vert
Its Easy!
Its Easy!
i like it because its fast and easy, all you have to do is find a number that can be multiplied into both of the numbers, then find how much you have to multiply to get your numbers, and once you reach a number that can't be multiplied, add all the numbers that can be multiplied into both numbers, and WALLA, you have your answer
well i think because factors are few there is not a lot of room to work with. so they maybe thought it was to easy.
well i think because factors are few there is not a lot of room to work with. so they maybe thought it was to easy.
]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 18:11:41 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374373378</guid>
      </item>
      <item>
         <title>Why is there no common multiple? -Holden</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374373640</link>
         <description><![CDATA[<div>I think there is no least common multiple because it will always be one.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 18:13:06 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374373640</guid>
      </item>
      <item>
         <title>My answer</title>
         <author>ehauser4927</author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374378603</link>
         <description><![CDATA[<div>There is no least common multiple because it will always be 1 and its to easy.<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 18:37:57 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374378603</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374382990</link>
         <description><![CDATA[<div>it is not that it is least common </div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 18:59:38 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374382990</guid>
      </item>
      <item>
         <title>Why is there no common multiple? -Jarod </title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374390624</link>
         <description><![CDATA[<div>I think that LCF is not a thing because no matter the problem and numbers it will always be 1.<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 19:49:55 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374390624</guid>
      </item>
      <item>
         <title>There is no lowest common factor because... </title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374390759</link>
         <description><![CDATA[<div>The 1 will always appear to be the lowest common factor because it can multiply with any number, so that means it will always be factor of no matter what. 1 is the lowest number, so no other number will be  the lowest common factor because 1 is always going be there and is the lowest number. <br><br>                                   -Matt</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 19:50:58 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374390759</guid>
      </item>
      <item>
         <title>aidan</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374392080</link>
         <description><![CDATA[<div>there is no such thing as the lowest common factor because 1 will always be the lowest so there is no point in having an L.C.F</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 20:00:29 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374392080</guid>
      </item>
      <item>
         <title>Gabby</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374400790</link>
         <description><![CDATA[<div>there is no such thing because it will always be one and you don't need to know the LCF<br><br><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 21:12:23 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374400790</guid>
      </item>
      <item>
         <title>Jace L.</title>
         <author>jlaughton9240</author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374402005</link>
         <description><![CDATA[<div>Well because 1 decicied <br>[insert joke here] . one will always be the lowest.</div>]]></description>
         <pubDate>2019-08-13 21:23:10 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374402005</guid>
      </item>
      <item>
         <title>Jordan D.</title>
         <author>jbosque4187</author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374403624</link>
         <description><![CDATA[<div>There is no such thing as a LCF because you don't need to know the lowest common factor.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 21:36:59 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374403624</guid>
      </item>
      <item>
         <title>E</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374405597</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 21:57:10 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374405597</guid>
      </item>
      <item>
         <title>Er</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374405599</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 21:57:10 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374405599</guid>
      </item>
      <item>
         <title>Erica </title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374405600</link>
         <description><![CDATA[<div>you  don't need it because its too easy and its always gonna be 1 so , its just unnecessary </div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-13 21:57:11 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374405600</guid>
      </item>
      <item>
         <title>Alex</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374438431</link>
         <description><![CDATA[<div>There is no such as LCF because the answer is always 1.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 02:30:14 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374438431</guid>
      </item>
      <item>
         <title>Giselle </title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374442121</link>
         <description><![CDATA[<div>there is no such thing as a lowest common factor because the answer will always be 1</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 02:57:29 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374442121</guid>
      </item>
      <item>
         <title>Anthony-LCF</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374445400</link>
         <description><![CDATA[<div>There is no such thing as LCF. It is always going to be 1.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 03:25:27 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374445400</guid>
      </item>
      <item>
         <title>Nicholas</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374445725</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 03:28:14 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374445725</guid>
      </item>
      <item>
         <title>Nicholas-LCF</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374445733</link>
         <description><![CDATA[<div>There is no LCF, only because it will always be 1.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 03:28:21 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374445733</guid>
      </item>
      <item>
         <title>Hailey</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374587592</link>
         <description><![CDATA[<div>There is always a 1 what ever you do. </div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 17:38:37 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374587592</guid>
      </item>
      <item>
         <title>Brooke</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374587937</link>
         <description><![CDATA[<div>There is a 1 even if you do 2 times 1 it is still 1<br> </div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 17:40:11 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374587937</guid>
      </item>
      <item>
         <title>there is 1 every time </title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374606596</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 18:56:12 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374606596</guid>
      </item>
      <item>
         <title>It is always gonna be one because there is nothing </title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374621473</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 20:11:50 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374621473</guid>
      </item>
      <item>
         <title>Why I think there is no LCF</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374626221</link>
         <description><![CDATA[<div>because it will always be the same number 1.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 20:34:02 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374626221</guid>
      </item>
      <item>
         <title>It is not their because no matter what the lowest common factor would be 1</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374626309</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 20:34:50 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374626309</guid>
      </item>
      <item>
         <title>lcf</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374626423</link>
         <description><![CDATA[<div>it is not their because no matter what the lowest it can be is 1</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 20:35:55 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374626423</guid>
      </item>
      <item>
         <title>𝕀𝕤 𝕥𝕙𝕖𝕣𝕖 𝕒 𝕃𝕖𝕒𝕤𝕥 ℂ𝕠𝕞𝕞𝕠𝕟 𝔽𝕒𝕔𝕥𝕠𝕣?</title>
         <author>mberger8168</author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374633437</link>
         <description><![CDATA[<div>Technically, yes there is, but it is always 1. It's like multiplying by 0, your answer is always the same.<br><br><br>P.S. don't copy my title.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 21:31:38 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374633437</guid>
      </item>
      <item>
         <title>Peppa (Malkiah)</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634125</link>
         <description><![CDATA[<div>No, your answer will always be the same.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 21:37:03 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634125</guid>
      </item>
      <item>
         <title>Aubrielle S.</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634140</link>
         <description><![CDATA[<div>No, because your answer will always be the same.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 21:37:11 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634140</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634143</link>
         <description><![CDATA[<div>N</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 21:37:12 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634143</guid>
      </item>
      <item>
         <title>Mckenzie</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634283</link>
         <description><![CDATA[<div>no, your answer will always be the same. </div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 21:38:18 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634283</guid>
      </item>
      <item>
         <title>Ryan</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634664</link>
         <description><![CDATA[<div>No, if there was one the same number would just repeat which is 1, because that is the lowest number the factor can get to.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 21:41:44 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634664</guid>
      </item>
      <item>
         <title>Kiana C</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634791</link>
         <description><![CDATA[<div>There is no such thing as LCF because the answer would always be one.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 21:42:46 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374634791</guid>
      </item>
      <item>
         <title>Maliha</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374635100</link>
         <description><![CDATA[<div>I think LCF is not a thing because you will always be 1 no matter what.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 21:45:37 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374635100</guid>
      </item>
      <item>
         <title>L</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374638522</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 22:28:58 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374638522</guid>
      </item>
      <item>
         <title>(Mason Red) LCF is not a thing because it will always be one </title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374638523</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 22:28:58 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374638523</guid>
      </item>
      <item>
         <title>Kaylee </title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374642977</link>
         <description><![CDATA[<div>There isn't LCF because the answer will always be one.  </div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-14 23:16:38 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374642977</guid>
      </item>
      <item>
         <title>it won&#39;t work because you will keep getting one no matter what        aliya g</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374679321</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-15 03:34:24 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374679321</guid>
      </item>
      <item>
         <title>There isnt a LCF becaue the answer would always be one</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374682864</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-15 04:04:40 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374682864</guid>
      </item>
      <item>
         <title>it will always be 1</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374849674</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-15 18:30:58 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374849674</guid>
      </item>
      <item>
         <title>kona</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374850297</link>
         <description><![CDATA[<div>LCF is pointless beacuse it will always be one.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-15 18:32:52 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374850297</guid>
      </item>
      <item>
         <title>Corbijn</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374889750</link>
         <description><![CDATA[<div>it will always be one</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-15 21:34:30 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/374889750</guid>
      </item>
      <item>
         <title>Yasmeen</title>
         <author></author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/375842408</link>
         <description><![CDATA[<div>It will always be one.</div>]]></description>
         <enclosure url="" />
         <pubDate>2019-08-20 21:01:09 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/375842408</guid>
      </item>
      <item>
         <title>The answer will always be one. So you wouldn&#39;t get any other number only 1.</title>
         <author>aortiz6503</author>
         <link>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/375848109</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2019-08-20 21:39:14 UTC</pubDate>
         <guid>https://padlet.com/tracey_otsuji/k8tf8jhoukbz/wish/375848109</guid>
      </item>
   </channel>
</rss>
