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 |
Questions where prime numbers play a key-role, such as: questions on the distribution of prime numbers (twin primes, gaps between primes, Hardy–Littlewood conjectures, etc); questions on prime numbers with special properties (Wieferich prime, Wolstenholme prime, etc.). This tag is often used as a specialized tag in combination with the top-level tag nt.number-theory and (if applicable) analytic-number-theory.
6
votes
0
answers
505
views
Prime gap counts in short intervals
Since it is conjectured that the twin prime count at $n\sim2 C_2\ \frac{n}{\log^2n},$ where $C_2 = \prod_{p\ge 3} \frac{p(p-2)}{(p-1)^2} = 0.66016 18158 \dots,$ it follows that the twin prime count fo …
4
votes
2
answers
392
views
Unfamiliar prime-generating polynomials related to Heegner numbers
I just stumbled on a set of prime-generating polynomials of the form $$9 n^2-3 H n+H (H+1)/4$$ (where $H$ is a Heegner number $>11$), which generate the same number of distinct primes as their more fa …
2
votes
Asymptotic density of k-almost primes
As not necessarily proven results were asked for, I have found the following quite accurate:
$$N_k(x):=\ \mid\{n\leq x : \Omega(n)=k\}\mid \ \sim \Re\bigg(\frac{2^{1-k}\alpha e^{1+e}x\log(1+e+\log(2^ …
16
votes
1
answer
998
views
Tight prime bounds
This is a cross-post of this question on MSE. I would not usually do this, but have decided to in this case since it has had no responses having been posted as a bounty question. I did not delete the …
4
votes
1
answer
557
views
Goldbach for certain classes of $n$
Asked on MSE without response here.
$\#$ of ways even $n$ can be represented by prime additions is hereafter denoted $G(n)$.
The Wiki article on the Goldbach conjecture states that
In 1975, Hugh Mont …