Related papers: On correlations of certain multiplicative function…

Given an integer $n \ge 2$, its prime factorization is expressed as $n= \prod_{i=1}^s p_i^{a_i}$. We define the function $f(n)$ as the smallest positive integer such that $f(n)!$ is divisible by $n$. The main objective of this paper is to…

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

We prove that analogues of the Hardy-Littlewood generalised twin prime conjecture for almost primes hold on average. Our main theorem establishes an asymptotic formula for the number of integers $n=p_1p_2 \leq X$ such that $n+h$ is a…

We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower…

For two arithmetical functions $f$ and $g$ with absolutely convergent Ramanujan expansions, Murty and Saha have recently derived asymptotic formulas with error term for the convolution sum $\sum_{n \le N} f(n) g(n+h)$ under some suitable…

Let $R_{m, \mathrm{sq-full}}(N)$ be a representation function for the sum of a prime and a square-full number. In this article, we prove an asymptotic formula for the sum of $R_{m, \mathrm{sq-full}}(N)$ over positive integers $N$ in a short…

We establish an asymptotic formula for the logarithmic mean value of a 1-bounded multiplicative function that is sharp in many cases of interest. We derive from it a variety of applications, making progress on several old problems. As a…

Given a multiplicative function $f$ which is periodic over the primes, we obtain a full asymptotic expansion for the shifted convolution sum $\sum_{|h|<n\leq x} f(n) \tau(n-h)$, where $\tau$ denotes the divisor function and…

We will study the asymptotic behavior of summation functions of a natural argument, including the asymptotic behavior of summation functions of a prime argument in the paper. A general formula is obtained for determining the asymptotic…

We derive an asymptotic formula for the sum $$ H = \sum_{0<\gamma_k\leqslant T,\, 1\leqslant k\leqslant m}h(a_1\gamma_1+a_2\gamma_2+\cdots + a_m\gamma_m), $$ where $a_1, a_2, \ldots, a_m$ are integers whose sum equals zero, $\gamma_1,…

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

In this paper we further study the relationship between convexity and additive growth, building on the work of Schoen and Shkredov (\cite{SS}) to get some improvements to earlier results of Elekes, Nathanson and Ruzsa (\cite{ENR}). In…

In this paper, we investigate the asymptotics of a class of weighted sums over multiplicative functions and apply our results to deduce a stronger asymptotic form of Yitang Zhang's smoothened GPY sieve with coefficient expressions that are…

We prove an asymptotic formula for the sum $\sum_{n \leq N} d(n^2 - 1)$, where $d(n)$ denotes the number of divisors of $n$. During the course of our proof, we also furnish an asymptotic formula for the sum $\sum_{d \leq N} g(d)$, where…

When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log…

In this paper, we study the average size of the product of a number and its multiplicative inverse modulo a prime p. This turns out to be related to moments of L-functions and leads to a curious asymptotic formula for a certain triple…

Analytical expressions are derived for the position of irreducible fractions in the Farey sequence $F_N$ of order $N$ for a particular choice of $N$. The asymptotic behaviour is derived obtaining a lower error bound than in previous results…

Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition…

Let $f: \mathbb{N}^2 \mapsto \mathbb{C}$ be an arithmetic function of two variables. We study the existence of the limit: \[\displaystyle \lim_{x \to \infty} \frac{1}{x^2 (\log x)^{k-1}} \sum_{n_1 , n_2 \le x} f (n_1, n_2) \] where $k$ is a…

Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…