<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Sequences by Mr Blank</title>
      <link>https://padlet.com/pranavjain966/HPTS_PRANAV</link>
      <description>Prime numbers</description>
      <language>en-us</language>
      <pubDate>2020-08-27 12:56:01 UTC</pubDate>
      <lastBuildDate>2025-10-17 15:00:58 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url>https://padlet.net/icons/png/1f923.png</url>
      </image>
      <item>
         <title>Prime numbers</title>
         <author>pranavjain966</author>
         <link>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702315122</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2020-08-27 13:14:53 UTC</pubDate>
         <guid>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702315122</guid>
      </item>
      <item>
         <title></title>
         <author>pranavjain966</author>
         <link>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702319748</link>
         <description><![CDATA[<div>A <strong>prime number</strong> (or a <strong>prime</strong>) is a <a href="https://en.wikipedia.org/wiki/Natural_number">natural number</a> greater than 1 that is not a <a href="https://en.wikipedia.org/wiki/Product_(mathematics)">product</a> of two smaller natural numbers. A natural number greater than 1 that is not prime is called a <a href="https://en.wikipedia.org/wiki/Composite_number">composite number</a>. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in <a href="https://en.wikipedia.org/wiki/Number_theory">number theory</a> because of the <a href="https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic">fundamental theorem of arithmetic</a>: every natural number greater than 1 is either a prime itself or can be <a href="https://en.wikipedia.org/wiki/Factorization">factorized</a> as a product of primes that is unique <a href="https://en.wikipedia.org/wiki/Up_to">up to</a> their order.</div>]]></description>
         <pubDate>2020-08-27 13:16:26 UTC</pubDate>
         <guid>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702319748</guid>
      </item>
      <item>
         <title></title>
         <author>pranavjain966</author>
         <link>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702331869</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://www.math-salamanders.com/image-files/first-100-prime-numbers.gif" />
         <pubDate>2020-08-27 13:20:47 UTC</pubDate>
         <guid>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702331869</guid>
      </item>
      <item>
         <title></title>
         <author>pranavjain966</author>
         <link>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702336342</link>
         <description><![CDATA[<div><strong>Primes</strong> are of the utmost <strong>importance</strong> to <strong>number</strong> theorists because they are the building blocks of whole <strong>numbers</strong>, and important to the world because their odd mathematical properties make them perfect for our current uses.</div>]]></description>
         <enclosure url="" />
         <pubDate>2020-08-27 13:22:10 UTC</pubDate>
         <guid>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702336342</guid>
      </item>
      <item>
         <title></title>
         <author>pranavjain966</author>
         <link>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702340839</link>
         <description><![CDATA[<div>Factorisation is the best way to find prime numbers. The steps involved in using the factorisation method are:<br><br></div><ul><li><strong>Step 1: </strong>First find the factors of the given number</li><li><strong>Step 2: </strong>Check the number of factors of that number</li><li><strong>Step 3: </strong>If the number of factors is more than two, it is not a prime number.</li></ul><div><strong>Example: </strong>Take a number, say, 36.<br><br></div><div>Now, 36 can be written as 2 × 3 × 2 × 3.  So, the factors of 36 here are 1, 2, 3, 4, 6, 9, 12, 18, and 36. Since the number of factors of 36 is more than 2, it is not a prime number but a <a href="https://byjus.com/maths/composite-numbers/">composite number</a>.<br><br></div><div>Now, if we take the example of 19. The prime factorisation of 19 is 1 x 19. You can see here, there are two factors of 19. Hence, it is a prime number.<br><br></div>]]></description>
         <pubDate>2020-08-27 13:23:41 UTC</pubDate>
         <guid>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702340839</guid>
      </item>
      <item>
         <title>Who discovered prime numbers?</title>
         <author>pranavjain966</author>
         <link>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702356576</link>
         <description><![CDATA[<div><br>In about 200 BC the Greek <strong>Eratosthenes</strong> devised an algorithm for calculating primes called the Sieve of <strong>Eratosthenes</strong>. There is then a long gap in the history of prime numbers during what is usually called the Dark Ages. The next important developments were made by Fermat at the beginning of the 17th Century.</div>]]></description>
         <enclosure url="" />
         <pubDate>2020-08-27 13:29:01 UTC</pubDate>
         <guid>https://padlet.com/pranavjain966/HPTS_PRANAV/wish/702356576</guid>
      </item>
   </channel>
</rss>
