Related papers: On general divisor functions over Piatetski-Shapir…

We derive some new finite sums involving the sequence $s_{2}\left(n\right),$ the sum of digits of the expansion of $n$ in base $2.$ These functions allow us to generalize some classical results obtained by Allouche, Shallit and others.

The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…

This paper presents a reformulation of the Leibniz product rule as a finite sum that expresses the fractional derivative of the product of two differentiable functions. This paper then proves the cases for when the product consists of an…

We study theta functions of a Riemann surface of genus g from the view point of tau function of a hierarchy of soliton equations. We study two kinds of series expansions. One is the Taylor expansion at any point of the theta divisor. We…

Suppose that $\alpha,\beta\in\mathbb{R}$. Let $\alpha\geqslant1$ and $c$ be a real number in the range $1<c< 12/11$. In this paper, it is proved that there exist infinitely many primes in the generalized Piatetski--Shapiro sequence, which…

We present a short alternative proof of the Vorono\"i summation formula which plays an important role in Dirichlet's divisor problem and has recently found an application in physics as a trace formula for a Schr\"odinger operator on a…

We study some arithmetic properties of the Ramanujan function $\tau(n)$, such as the largest prime divisor $P(\tau(n))$ and the number of distinct prime divisors $\omega(\tau(n))$ of $\tau(n)$ for various sequences of $n$. In particular, we…

We develop a fractional extension of the classical binomial distribution and the associated Bernstein operator, formulated within the framework of the generalized binomial theorem (Hara and Hino [Bull.\ London Math.\ Soc. \textbf{42}…

We prove an upper bound for the exponential sum associated to a localized $k-$divisor function, i.e., the counting function of the number of ways to write a positive integer $n$ as a product of $k\ge 2$ positive integers, each of them…

A generalized fractional derivative (GFD) definition is proposed in this work. For a differentiable function that can be expanded by Taylor series, we show that D^Elafa*D^Beta f(t)=D^(Elafa+Beta)f(t). GFD is applied for some functions in…

The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their…

Given a multiplicative function $f$, we let $S(x,f)=\sum_{n\leq x}f(n)$ be the associated partial sum. In this note, we show that lower bounds on partial sums of divisor-bounded functions result in lower bounds on the partial sums…

We extend the sum-of-divisors function to the complex plane via the Gaussian integers. Then we prove a modified form of Euler's classification of odd perfect numbers.

We introduce new analogues of the Ramanujan sums, denoted by $\widetilde{c}_q(n)$, associated with unitary divisors, and obtain results concerning the expansions of arithmetic functions of several variables with respect to the sums…

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…

The $j$th divisor function $d_j$, which counts the ordered factorisations of a positive integer into $j$ positive integer factors, is a very well-known arithmetic function; in particular, $d_2(n)$ gives the number of divisors of $n$.…

We obtain new bounds for short sums of isotypic trace functions associated to some sheaf modulo prime $p$ of bounded conductor, twisted by the Mobius function and also by the generalised divisor function. These trace functions include…

Let n be a non-null positive integer and $d(n)$ is the number of positive divisors of n, called the divisor function. Of course, $d(n) \leq n$. $d(n) = 1$ if and only if $n = 1$. For $n > 2$ we have $d(n) \geq 2$ and in this paper we try to…

We create a sequence version of calculus. First, we define equivalence, some fundamental operations, differential, and integral for sequences. Then, we propose sequence versions of identity function, power function, exponential function,…

In this paper we prove the mean values of some multiplicative functions connected with the divisor function on the short interval of summation.