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-number-theorem
Search options not deleted
user 21724
The Prime Number Theorem is a theorem that describes the distribution of the primes. It says that the number of primes less than or equal to a real number $x$ is asymptotic to $\frac{x}{\ln x}$.
2
votes
On a coprime generalization of Cramer's conjecture
I will answer a question slightly different from yours. Let $a(n)$ be the smallest integer $\geq n$ such that $a(n) = b c$ with $(b,c) = 1$ and $b \geq n^r$, $c \geq n^{1-r}$. Then :
$a(n) - n \geq …
- 7,249
5
votes
Ideas in the elementary proof of the prime number theorem (Selberg / Erdős)
Two very nice answers have already been given, but I would like to add that Michel Balazard has a book in preparation on this topic (written for undergrads), in which he tries to give a deduction of t …
- 7,249