<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Number Theory on PostDoc Problems</title>
    <link>https://apurvanakade.github.io/blog/tags/number-theory/</link>
    <description>Recent content in Number Theory on PostDoc Problems</description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Thu, 26 Oct 2023 09:01:26 +0000</lastBuildDate>
    <atom:link href="https://apurvanakade.github.io/blog/tags/number-theory/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Logarithms and primes</title>
      <link>https://apurvanakade.github.io/blog/maths--science/popular-science/2023-10-26-ln-series/</link>
      <pubDate>Thu, 26 Oct 2023 09:01:26 +0000</pubDate>
      <guid>https://apurvanakade.github.io/blog/maths--science/popular-science/2023-10-26-ln-series/</guid>
      <description>&lt;p&gt;I came across &lt;a href=&#34;https://youtu.be/YAsHGOwB408?si=Cwpk8X24xNNh2OS9&#34;&gt;this video&lt;/a&gt; by NumberPhile and 3Blue1Brown about the density of primes that are 1 mod 4 vs the density of primes that are 3 mod 4.&#xA;The main fact is quite cool but there was something that he said during in the middle of the video that I found more interesting.&lt;/p&gt;&#xA;&lt;p&gt;Define $\chi : \mathbb{N} \to {-1, 0, 1}$ as&#xA;$$&#xA;\chi(n) =&#xA;\begin{cases}&#xA;1 &amp;amp; \text{ if } n \equiv 1 \mod 4 \&#xA;-1 &amp;amp; \text{ if } n \equiv 3 \mod 4 \&#xA;0  &amp;amp; \text{ otherwise. }&#xA;\end{cases}&#xA;$$&#xA;The first interesting fact that I do not know how to prove:&#xA;$$&#xA;\sum \limits_{n \in \mathbb{N}} \dfrac{\chi(n)}{n} = \dfrac{\pi}{4}.&#xA;$$&#xA;Note that the series is only conditionally convergent so the order of summation matters.&lt;/p&gt;</description>
    </item>
    <item>
      <title>The L-functions and modular forms database (LMFDB)</title>
      <link>https://apurvanakade.github.io/blog/maths--science/popular-science/2023-09-24-lmfdb/</link>
      <pubDate>Sun, 24 Sep 2023 12:22:43 +0000</pubDate>
      <guid>https://apurvanakade.github.io/blog/maths--science/popular-science/2023-09-24-lmfdb/</guid>
      <description>&lt;p&gt;&lt;a href=&#34;https://www.lmfdb.org/&#34;&gt;LMFDB&lt;/a&gt;&#xA;&lt;a href=&#34;https://github.com/LMFDB/lmfdb&#34;&gt;Github&lt;/a&gt;&lt;/p&gt;&#xA;&lt;blockquote&gt;&#xA;&lt;p&gt;The LMFDB is a database of mathematical objects arising in number theory and arithmetic geometry that illustrates some of the mathematical connections predicted by the Langlands program.&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;I love this website. I don&amp;rsquo;t understand anything on it.&#xA;But I&amp;rsquo;m amazed that this exists and I marvel at the amount of effort the writers must have put into making this happen.&#xA;I&amp;rsquo;ve always thought that number theory is unique in how it manages to straddle the concrete and the abstract worlds so effortlessly.&#xA;This website is a proof of this.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Every Prime $\equiv 1 \mod 4$ Is a Sum of Two Squares</title>
      <link>https://apurvanakade.github.io/blog/maths--science/popular-science/2023-09-10-prime-sum-of-squares/</link>
      <pubDate>Sun, 10 Sep 2023 15:35:44 +0000</pubDate>
      <guid>https://apurvanakade.github.io/blog/maths--science/popular-science/2023-09-10-prime-sum-of-squares/</guid>
      <description>&lt;p&gt;I came across this &amp;ldquo;one sentence&amp;rdquo; proof that every prime congruent to 1 mod 4 can be written as a sum of two squares:&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&#34;https://doi.org/10.2307/2323918&#34;&gt;https://doi.org/10.2307/2323918&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;The proof involves constructing the following cryptic involution&#xA;$$&#xA;(x, y, z) \mapsto \begin{cases}(x+2 z, z, y-x-z) &amp;amp; \text { if } x&amp;lt;y-z \ (2 y-x, y, x-y+z) &amp;amp; \text { if } y-z&amp;lt;x&amp;lt;2 y \ (x-2 y, x-y+z, y) &amp;amp; \text { if } x&amp;gt;2 y\end{cases}&#xA;$$&#xA;on the set $S=\left{(x, y, z) \in \mathbb{N}^{3}: x^{2}+4 y z=p\right}$  and showing that the involution has exactly one fixed point $(1, 1, k)$ if and only if $p$ is a prime of the form $4k + 1$.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
