13
votes
1answer
1k views
What, exactly, has Louis de Branges proved about the Riemann Hypothesis? [closed]
Hi,
I know this is a dangerous topic which could attract many cranks and nutters, but:
According to Wikipedia [and probably his own website, but I have a hard time seeing exactly …
0
votes
3answers
148 views
complete estimates of the error for a well-known asymptotic expression of partition p(n,m)
Let $p(n,m)$ be the number of partitions of an integer $n$
into integers $\le m$, we have a well-known asymptotic expression:
For a fixed $m$ and $n\to\infty$,
$$p(n,m)=\frac{n^ …
10
votes
4answers
916 views
Complex and Elementary Proofs in Number Theory
The Prime Number Theorem was originally proved using methods in complex analysis. Erdos and Selberg gave an elementary proof of the Prime Number Theorem. Here, "elementary" means …
15
votes
10answers
2k views
Approaches to Riemann hypothesis using methods outside number theory
Background: Once an analytic number theorist remarked to me that all attempts to prove the Riemann hypothesis using number theoretic methods have failed. Since then that remark stu …
9
votes
4answers
590 views
Does Weyl’s Inequality prove equidistribution?
Let $f(n) = \theta n^d + a_{d-1} n^{d-1} + \cdots a_1 n + a_0$ be a polynomial with real coefficients, and $\theta$ irrational. Let $S_N = \sum_{n=1}^N e^{2 \pi i f(n)}$. Weyl's Eq …
2
votes
1answer
171 views
What does the probabilistic model suggest the error term in the PNT should be?
Let $\Lambda(n)$ be the von Mangoldt function. The prime number theorem is equivalent to the statement that $\sum_{n \leq N} \Lambda(n) \approx N$. Defining $\lambda_{*}(n)= \Lambd …
6
votes
5answers
354 views
The Wiener-Ikehara approach to the PNT
Was providing an alternative proof of the PNT one of the main impulses that led to the discovery of the tauberian theorem of Wiener and Ikehara or the other way around?
In any cas …
6
votes
2answers
522 views
What is the best known upper bound for the number of twin primes?
A quantitative form of the twin prime conjecture asserts that the the number of twin primes less than $n$ is asymptotically equal to $2\, C\, n/ \ln^2(n)$ where $C$ is the so-calle …
24
votes
6answers
1k views
How does one use the Poisson summation formula?
While reading the answer to another Mathoverflow question, which mentioned the Poisson summation formula, I felt a question of my own coming on. This is something I've wanted to kn …
17
votes
12answers
1k views
Shortest/Most elegant proof for $L(1,\chi)\neq 0$
Let $\chi$ be a Dirichlet character and $L(1,\chi)$ the associated L-function evaluated at $s=1$. What would be the 'shortest' proof of the non-vanishing of $L(1,\chi)$?
Backgroun …
9
votes
1answer
220 views
The Riemann zeta function and Haar measure on the profinite integers
In an answer to a question on MU about the Riemann zeta function, I sketched a proof that the probability distribution on $\mathbb{N}$ which assigns $n$ the probability
$$\frac{ \ …
-1
votes
2answers
187 views
Dirichlet’s Divisor Function
We know that by Dirichlet's formula for the Divisor function $ \displaystyle \sum\limits_{n \leq x} d(n) = x \log{x} + (2C-1)x + \mathcal{O}(\sqrt{x})$.
What is the best approxim …
8
votes
1answer
316 views
Heuristic reason for Polya’s conjecture
Let $\lambda(n)$ be Liouville's function, so that for each positive integer $n = p_1^{m_1}\cdots p_r^{m_r}$, we have that $\lambda(n) = (-1)^{\sum^{r}_{k=1}{m_k}}$. In 1919, Polya …
2
votes
1answer
156 views
Distribution of quadratic residues of a fixed number without using Dedekind zeta function
Let $n > 1$ be a square-free natural number, which is fixed. The assertion to be proved is the following:
Let $p$ run through primes. Then, $$\left( \frac{n}{p} \right)$$ is eq …
47
votes
5answers
2k views
If 2^x and 3^x are integers, must x be as well?
I'm fascinated by this open problem (if it is indeed still that) and every few years I try to check up on its status. Some background: Let $x$ be a positive real number.
If $n^x$ …

