Related papers: Partial Franel sums

Let $\zeta(.)$ denote the Riemann zeta function and let $a(.)$ and $A(.)$ respectively denote a multiplicative function and its corresponding summatory function. We consider the correlation $$ \langle a(n)A(n-1) \rangle (T) =…

We evaluate the moments of some functions composed with the fractional part of $1/x$. We name them fractional moments. In particular, we obtain expressions for the fractional moments of some trigonometric functions, the Bernoulli…

We obtain asymptotic for the quantity $\int_0^1 \bigg|\sum_{n\le X}\tau_k(n)e(n\alpha)\bigg|d\alpha$ where $\tau_k(n) = \sum_{d_1\dots d_k = n} 1$. This follows from a quick application of the circle method. Along the way, we find minor arc…

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…

We establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are…

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

Paul Erd\H{o}s posed a problem on the asymptotic estimation of decomposing 1 into a sum of infinitely many unit fractions in \cite{Erd80}. We point out that this problem can be solved in the same way as the finite case, as shown in…

Recently, Mboup, Join and Fliess [27], [28] introduced non-asymptotic integer order differentiators by using an algebraic parametric estimation method [7], [8]. In this paper, in order to obtain non-asymptotic fractional order…

We propose a new class of semi-implicit methods for solving nonlinear fractional differential equations and study their stability. Several versions of our new schemes are proved to be unconditionally stable by choosing suitable parameters.…

A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as…

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

The pseudomoments of the Riemann zeta function, denoted $\mathcal{M}_k(N)$, are defined as the $2k$th integral moments of the $N$th partial sum of $\zeta(s)$ on the critical line. We improve the upper and lower bounds for the constants in…

Let $X=\{X_n: n\in\mathbb{N}\}$ be a linear process in which the coefficients are of the form $a_i=i^{-1}\ell(i)$ with $\ell$ being a slowly varying function at the infinity and the innovations are independent and identically distributed…

The generating function for $p_N(n)$, the number of partitions of $n$ into at most $N$ parts, may be written as a product of $N$ factors. We find the behavior of coefficients in the partial fraction decomposition of this product as $N \to…

Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of…

A Feynman formula is a representation of a solution of an initial (or initial-boundary) value problem for an evolution equation (or, equivalently, a representation of the semigroup resolving the problem) by a limit of $n$-fold iterated…

Let $ p_{i, n}, i=1,..., N(n)=2^{n-1} $ be the lengths of intervals between the neighboring fractions of Brocot sequence $ F_n $. We obtain an asymptotic formula for $\sigma_{\beta}(F_n)=\sum_{i=1}^{N(n)} p_{i, n}^{\beta} $,which improves…

A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…

We investigate the simultaneous distribution of the fractional parts of $\{\alpha_1 \gamma, \alpha_2\gamma, \cdots, \alpha_n\gamma\}$, where $n\geq 2$, $\alpha_1$, $\alpha_2$, $\ldots$, $\alpha_n$ are fixed, distinct positive real numbers…

We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…