Skip to main content

All Questions

Filter by
Sorted by
Tagged with
10 votes
0 answers
350 views

Are there are any attempts utilising sieve theory to attack the general $a p \pm 1$ problem?

It is currently an open question if there are infinitely many primes $p$ such that $2p + 1$ is prime (Sophie Germain primes) or that at least one of $24p \pm 1$ is prime. Could Zhang's method, or the ...
KStar's user avatar
  • 533
5 votes
0 answers
326 views

Counting primes, twin primes, cousin primes: unusual approach, connection to some conjectures

I am investigating the following sieve-like algorithm. Let $S_N=\{1,\dots,N\}$. For all primes $p$ with $p_0\leq p \leq M$, we remove from $S_N$ the following elements: all numbers $n\in S_N$ such ...
Vincent Granville's user avatar
3 votes
0 answers
76 views

Divisor of given order in short intervals

Is the following Open question or Conjecture already known, or eventually settled ? Open question : For sufficiently large $x$ there is at least a positive integer in the interval $[x,x+\log^2(x)]$ ...
G. Melfi's user avatar
  • 433
0 votes
1 answer
222 views

Trying to understand last part of the proof of normalized prime gap

We know that $$\liminf_{n\to\infty}{\frac{p_{n+1}-p_n}{\log p_n}}=0.$$ I'm trying to figure out the proof and I have read a lot of documents, I asked a question here. Still I can't see what's going on....
Arda Yonet's user avatar