<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Tim&#39;s Collaborative Padlet by </title>
      <link>https://padlet.com/tclark208/wvc33tfi4eamyjpb</link>
      <description>For students to post ideas ...</description>
      <language>en-us</language>
      <pubDate>2023-06-07 08:17:09 UTC</pubDate>
      <lastBuildDate>2023-06-08 17:13:33 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url>https://padlet.net/icons/png/1f3b8.png</url>
      </image>
      <item>
         <title>Tim&#39;s first generalisation</title>
         <author>tclark208</author>
         <link>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2617329841</link>
         <description><![CDATA[<div>Many of you found&nbsp;<strong>empirically</strong> that the longest run of consecutive composite numbers in the set 1-500 was length 13.<br><br>Generalising, can I determine the length of the longest run in a set 1-n? &nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2023-06-07 16:47:26 UTC</pubDate>
         <guid>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2617329841</guid>
      </item>
      <item>
         <title>Tim&#39;s investigation idea</title>
         <author>tclark208</author>
         <link>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2617331501</link>
         <description><![CDATA[<div>How many runs of m (consecutive composite numbers) are there in the set 1-500?<br><br>(... and so, immediately following, in the set 1-n?)</div>]]></description>
         <enclosure url="" />
         <pubDate>2023-06-07 16:49:08 UTC</pubDate>
         <guid>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2617331501</guid>
      </item>
      <item>
         <title>room 1</title>
         <author>0418jenny</author>
         <link>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2618492021</link>
         <description><![CDATA[<div>Conjecture:&nbsp;prime numbers are spread unevenly in an interval.<br>Further investigation: Can we work backwards from the run of non prime number to expressing it in a generating function?</div>]]></description>
         <enclosure url="" />
         <pubDate>2023-06-08 17:01:47 UTC</pubDate>
         <guid>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2618492021</guid>
      </item>
      <item>
         <title>Group 4&#39;s investigation idea</title>
         <author></author>
         <link>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2618495005</link>
         <description><![CDATA[<div>How many groups of three consecutive non-prime numbers are there from 1-500?<br><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2023-06-08 17:06:59 UTC</pubDate>
         <guid>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2618495005</guid>
      </item>
      <item>
         <title>Group 3</title>
         <author></author>
         <link>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2618497167</link>
         <description><![CDATA[<div>When you start with a higher number, it's more likely to find longer series of consecutive non-primes.</div>]]></description>
         <enclosure url="" />
         <pubDate>2023-06-08 17:10:17 UTC</pubDate>
         <guid>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2618497167</guid>
      </item>
      <item>
         <title>Group 2</title>
         <author>mickino</author>
         <link>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2618498707</link>
         <description><![CDATA[<div>Possibly following a similar process to the one proposed by Tim and consider 2x3x4x5x6x7x8.... and eliminate "excessive" factors?</div>]]></description>
         <enclosure url="" />
         <pubDate>2023-06-08 17:12:41 UTC</pubDate>
         <guid>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2618498707</guid>
      </item>
      <item>
         <title>group x&#39;s investigation idea</title>
         <author>mattcrowe88</author>
         <link>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2618499314</link>
         <description><![CDATA[<div>we thought about investigating strings of 6 composites from 1-n.  We noticed that Tim's simplification of 7! was useful, and possible because 3.4 is 12, which 6 is a factor of.  We were heading in the direction of looking at the number of combinations like this involving the numbers 2, 3, 4, 5, 6 and 7, which may take us in the direction we are looking for</div>]]></description>
         <enclosure url="" />
         <pubDate>2023-06-08 17:13:33 UTC</pubDate>
         <guid>https://padlet.com/tclark208/wvc33tfi4eamyjpb/wish/2618499314</guid>
      </item>
   </channel>
</rss>
