Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
401 views

Probability of finding a prime number between $x-\ln(x)$ and $x+\ln(x)$

Using my computer, I found that in the interval $[1, N]$ the probability of finding a prime number between $x-\ln(x)$ and $x+\ln(x)$ is greater than constant $c$ where $N=10^2, 10^3,...,10^{9}$, $x$ ...
2 votes
1 answer
159 views

Is the density of integers $n$ such that the finite sequence $(\omega(n-r)\omega(n+r))_{0\leq r\leq n-1}$ is surjective positive?

Let $\omega(m)$ be the number of prime factors of $m$ regardless of multiplicity. I'm interested in the behavior of the finite sequence $(\omega(n-r)\omega(n+r))_{0\leq r\leq n-1}$ for a given integer ...
5 votes
0 answers
614 views

is there a link with the probabilistic model for prime numbers?

Let $x \in \mathbb{R}_+$ and $k \in \mathbb{N}^{*}$. Let : $$\mathcal{A}(x)=\#\{(a_1, a_2, \ldots, a_k) \in \mathbb{P}^k \mid (a_1, a_2, \ldots, a_k \text{ verifying some properties}) \, , a_k \...
6 votes
1 answer
481 views

Probabilistic Proofs of Key Number-Theoretic Results

Given a positive integer $n$, let $p$ be the largest prime less than or equal to $n$. Let $N(n)=2^{C_2}\cdots p^{C_p}$ be uniformly distributed from $1$ to $n$, and $M(n)=2^{Z_2}\cdots p^{Z_p}$ where ...
4 votes
2 answers
577 views

What does the probabilistic model suggest the error term in the PNT should be?

Let $\Lambda(n)$ be the von Mangoldt function. The prime number theorem is equivalent to the statement that $\sum_{n \leq N} \Lambda(n) \approx N$. Defining $\lambda_{*}(n)= \Lambda(n)-1$ we may ...
9 votes
6 answers
3k views

Primes are pseudorandom?

I've been reading the wonderful slides by Terry Tao and thought about this question. Primes appear to be quite random, and the formal statement should be that there are some characteristics of primes ...