https://riemannhypothesis.blog/tags/logarithm/ Recent content in Logarithm on Understanding the Riemann Hypothesis Hugo -- gohugo.io en markus@recommend.games (Markus Shepherd) markus@recommend.games (Markus Shepherd) Sun, 02 Nov 2014 12:06:30 +0000 https://riemannhypothesis.blog/2014/11/how-not-to-earn-a-million-dollars/ Sun, 02 Nov 2014 12:06:30 +0000markus@recommend.games (Markus Shepherd) https://riemannhypothesis.blog/2014/11/how-not-to-earn-a-million-dollars/ I recently spent some time on the formidable website Numberphile which explains mathematical ideas, some important, some recreational, in short and accessible videos. Definitely worth checking out. One of the videos that is most relevant to us explains the Riemann Hypothesis: As mentioned before, it’s not easy to explain the details and the beauty of the Riemann Hypothesis in few words, but I think the video definitely succeeds in compressing the essentials into 17 minutes. https://riemannhypothesis.blog/2014/04/from-zeta-to-j-and-back-and-yet-again-back/ Sun, 06 Apr 2014 14:13:42 +0000markus@recommend.games (Markus Shepherd) https://riemannhypothesis.blog/2014/04/from-zeta-to-j-and-back-and-yet-again-back/ We know a lot about the \(\zeta\) and \(\xi\)-functions, we’ve learnt all about the different prime counting functions, most notably \(J(x)\), so it’s high time we found a connection between the two. Probably not too surprisingly, the crucial link is our good friend, the Euler product \[ \zeta(s)=\prod_{p}(1-p^{-s})^{-1}. \] 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.