<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>number-theory on S Anand</title>
    <link>https://www.s-anand.net/blog/tag/number-theory/</link>
    <description>Recent content in number-theory on S Anand</description>
    <generator>Hugo -- 0.164.0</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 08 Mar 2005 12:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.s-anand.net/blog/tag/number-theory/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Special numbers</title>
      <link>https://www.s-anand.net/blog/special-numbers/</link>
      <pubDate>Tue, 08 Mar 2005 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/special-numbers/</guid>
      <description>&lt;p&gt;Every number is special. Here&amp;rsquo;s what&amp;rsquo;s &lt;a href=&#34;http://www.stetson.edu/~efriedma/numbers.html&#34;&gt;special about the first 10,000&lt;/a&gt; numbers (almost). For instance, &amp;ldquo;8281 is the only 4-digit square whose two 2-digit pairs are consecutive.&amp;rdquo; And &amp;ldquo;5851 is the only prime so that it, its square, and its cube all have the same sum of digits.&amp;rdquo;&lt;/p&gt;
</description>
    </item>
    <item>
      <title>Prime factorisation algorithm</title>
      <link>https://www.s-anand.net/blog/prime-factorisation-algorithm/</link>
      <pubDate>Sun, 10 Nov 2002 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/prime-factorisation-algorithm/</guid>
      <description>&lt;p&gt;An &lt;a href=&#34;http://www.sciencenews.org/20021026/bob9.asp&#34;&gt;update on the IIT-K prime factorisation algorithm&lt;/a&gt;. via Matthai Markose&lt;/p&gt;
</description>
    </item>
    <item>
      <title>Polynomial-time computability of prime numbers</title>
      <link>https://www.s-anand.net/blog/polynomial-time-computability-of-prime-numbers/</link>
      <pubDate>Tue, 27 Aug 2002 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/polynomial-time-computability-of-prime-numbers/</guid>
      <description>&lt;p&gt;Progress on the &lt;a href=&#34;http://www.wired.com/news/technology/0,1282,54613,00.html&#34;&gt;polynomial-time computability of prime numbers&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
    <item>
      <title>Encyclopaedia of integer sequences</title>
      <link>https://www.s-anand.net/blog/encyclopaedia-of-integer-sequences/</link>
      <pubDate>Tue, 16 Apr 2002 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/encyclopaedia-of-integer-sequences/</guid>
      <description>&lt;p&gt;&lt;a href=&#34;http://www.research.att.com/~njas/sequences/&#34;&gt;Encyclopaedia of integer sequences&lt;/a&gt;. Funny, it couldn&amp;rsquo;t find &amp;ldquo;1,2,3,4,5,6&amp;hellip;&amp;rdquo; though.&lt;/p&gt;
</description>
    </item>
  </channel>
</rss>
