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 |
A field of mathematics studying numbers, their properties and structures that arise from them.
2
votes
2
answers
312
views
Simplest of the many proofs the prime harmonic series diverges
Over the history of mathematics, some key facts have had multiple and different proofs developed for them. Sometimes these different proofs provide a unique insight or understanding of those facts.
Fo …
1
vote
1
answer
113
views
What is the history of these prime counting function approximations?
I am reading several sources and there seems to be a lack of clarity, and some contradiction, about the origins of the most recognised prime counting function approximations:
$\pi(n) \sim \frac{n}{\ …
7
votes
2
answers
452
views
Who first identified $\frac{n}{\ln(n)}$ as an approximation of a prime counting function?
Gauss, in his 1849 letter to Encke, mentions that he noticed the primes have a density approx $\frac{1}{\ln(n)}$.
In that letter, he also mentions an integral function for approximating the prime co …
2
votes
0
answers
123
views
First motivation for extending Riemann Zeta to complex domain?
Euler developed the Euler Product Formula which shows that the Riemann zeta function encodes information about the prime.
$$\zeta(s)=\sum_{n}\frac{1}{n^{s}}=\prod_{p}(1-\frac{1}{p^{s}})^{-1}$$
Riemann …
2
votes
2
answers
167
views
Was Cramér the first to interpret the PNT's $1/\log(x)$ as probability of primes?
The Cramér probabilistic model of primes is built on the assumption that the probability of $n$ being prime is
$$\Pr(n)=\frac{1}{\log (n)}$$
This is not a big leap from the Prime Number Theorem which …
0
votes
0
answers
58
views
Any historical work on the distribution of prime gaps?
I am looking to see whether historic mathematicians did any work to explain the slightly unexpected distribution of prime gaps?
I would have expected Gauss, who studied lists of primes and proposed a …
3
votes
1
answer
280
views
When and where was Legendre's Conjecture first published?
When and where did Legendre first publish or write about his conjecture that there is a prime between consecutive square numbers?
$$n^2 < p < (n+1)^2$$
I have looked through edition 1 and 2 of his E …
1
vote
1
answer
157
views
Euler's proof of infinite primes first since Euclid?
Q. Is it true that Euler's proof of infinite primes was the first since Euclid's which was from around 300BC?
Note: By Euler's proof, I mean the use of his Euler product formula for the zeta function …