Skip to main content

All Questions

Filter by
Sorted by
Tagged with
22 votes
3 answers
2k views

Hecke equidistribution

For a prime $p\equiv 1\pmod{4}$, we can write $p=a^2+b^2=N(a+bi)$. Therefore $$ a+bi=p^{1/2}e^{i\varphi} $$ where $\varphi\in [0,2\pi]$. I know that Hecke proved that $\varphi$ is equidistributed. I ...
M.B's user avatar
  • 2,508
7 votes
1 answer
443 views

Density of numbers whose prime factors belong to given arithmetic progressions

By a theorem of Landau, the number of integers $n\leq x$ whose prime divisors belong to only arithmetic progressions $a_1,\dots,a_r$ mod $q$, with $r\leq\varphi(q)$ and $a_i$ coprime to $q$ for each $...
Tian An's user avatar
  • 3,799
16 votes
1 answer
4k views

Order of magnitude of $\sum \frac{1}{\log{p}}$

Question: What is the order of magnitude of the following sum? $$ \sum_{\substack{p<n\\\text{$p$ prime}}} \frac{1}{\log{p}} $$ Additional information: Since $$ \sum_{\substack{p<n\\\text{...
Daniel Soltész's user avatar
15 votes
5 answers
2k views

Zeros of the derivative of Riemann's $\xi$-function

The Riemann xi function $\xi(s)$ is defined as $$ \xi(s)=\frac12 s(s-1)\pi^{-s/2}\Gamma(s/2)\zeta(s). $$ It is an entire function whose zeros are precisely those of $\zeta(s)$. Since $\xi$ is real ...
Stopple's user avatar
  • 11.1k
11 votes
1 answer
1k views

The Bombieri Vinogradov Theorem restricted to moduli divisible by $k$

The Bombieri-Vinogradov Theorem states that given $A>0$, there exists $B>0$ such that for $Q=\sqrt{x}\left(\log x\right)^{-B},$ we have $$\sum_{q\leq Q}\max_{y\leq x}\max_{\begin{array}{c} a\...
Eric Naslund's user avatar
  • 11.4k
7 votes
3 answers
826 views

Analytic equivalents for primes in arithmetic progressions

By way of context: it is known that the prime number theorem $\pi(x) \sim x/\log x$ is (nontrivially) equivalent to the statement that $\zeta(s)$ does not vanish on the line $\Re s=1$. I would like ...
Greg Martin's user avatar
  • 12.8k
7 votes
1 answer
1k views

What would be the consequences of $\displaystyle{\lim\inf_{n\to\infty}p_{n+k}-p_{n}\sim k\log k}$?

The question is in the title: what would be the number theoretic consequences if we managed to establish the conjectured asymptotic equality $\displaystyle{\lim\inf_{n\to\infty}p_{n+k}-p_{n}\sim k\log ...
Sylvain JULIEN's user avatar
5 votes
1 answer
434 views

consecutive prime gaps and explicit bound

I am aware of the theorem that $p_{n+1}- p_n \leq n^{0.525}$ which is true for all sufficiently large numbers due to Baker, but if i want to make the implicit "for all sufficiently large numbers" ...
user avatar
5 votes
0 answers
1k views

Differential Galois number theory

Following https://math.stackexchange.com/questions/635659/can-the-error-term-involved-in-the-pnt-be-expressed-in-a-galois-theoretic-framew?noredirect=1#comment1341143_635659, I vainly tried to find ...
Sylvain JULIEN's user avatar
43 votes
3 answers
3k views

Is this integral representation of $\zeta(2n+1)$ known?

Background: I'm an undergraduate at an institution with no researchers in analytic number theory, and no ties to the analytic number theory community. I believe I have found what is, as far as I can ...
Andrew Knapp's user avatar
29 votes
5 answers
5k views

Partial sums of multiplicative functions

It is well known that some statements about partial sums of multiplicative functions are extremely hard. For example, the Riemann hypothesis is equivalent to the assertion that $|\mu(1)+\mu(2)+\dots+\...
gowers's user avatar
  • 29k
21 votes
2 answers
1k views

Most squares in the first half-interval

It is well known that if $p$ is an odd prime, exactly one half of the numbers $1, \dots, p-1$ are squares in $\mathbb{F}_p$. What is less obvious is that among these $(p-1)/2$ squares, at least one ...
Andrea Ferretti's user avatar
16 votes
1 answer
1k views

On (a generalization of) the Gauss Circle Problem

Most (if not all) references I read about the Gauss Circle Problem that proves a bound below $O(R^{2/3})$ reduces the GCP to the Dirichlet Divisor Problem by the well known expression of $r_2(n)$, the ...
Fan Zheng's user avatar
  • 5,169
16 votes
1 answer
705 views

Connection between Bernoulli numbers and Riemann-Siegel theta function?

I have come across a strange approximation for the Riemann-Siegel theta function involving the Bernoulli numbers - namely that $$\frac{1}{2} \log \left| B_{2 n}\right|\approx \vartheta (2n)\ ,\quad n ...
martin's user avatar
  • 1,903
14 votes
4 answers
3k views

Jacobi's theorem on sums of two squares (reference request)

One of Jacobi's theorems states that the number of representations of a positive integer $n$ as a sum of two squares of integers equals $$4(d_1(n)-d_3(n)),$$ where the function $d_i$ counts the number ...
Dr. Pi's user avatar
  • 3,062
8 votes
1 answer
811 views

Primes of the form $x^2 + y^2 + 1$

There are infinitely many primes of the form $x^2+y^2+1$, as proved by Bredihin. Motohashi improved the result by showing that there were $\gg x/\log^2 x$ such primes up to $x$. But we expect $\Theta(...
Charles's user avatar
  • 9,114
8 votes
1 answer
1k views

Quick reference for general Weyl's inequality in number theory

I would like a reference for the result here. Having that $t$ there makes me happy. I would prefer not to have to, in my paper, run through and (not trivially but not too greatly) alter the proof of ...
mathworker21's user avatar
  • 1,355
8 votes
1 answer
464 views

Smooth numbers in short intervals

Let $\psi(x,y)$ be the number of positive integers up to $x$ which are $y$-smooth, that is, integers whose prime factors are at most of size $y$. There has been, for a few decades now, a lot of ...
Ofir Gorodetsky's user avatar
8 votes
2 answers
1k views

Lower bound on exponential sums

Let $k\geq 2$. Consider the following norm of exponenetial sum: $$ I(N,p,k)=\int_0^1\int_0^1 \left|\sum_{n=0}^N e^{2\pi i (n x+n^k y)}\right|^p dxdy. $$ Bourgain mentioned on Page 118 of https://...
Thomas Yang's user avatar
7 votes
2 answers
1k views

Is there a von Koch-type theorem for the generalized Riemann hypothesis?

Helge von Koch proved in 1901 that the Riemann hypothesis is equivalent to the error term in the prime number theorem having the bound $$ \mid\pi(x)-\textrm{li}(x)\mid=O(\sqrt{x} \log x). $$ Q1: ...
user45947's user avatar
  • 965
7 votes
2 answers
906 views

Positivity of the coefficients of Taylor series associated to the Riemann hypothesis

The question below relates to the paper "Jensen Polynomials for the Riemann Zeta Function and Other Sequences" of Griffin, Ono, Rolen and Zagier. I'm asking it here because I am sure the ...
Jon Bannon's user avatar
  • 7,057
7 votes
0 answers
786 views

"Forthcoming paper" of Goldston-Graham-Pintz-Yıldırım

The above-named authors of [1] and its (significantly different) published version [2] write: In a forthcoming paper, we will show how the methods here can be extended to prove corresponding ...
Charles's user avatar
  • 9,114
7 votes
1 answer
249 views

When is $\vartheta(x)>x$? [Skewes number analog]

Let $\vartheta(x)=\sum_{p\le x}\log p$. What is known about the first time $\vartheta(x)>x?$ Bays & Hudson give good upper bounds (slightly improved by Chao & Plymen) on the first crossing ...
Charles's user avatar
  • 9,114
6 votes
0 answers
149 views

Dickson's conjecture for Beatty sequences

A particular case of Dickson's Conjecture states that for $a_1,q_1,a_2,q_2$ with $(a_1,q_1)=(a_2,q_2)=1$, there are infinitely many $n$ for which $q_1 n + a_1$ and $q_2 n+a_2$ are both prime, provided ...
Joshua Stucky's user avatar
6 votes
1 answer
714 views

Best estimate of the Mertens function without assuming the Riemann Hypothesis

I'm searching the best known upper bound for the Mertens function, but without assuming the Riemann hypothesis. Landau, in 1901, have proved that $M(x)= O(x \exp(-c\sqrt{\ln x})$, but I am unable to ...
Claudeh5's user avatar
  • 173
5 votes
2 answers
941 views

$B(\chi), L'(1,\chi)/L(1,\chi),\dotsc$

Let $\chi$ be a primitive Dirichlet character of modulus $q>1$. Write, as is customary, $B(\chi)$ for the constant in the expression $$\frac{\Lambda'(s,\chi)}{\Lambda(s,\chi)} = B(\chi) + \sum_\rho ...
H A Helfgott's user avatar
  • 20.2k
5 votes
3 answers
809 views

Positive proportion of logarithmic gaps between consecutive primes

For $x, \lambda > 0$, define $$S_\lambda(x) := \#\{p_{n+1} \leq x : p_{n+1} - p_n \geq \lambda \log x\} ,$$ where $p_n$ is the $n$th prime number. It is known [1] that an uniform version of the ...
Kello's user avatar
  • 113
5 votes
2 answers
1k views

Error term in Mertens' third theorem

Mertens' third theorem states that: $$\prod_{\substack{ p \leq x \\ \text{p prime} }} \left( 1 - \dfrac{1}{p} \right) \sim \dfrac{e^{-\gamma}}{\log(x)}$$ Question: what is the best functions (...
Lagrida Yassine's user avatar
5 votes
1 answer
455 views

Large gaps between P2s

Gaps between consecutive primes are $O(n^{\theta+\varepsilon})$ for $\theta=0.525$ and any $\varepsilon>0.$ I was wondering if a better result is known for gaps between numbers with at most two ...
Charles's user avatar
  • 9,114
4 votes
1 answer
629 views

Is $\sum_{n\leq x}{z^{\Omega(n)}} = O(x^{\frac12 + \varepsilon})$ equivalent to the Riemann hypothesis for all roots of unity $z\neq1$?

$\Omega(n)$ is the number of prime divisors of $n$, counted with multiplicity. For $z=-1$, $z^{\Omega(n)} = \lambda(n)$ is the Liouville function, and it's known that $\sum_{n\leq x}\lambda(n) = O(n^{\...
Daniel Weber's user avatar
  • 3,319
4 votes
1 answer
523 views

Siegel-Walfisz Theorem with smooth weights

Let $$\psi(x;q,a)=\sum_{n\leq x\atop n\equiv a\pmod q}\Lambda(n)$$ where $\Lambda$ denotes the von Mangoldt function and $\phi$ to be Euler's totient function. Then the Siegel-Wafisz theorem states ...
Johnny T.'s user avatar
  • 3,625
4 votes
1 answer
545 views

class number of biquadratic fields

Can any one provide some references which treat the relation between the class number of a biquadratic field and the class numbers of its sub-fields using the analytic class number formula ?
Zakariae.B's user avatar
3 votes
1 answer
480 views

Reference for explicit formula for $\sum_n \Lambda(n) \chi(n)$ with smooth weights

Let $\Lambda$ be the von Mangoldt function and $\chi$ a primitive character mod $q$, then we have the explicit formula $$ \sum_{n \leq X} \Lambda(n) \chi(n) = \delta_{\chi} X - \sum_{ |Im \ \rho| \leq ...
Johnny T.'s user avatar
  • 3,625
1 vote
1 answer
222 views

Sum over three squares

Let $x$ be a sufficiently large number. Is there an explicit or asymptotic formula for the following sum $$\sum_{\substack{n\leq x\\ n=a^2+b^2+c^2}} 1.$$ Any reference would be helpful.
Khadija Mbarki's user avatar