<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Functional Equation on Understanding the Riemann Hypothesis</title>
    <link>https://riemannhypothesis.blog/categories/functional-equation/</link>
    <description>Recent content in Functional Equation on Understanding the Riemann Hypothesis</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <managingEditor>markus@recommend.games (Markus Shepherd)</managingEditor>
    <webMaster>markus@recommend.games (Markus Shepherd)</webMaster>
    <lastBuildDate>Thu, 31 Oct 2013 23:17:14 +0000</lastBuildDate>
    <atom:link href="https://riemannhypothesis.blog/categories/functional-equation/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Perfect Symmetry</title>
      <link>https://riemannhypothesis.blog/2013/10/perfect-symmetry/</link>
      <pubDate>Thu, 31 Oct 2013 23:17:14 +0000</pubDate><author>markus@recommend.games (Markus Shepherd)</author>
      <guid>https://riemannhypothesis.blog/2013/10/perfect-symmetry/</guid>
      <description>So far, we have seen how the Euler product links the \(\zeta\)-function to the prime numbers. More precisely, it encodes the fundamental theorem of arithmetic. One may also say, it&amp;rsquo;s the analytic version of it, in a sense that should become clearer shortly.&#xA;What we have done so far works perfectly for the real numbers. The sum \(\sum n^{-s}\) that defines \(\zeta(s)\) converges for \(s&amp;gt;1\), that&amp;rsquo;s how Leonhard Euler found his product, and that&amp;rsquo;s what Peter Gustav Lejeune Dirichlet used to prove the prime number theorem in arithmetic progressions.</description>
    </item>
  </channel>
</rss>
