2000 character limit reached
A New Strategy for Riemann Hypothesis
Published 5 Dec 2017 in math.NT | (1712.01519v3)
Abstract: A square-free integer is a positive integer that is not divisible by the square of any prime. Merten's function, $M(x)$ is defined as the difference between the number of square free integers with an even number of prime factors and the number of those with an odd number of prime factors up to $x$. It's well known that $M(x)=O(x{1/2+\epsilon})$ is equivalent to Riemann Hypothesis. In this paper, we derive a new equation involving Merten's function that leads to a promising technique for Riemann Hypothesis.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.