# Tagged Questions

94 views

### Asymptotics and error terms for an arithmetic function built upon $\omega$ and $\Omega$ functions

For any real number $x$, let's define $Om_{k}(x)$ as the number of positive integers $m$ below $x$ such that $\Omega(m)-\omega(m)=k$, where $\omega(n)$ is the number of distinct primes dividing $n$, ...
328 views

### Is SOC known to imply the Grand Riemann Hypothesis? [closed]

I'm currently working on a conditional proof of the Grand Riemann Hypothesis, which is based on the assumption that every field automorphism of $\mathbb{C}$ that commutes with an element of the ...
686 views

### How strong is this conjecture? $(Z/nZ)^*$ is generated by “small” elements

Conjecture: There are constants $c,k$ such that every $(Z/nZ)^*$ is generated by its elements smaller than $k (\log n)^c$. Where $(Z/nZ)^*$ is the multiplicative group of integers mod $n$. My ...
102 views

233 views

909 views

### On Robin's criterion for RH [closed]

$$\sigma(n) < e^\gamma n \log \log n$$ In 1984 Guy Robin proved that the inequality is true for all n ≥ 5,041 if and only if the Riemann hypothesis is true (Robin ...
392 views

### using distribution of primes to generate random bits?

In his popular science book The Music of the Primes, Marcus du Sautoy tries to link the truth of the Riemann Hypothesis to the "randomness" of the primes. To do this, he invokes the idea of a "fair ...
1k views

### Given an integer polynomial, is there a small prime modulo which it has a root?

I am looking at a paper by Pascal Koiran on the computational complexity of certifying the solvability of integer polynomial equations in several variables. With the aid of some important theorems in ...