<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Newton on Understanding the Riemann Hypothesis</title>
    <link>https://riemannhypothesis.blog/tags/newton/</link>
    <description>Recent content in Newton 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>Sun, 06 Apr 2014 14:13:42 +0000</lastBuildDate>
    <atom:link href="https://riemannhypothesis.blog/tags/newton/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>From Zeta to J and Back (And Yet Again Back)</title>
      <link>https://riemannhypothesis.blog/2014/04/from-zeta-to-j-and-back-and-yet-again-back/</link>
      <pubDate>Sun, 06 Apr 2014 14:13:42 +0000</pubDate><author>markus@recommend.games (Markus Shepherd)</author>
      <guid>https://riemannhypothesis.blog/2014/04/from-zeta-to-j-and-back-and-yet-again-back/</guid>
      <description>We know a lot about the \(\zeta\) and \(\xi\)-functions, we&amp;rsquo;ve learnt all about the different prime counting functions, most notably \(J(x)\), so it&amp;rsquo;s high time we found a connection between the two. Probably not too surprisingly, the crucial link is our good friend, the Euler product&#xA;\[ \zeta(s)=\prod_{p}(1-p^{-s})^{-1}. \]&#xA;What we want to develop now is a version of this product that will suit us to find a formula that magically can count primes.</description>
    </item>
  </channel>
</rss>
