Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with prime-gaps
Search options not deleted
user 122662
-4
votes
1
answer
228
views
A generalization Bertrand's postulate [closed]
Let $n, k$ are integers number such that $1<n \le k$, does always exist a prime number between $kn$ and $k(n+1)$?
When $n=1, k>1$ always exist a prime number between $k$ and $2k$ the question was pr …
- 1,776
6
votes
2
answers
1k
views
$\pi((n+1)^2)-\pi(n^2) \le \pi(n)$ for all $n \ge 370$?
There are some conjectures of the form: There always exist at least $X$ prime numbers between $A$ and $B$. Examples:
Bertrand's postulate: for every $n>1$ there is always at least one prime $p$ such …
- 1,776
4
votes
0
answers
334
views
The number of continuously increasing primes gaps in the interval $[2,n]$ is less than $\log n$
A prime gap is the difference between two successive prime numbers. The $n$-th prime gap, denoted $g_n$ or $g(p_n)$ is the difference between the $(n+1)$-st and the $n$-th prime numbers. Using my comp …
- 1,776