Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
109 views

What is known about the average growth rate of the denominators of $n$ Egyptian fractions summing to one?

Motivation In the following question posted here on MO and over at MSE, user Noah Schweber asks about a weighted count on Egyptian fraction representations (EFRs). To that end, he defines the ...
Max Lonysa Muller's user avatar
0 votes
0 answers
257 views

Is it possible to bound Mertens function $M(n)$ from an inclusion-exclusion formulation?

In this post I proposed a formulation of Mertens function $M(n)$ using the inclusion-exclusion principle, as follows: $$M(n)=-\pi\left(n\right)+\left(\sum_{p_{i}<\sqrt{n}}\pi\left(\lfloor\frac{n}{...
Juan Moreno's user avatar
2 votes
0 answers
357 views

Mertens Bound and the Riemann Hypothesis

Let $M(x)$ denote the Mertens function ($M(x)=\sum_{i=1}^{x}\mu(i)$ where $\mu(i)$ is the Möbius function) and let $\Lambda(i)$ denote the Mangoldt function ($\Lambda(i)$ equals $\log(p)$ if $i=p^{m}$ ...
Sourangshu Ghosh's user avatar
8 votes
0 answers
271 views

Restricted divisor summatory function

I have a problem that boils down to prove that the succession $\{a_n\}$ tends to infinity, where $$a_n:=1+\sum_{0\leq j<n}D_{2j+1}(n-j)$$ and $D_{m}(n)$ is the number of divisors $d>1$ of $n$ ...
Nick Belane's user avatar
0 votes
0 answers
258 views

Lower bound of exponential sum

This question is a close cousin of the following: Lower bound on exponential sums Let $\phi:[0,1]\to \mathbb R$ be a smooth function with $\frac 1 {10}<\phi'< 10, \frac 1 {10}<\phi''< 10$. ...
Thomas Yang's user avatar
2 votes
0 answers
596 views

An interesting sequence of numbers arising from the Riemann hypothesis

A very good coincidence occurred today with me. While just plotting random functions in Mathematica, I entered this command: ...
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
0 votes
0 answers
232 views

What do square roots as minimums have to do with Harmonic numbers?

In an earlier question where I conjectured (and GH from MO confirmed) that the von Mangoldt function is the limit at s=1 of a certain Dirichlet series: $$\Lambda(m)=\lim_{s\to 1+}\zeta(s)\sum_{d\mid ...
Mats Granvik's user avatar
  • 1,183
7 votes
1 answer
339 views

lower bound for Perron-Frobenius degree of a Perron number

A Perron number is an algebraic number which is greater than one in absolute value and is greater than all of its Galois conjugates in absolute value as well. Lind's theorem states that any Perron ...
Mehdi Yazdi's user avatar
4 votes
1 answer
441 views

A lower bound on the $L^2$ norm of a Dirichlet polynomial

The Question. Suppose $0 < \alpha < \beta$ are fixed, and $a_n$ is an arbitrary sequence of real numbers. Is it known how to bound from below \begin{equation*} \int_0^{T} \Big| \sum_{\alpha T &...
Matt Young's user avatar
  • 4,661
3 votes
1 answer
860 views

Lower bounds on the error term of the prime number theorem

Are there any lower bounds on the error term for the prime number theorem, or in other words, is there a nontrivial $f$ s.t. $$f(x)\ll |\psi(x) - x|$$ where $\psi$ is the Chebyshev function.
Mayank Pandey's user avatar
8 votes
1 answer
605 views

lower and upper bound for $\sum_{k=1}^n \frac{(-1)^{\Omega(k)}}k$?

Are there known any lower and upper bounds for $$ \sum_{k=1}^n \frac{(-1)^{\Omega(k)}}k, $$ where $\Omega(n)$ is the number of prime factors counting multiplicities of $n$? Or at least is it known ...
asad's user avatar
  • 841
20 votes
1 answer
1k views

Quantitative lower bounds related to Zhang's theorem on bounded gaps

Let $\mathcal{H}=\left\{ h_{i}\right\} _{i=1}^{k}$ be an admissible set, and define $$\pi_{\mathcal{H}}(x)=\left|\left\{ n\leq x\ :\ \exists\ i,j\leq k,\ i\neq j\ \text{such that both }n+h_{i},\ n+h_{...
Eric Naslund's user avatar
  • 11.4k
7 votes
2 answers
3k views

Lower bound for Euler's totient for almost all integers

Let $\varphi(n)$ be the Euler's totient function. It is well know that $\liminf_{n \to \infty} \frac{\varphi(n)}{n / \log \log n} = e^{-\gamma}$, so that for $\varepsilon > 0$ it results $\frac{\...
user21706's user avatar
  • 285
12 votes
0 answers
815 views

Lower bounds for linear forms of logarithms (a la Baker)?

Let $\lambda_1$, $\lambda_2$, and $a$ be three fixed complex algebraic numbers. For a given integer $n$, write $\Theta(n) = \arg(a \lambda_1^n + \lambda_2^n)$. Assuming $\Theta(n)$ is not zero, I am ...
Joel Ouaknine's user avatar