Skip to main content
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
Search options questions only not deleted user 398

On the blending of real/complex analysis with number theory. The study involves distribution of prime numbers and other problems and helps giving asymptotic estimates to these.

6 votes
0 answers
264 views

Best explicit bound on $\zeta'(1+it)/\zeta(1+it)$

Assume the Riemann hypothesis. We know that $$\left|\frac{\zeta'(1+it)}{\zeta(1+it)}\right| \leq 2 \log \log t + O(1)$$ (see, e.g., Thm. 13.13 in Montgomery-Vaughan). What is the best explicit bound o …
H A Helfgott's user avatar
  • 20.2k
2 votes
0 answers
191 views

A not-quadratic sieve? (Or: Selberg and the like, without a square)

Let $\mu$ be the Möbius function. Let $$\lambda_d = \begin{cases} \frac{\log D/d}{\log D} \mu(d)&\text{for $d\leq D$,}\\ 0 &\text{otherwise.}\end{cases}$$ (Selberg's weights also work.) Then it is wel …
H A Helfgott's user avatar
  • 20.2k
4 votes
1 answer
573 views

$\sum_{d\leq x} (\mu(d)/d) \log x/d$: elementary estimates?

Let $$F(x) = \sum_{d\leq x} \frac{\mu(d)}{d} \log \frac{x}{d}.$$ s it possible/feasible to give an elementary proof of the fact that $F(x)= 1 + o(1)$ (and, ideally, $1+O(1/\log x)$, or better)? By " …
H A Helfgott's user avatar
  • 20.2k
14 votes
1 answer
727 views

Is the asymptotic for $\sum_n (\mu(n)/\sigma(n)) \log(x/n)$ also an upper bound?

For $x\geq 1$, $$\rho(x) = \sum_{n\leq x} \frac{\mu(n)}{\sigma(n)} \log \frac{x}{n}.$$ As $x\to\infty$, this sum tends to $\zeta(2) = \pi^2/6$. Is it in fact the case that $\rho(x)\leq \zeta(2)$ for …
H A Helfgott's user avatar
  • 20.2k
11 votes
0 answers
239 views

Sums of $\Lambda(n)$ or $\mu(n)$ with hyperbolic-function weights: surprise!

I was leafing through Gradshteyn–Ryzhik in bed yesterday, as one does, and noticed on the last page that the Mellin transforms of several hyperbolic functions have a factor of $\zeta(s-1)$ or $\zeta(s …
H A Helfgott's user avatar
  • 20.2k
8 votes
0 answers
138 views

Fourier transform of $I_Y$, $Y=\{\text{numbers with many prime factors}\}$

Let $Y$ be the set of integers $N<n\leq 2 N$ with more than $D \log \log N$ prime factors. We may consider, say, $D = (\log \log N)^{1-\epsilon}$. We do have rather precise approximations for the siz …
H A Helfgott's user avatar
  • 20.2k
4 votes
1 answer
305 views

Effective, explicit bound on $L'(1,\chi)/L(1,\chi)$

Are there effective, explicit upper bounds on $L'(1,\chi)/L(1,\chi)$ in the literature, valid for all Dirichlet characters $\chi$? Due to the possibility of Siegel zeros, I don't imagine one can do mu …
H A Helfgott's user avatar
  • 20.2k
7 votes
0 answers
171 views

Fully explicit version of Atkinson's formula?

Let $$I(T)=\int_0^T \left|\zeta\left(\frac{1}{2} + i t\right)\right|^2 dt$$ and let $E(T)$ be $I(T)$ minus what turn out to be its main terms: $$E(T) = I(T)- T \log \frac{T}{2 \pi} - (2 \gamma - 1) T. …
H A Helfgott's user avatar
  • 20.2k
8 votes
0 answers
639 views

Divisor problem: find the fallacy!

The following approach to the divisor problem (that is, the problem of estimating $D(x) = \sum_{n\leq x} d(n)$, where $d(n)$ is the number of divisors of $n$; more precisely, we are meant to bound the …
H A Helfgott's user avatar
  • 20.2k
11 votes
1 answer
499 views

Second moment estimates for $\zeta(s)$: different methods?

What are some different ways to achieve the bound $$\int_0^T \left|\zeta\left(\frac{1}{2} + i t\right)\right|^2 dt = T \log \frac{T}{2 \pi} + (2 \gamma - 1) T + E(T)$$ with an error term $E(T) = O(T^{ …
H A Helfgott's user avatar
  • 20.2k
13 votes
1 answer
382 views

Numbers that don't start with (p-1) in base p for any p

Say that an integer $n$ is $p$-leading if its expansion in base $p$ starts with the digit $p-1$. My postdoc, Lifan Guan, asks: are there infinitely many positive integers $n$ that are not $p$-leading …
H A Helfgott's user avatar
  • 20.2k
9 votes
0 answers
246 views

Exponential sums over integers with a fixed number of prime divisors

Are there bounds in the literature on sums of the form $$\sum_{\omega(n)= k} e(\alpha n) \;\;\;\;\;\text{or}\;\;\;\;\; \sum_{\Omega(n)=k} e(\alpha n)$$ for $\alpha$ on minor arcs (i.e., not very close …
H A Helfgott's user avatar
  • 20.2k
20 votes
4 answers
1k views

Bound on $L^2$ norm of $1/\zeta(1+i t)$?

What sort of bounds (explicit of preference) can one give for $$\int_T^{2 T} \frac{dt}{|\zeta(1+i t)|^2} \;\;\;\;\;?$$ Some obvious points: One can give a pointwise bound $\frac{1}{|\zeta(1+ it)|} \l …
H A Helfgott's user avatar
  • 20.2k
6 votes
2 answers
383 views

Square-free numbers in an interval

Is there an explicit estimate in the literature bounding from above the number of square-free numbers in a short interval $x<n\leq x y$? I can easily do this by means of the Selberg sieve, but I do no …
H A Helfgott's user avatar
  • 20.2k
2 votes
0 answers
196 views

Sums of reciprocals of primes in an arithmetic progression

Let $y>x\geq 1$, $p_0\geq x$. Consider $$S=\mathop{\sum_{x\leq p\leq y}}_{p\equiv a \mod p_0} \frac{1}{p}.$$By Brun-Titchmarsh and (basically) integration by parts, I seem to get that $$S \leq \frac{1 …
H A Helfgott's user avatar
  • 20.2k

1
2 3 4 5 6
15 30 50 per page