Related papers: Improved bounds for the two-point logarithmic Chow…

Let $E_i(H)$ denote the negative eigenvalues of the one-dimensional Schr\"odinger operator $Hu:=-u^{\prime\prime}-Vu,\ V\geq 0,$ on $L_2({\Bbb R})$. We prove the inequality \sum_i|E_i(H)|^\gamma\leq L_{\gamma,1}\int_{\Bbb R}…

Let $\Lambda$ be the von Mangoldt function and $r_{\textit{HL}}(n) = \sum_{m_1 + m_2^2 = n} \Lambda(m_1),$ be the counting function for the Hardy-Littlewood numbers. Let $N$ be a sufficiently large integer. We prove that…

We study sums of the shape $\sum_{n \leqslant x} f \left( \lfloor x/n \rfloor \right)$ where $f$ is either the von Mangoldt function or the Dirichlet-Piltz divisor functions. We improve previous estimates when $f = \Lambda$ and $f = \tau$,…

Let $R(n) = \sum_{a+b=n} \Lambda(a)\Lambda(b)$, where $\Lambda(\cdot)$ is the von Mangoldt function. The function $R(n)$ is often studied in connection with Goldbach's conjecture. On the Riemann hypothesis (RH) it is known that $\sum_{n\leq…

In 1984, G. Robin proved that the Riemann hypothesis is true if and only if the Robin inequality $\sigma(n)<e^\gamma n\log\log n$ holds for every integer $n>5040$, where $\sigma(n)$ is the sum of divisors function, and $\gamma$ is the…

We show the following bounds on the prime counting function $\pi(x)$ using principles from analytic number theory, giving an estimate: $$2 \log 2 \geq \limsup_{x \rightarrow \infty} \frac{\pi(x)}{x / \log x} \geq \liminf_{x \rightarrow…

By defining $$I_n:=\int_{0}^{1}\int_{0}^{1} \frac{(x(1-x)y(1-y))^n}{(1-xy)(-\log xy)}\ dx dy$$ Sondow (see [2]) proved that $$I_n=\binom{2n}{n} \gamma+L_n-A_n$$ We prove asymptotic formula for $L_n$ and $A_n$ as $n\to\infty$, $$…

We study the asymptotic expansion for the Landau constants $G_n$, \begin{equation*} \pi G_{n}\sim \ln(16N)+\gamma+\sum^{\infty}_{k=1}\frac{\alpha_k}{N^k} ~~\mbox{as} ~ n\rightarrow\infty, \end{equation*} where $N=n+1$, and $\gamma$ is…

Let $L(s,\pi)=\sum_{n=1}^{\infty}\lambda_{\pi}(n)n^{-s}$ be an $L$-function that satisfies a weak form of the generalized Ramanujan conjecture. We prove that large partial sums of $\lambda_{\pi}(n)$ strongly repel the low-lying zeros of…

Let b > 1 be an integer and denote by s_b(m) the sum of the digits of the positive integer m when is written in base b. We prove that s_b(n!) > C_b log n log log log n for each integer n > e, where C_b is a positive constant depending only…

The question of triviality of solutions of the semilinear Ornstein-Uhlenbeck equation, \[ \Delta w-\frac{1}{2} \langle x,\nabla w\rangle-\frac{\lambda}{p-1}w+|w|^{p-1}w=0, \] is considered. It is shown, that if $p>1$ is Sobolev subcritical…

The method of proof of Balog and Ruzsa and the large sieve of Linnik are used to investigate the behaviour of the $L^{1}$ norm of a wide class of exponential sums over the square-free integers and the primes. Further, a new proof of the…

For $k\geq 2$, we give a detailed exposition of the superior $k$-highly composite numbers. We then consider the function \[f_k(n)=\frac{\log d_k(n)\log\log n}{\log k\log n},\quad n\geq 3\] which has a maximum value $\lambda(k)$ at a…

We study the question of whether for each n there is another integer m with lambda(m)=lambda(n), where lambda is Carmichael's function. We give a "near" proof of the fact that this is the case unconditionally, and a complete conditional…

For $0\le k\le n$, write $\binom nk=uv$ where the primes dividing $u$ are at most $k$ and the primes dividing $v$ exceed $k$, and let $f(n)$ be the least $k$ with $u>n^2$; Erd\H{o}s problem 684 asks for bounds on $f(n)$. We resolve the…

It is proved that $$\left(\frac{x^n}{1-e^{-x}}\right)^{(n)}>0$$ for all $x\in (\log 2, \infty)$ and $n\in \mathbb{N}$, which improves the result of [Al-Musallam and Bustoz in Ramanujan J. 11 (2006) 399-402].

Let u(n) be the n-th term of a Lucas sequence or a Lehmer sequence.In this article we shall establish an estimate from below for the greatest prime factor of u(n) which is of the form nexp(logn/104loglogn). In so doing we are able to…

We give two new proofs of the Chaundy-Bullard formula $$ (1-x)^{n+1} \sum_{k=0}^m {n+k\choose k} x^k +x^{m+1}\sum_{k=0}^n {m+k\choose k} (1-x)^k=1 $$ and we prove the "twin formula" $$ \frac{ (1-x)^{(n+1)}}{(n+1)!} \sum_{k=0}^m…

Let $d(n)$ denote the number of divisors of a positive integer $n$. A classical problem in analytic number theory is given by the asymptotic behavior of the divisor sum $\sum_{n \leq x} \frac{1}{d(n)}$, with Ramanujan having introduced an…

We show that the largest prime factor of $n^2+1$ is infinitely often greater than $n^{1.279}$. This improves the result of de la Bret\`eche and Drappeau (2019) who obtained this with $1.2182$ in place of $1.279.$ The main new ingredients in…