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 not deleted
user 26522
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
Why could Mertens not prove the prime number theorem?
Because the scale is too small in Mertens's theorem, and the prime number theorem as well as the Riemann hypothesis are hidden by the $O(1/\log{X})$ notation.
Indeed, the former amounts to strengthen …
- 13.8k
15
votes
1
answer
898
views
Does Littlewood's bound on $\zeta(1+it)$ extend to all the partial sums?
Littlewood established that $2e^{\gamma} \geq \limsup_{t \to \infty} |\zeta(1+it)| / \log{\log{t}} \geq e^{\gamma}$, the lower bound unconditionally and the upper bound on RH. It now seems to be gener …
- 43.7k
11
votes
About the prime divisors of values of polynomials
Assume without loss of generality that $P$ is irreducible, and denote by $S_P(X)$ the set of primes $p < X$ that divide some value $P(n)$. Let $G$ be the Galois group of $P$ and $n_1 > 0$ the number o …
CommunityBot
- 1