Related papers: Small values of signed harmonic sums

Let ${\bf X}=(X, \Sigma, m, \tau)$ be a dynamical system. We prove that the bilinear series $\sideset{}{'}\sum_{n=-N}^{N}\frac{f(\tau^nx)g(\tau^{-n}x)}{n}$ converges almost everywhere for each $f,g\in L^{\infty}(X).$ We also give a proof…

For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \Sigma) = \min \{f(S): S \text{is of length} n, \text{over alphabet} \Sigma \}$. Here, it is…

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…

Let $b > a > 0$. We prove the following asymptotic formula $$\sum_{n\ge 0} \big\lvert\{x/(n+a)\} - \{x/(n+b)\}\big\rvert = \frac{2}{\pi}\zeta(3/2)\sqrt{cx} + O(c^{2/9}x^{4/9}),$$ with $c=b-a$, uniformly for $x \ge 40 c^{-5}(1+b)^{27/2}$.

For given simple graphs $H_1,H_2,\dots,H_c$, the multicolor Ramsey number $R(H_1,H_2,\dots,H_c)$ is defined as the smallest positive integer $n$ such that for an arbitrary edge-decomposition $\{G_i\}^c_{i=1}$ of the complete graph $K_n$, at…

Let A= (a_{ij}) be a symmetric non-negative integer 2k x 2k matrix. A is homogeneous if a_{ij} + a_{kl}=a_{il} + a_{kj} for any choice of the four indexes. Let A be a homogeneous matrix and let F be a general form in C[x_1, \dots x_n] with…

We obtain asymptotic formulas with remainder terms for the hyperbolic summations $\sum_{mn\le x} f((m,n))$ and $\sum_{mn\le x} f([m,n])$, where $f$ belongs to certain classes of arithmetic functions, $(m,n)$ and $[m,n]$ denoting the gcd and…

Consider the equation $\mathcal{E}: x_1+ \cdots+x_{k-1} =x_{k}$ and let $k$ and $r$ be positive integers such that $r\mid k$. The number $S_{\mathfrak{z},2}(k;r)$ is defined to be the least positive integer $t$ such that for any 2-coloring…

For $\mu>0$ we study an asymptotic behavior of the sequence defined as $$T_{n}(\mu)=\frac{max_{1\leq m \leq {n^{\frac{1}{\mu}}}}\{\tau (n + m)\}}{\tau(n)},\ n=1,2,...$$ where $\tau(n)$ denotes the number of natural divisors of the given…

Let $\Omega(n)$ denote the number of prime factors of a positive integer $n$ counted with multiplicities. We show that for any bounded functions $a,b\colon\mathbb{N}\to\mathbb{C}$, $$\frac{1}{\log{N}}\sum_{n=1}^N…

The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…

The Euler-Maclaurin formula which relates a discrete sum with an integral, is generalised to the setting of Riemann-Stieltjes sums and integrals on stochastic processes whose paths are a.s. rectifiable, namely, continuous and with bounded…

An integer $n$ is called practical if every $m\le n$ can be written as a sum of distinct divisors of $n$. We show that the number of practical numbers below $x$ is asymptotic to $c x/\log x$, as conjectured by Margenstern. We also give an…

The harmonic numbers are the sequence 1, 1+1/2, 1+1/2+1/3, ... Their asymptotic difference from the sequence of the natural logarithm of the positive integers is Euler's constant gamma. We define a family of natural generalizations of the…

Let $H_n$ be the $n$-th harmonic number and let $v_n$ be its denominator. It is well known that $v_n$ is even for every integer $n\ge 2$. In this paper, we study the properties of $v_n$. One of our results is: the set of positive integers…

Let $p_{n}$ denote the $n$th prime and for any fixed positive integer $k$ and $X\geq 2$, put \[ G_{k}(X):=\max _{p _{n+k}\leq X} \min \{ p_{n+1}-p_{n}, \ldots , p_{n+k}-p_{n+k-1} \}. \] Ford, Maynard and Tao proved that there exists an…

A problem in zero-sum theory is to determine all pairs $(k,n)$ for which every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While all other cases have been solved more than a decade ago, the case when $k$ equals $4$ and…

Let $\mathcal{M}\subset B(\mathcal{H})$ be a semifinite von Neumann algebra, where $B(\mathcal{H})$ denotes the algebra of all bounded linear operators on a Hilbert space $\mathcal{H}$, and let $\tau$ be a fixed faithful normal semifinite…

Let $\tau(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $\tau(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.

Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…