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-numbers
Search options answers only
not deleted
user 1464
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.
12
votes
Accepted
Primes of the form a^2+1
Hi Franz,
Unfortunately I doubt this Euler product has very good behavior. If you believe the Hardy-Littlewood conjectures, then $\sum_{n\leq X}\Lambda(n^2+1) \sim cX$ where $c=\prod_{p>2}(1-\chi_{ …
- 13.1k
3
votes
Reference for the expected number of prime factors of n larger than n^alpha is -log alpha
I believe you can extract this from a paper of Andrew Granville, "Prime divisors are Poisson distributed". There is an electronic copy of this on his website.
- 13.1k
142
votes
Accepted
Is the Green-Tao theorem true for primes within a given arithmetic progression?
The Green-Tao is true for any subset of the primes of positive relative density; the primes in a fixed arithmetic progression to modulus $d$ have relative density $1/\phi(d)$.
- 13.1k
3
votes
Asymptotics for the number of ways to sum primes such that the sum is <= n
If $T(n)$ denotes the number of partitions of $n$ into sums of primes, then
$T(n) = \exp{((\frac{2\pi}{\sqrt{3}}+o(1))\sqrt{\frac{n}{\log{n}}})}$.
See e.g. page 260 of the AMS-Chelsea edition of …
- 13.1k