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 |
On the blending of real/complex analysis with number theory. The study involves distribution of prime numbers and other problems and helps giving asymptotic estimates to these.
5
votes
2
answers
794
views
Is the result of Schmidt conditional to RH
From this page:
https://en.wikipedia.org/wiki/Chebyshev_function#Asymptotics_and_bounds
A theorem due to Erhard Schmidt states that, for some explicit positive constant $K$, there are infinitely ma …
4
votes
1
answer
506
views
A weaker version of the Brocard's Conjecture
Brocard's conjecture states that: If $p_{k}$ and $p_{k+1}$ are consecutive prime numbers greater than $2$, then between $p_{k}²$ and $p_{k+1}²$ there are at least four prime numbers.
I know that is st …
2
votes
1
answer
132
views
Results relating prime numbers with extremely abundant numbers
A positive integer $n$ is extremely abundant if either $n=10080$, or $n>10080$ and
$$σ(n)/(n×log(log (n)))>σ(m)/(m×log(log (m)))$$
for all $10080≤m<n$. Here $σ(n)$ is the sum-of-divisors function a …
0
votes
0
answers
120
views
The strong twin conjecture can be transformed into the unsolvability of a particular Diophan...
Let us consider the strong twin conjecture:
For all positive integer $n$ there exist a prime $p$ such that
$$n+4<p<2^n2^4$$ and $p$ is a prime and $p+2$ is a prime
Since the inequalities and the set o …