Skip to main content

All Questions

4 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
6 votes
0 answers
333 views

Explicit bounds for the Mertens function

It is a consequence of some forms of the prime number theorem that with $\mu$ the Möbius function, for all $A > 0$, there exists $c_A$ such that for all sufficiently large $x$, $$\frac{1}{x}\sum_{n\...
Mayank Pandey's user avatar
5 votes
0 answers
193 views

Asymptotic expansion for the average of $\omega(n)^2$

Let $\omega(n)$ be the prime factors counting function. I computed that for any $k\geq 0$, there exist certain constants $c_{-1},c_0,c_1,c_2,...c_k$ such that $$\sum_{n\leq x}\omega(n)^2=x(\log\log x)...
The Number Theorist's user avatar
1 vote
0 answers
176 views

R.H. equivalent statement condition

Is the inequality $\prod \limits_{p \leq \sqrt{x}} (1+\frac{1}{p^2-1}) \prod \limits_{p \leq x} (1+\frac{1}{p}) \leq e^\gamma \ln(\theta(\sqrt{x})+\theta(x))$ where $\theta(x)$ is the Chebyshev's ...
user avatar
0 votes
0 answers
114 views

The best error term for the second moment

Let $r_2(n)$ be the number of representations of a positive integer $n$ as a sum of two prime squares, i.e. $n=p^2+q^2$. Consider $S_1(x)= \sum_{n \le x} r_2(n)$ and $S_2(x) = \sum_{n \le x}r_2^2(n)$. ...
RunForrest's user avatar