Related papers: Arithmetic-term representations for the greatest c…

Let $\gcd(m,n)$ denote the greatest common divisor of the positive integers $m$ and $n$, and let $\mu$ represent the M\" obius function. For any real number $x>5$, we define the summatory function of the M\" obius function involving the…

Under general conditions, the equation $g(x^1, ..., x^q, y) = 0$ implicitly defines $y$ locally as a function of $x^1, ..., x^q$. In this article, we express divided differences of $y$ in terms of divided differences of $g$, generalizing a…

Assume Vojta's Conjecture. Suppose $a, b, \alpha,\beta \in \mathbb{Z}$, and $f(x),g(x) \in \mathbb{Z}[x]$ are polynomials of degree $d \ge 2$. Assume that the sequence $(f^{\circ n}(a), g^{\circ n}(b))_n$ is generic and $\alpha,\beta$ are…

In this paper, we derive a general formula to express the product of three theta functions as a linear combination of other products of three theta functions. Moreover, we use the main formula to deduce a general formula for the product of…

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…

Under general conditions, the equation $g(x,y) = 0$ implicitly defines $y$ locally as a function of $x$. In this short note we study the combinatorial structure underlying a recently discovered formula for the divided differences of $y$…

We provide a necessary and sufficient condition for the representability of a function as the classical multidimensional Laplace transform, when the support of the representing measure is contained in some generalized semi-algebraic set.…

This article develops a theory of cell combinatorics and cell 2-representations for differential graded 2-categories. We introduce two types of partial preorders, called the strong and weak preorder. We then analyse and compare them. The…

We show asymptotic upper and lower bounds for the greatest common divisor of N and $\sigma(N)$. We also show that there are infinitely many integers N with fairly large g.c.d. of N and $\sigma(N)$.

Ailon and Rudnick have shown that if $a,b \in C[T]$ are multiplicatively independent polynomials, then $\deg(\gcd(a^n-1,b^n-1))$ is bounded for all $n\ge1$. We show that if instead $a,b \in F[T]$ for a finite field $F$ of characteristic…

We consider the ratio of two Gauss hypergeometric functions, in which the parameters of the numerator function differ from the respective parameters of the denominator function by integers. We derive explicit integral representations for…

In this paper, we present the definitions and some properties of the general fractional integrals (GFIs) and general fractional derivatives (GFDs) of a function f(x) with respect to another function g(x). Examples of special cases of…

We generalize techniques of Addison to a vastly larger context. We obtain integral representations in terms of the first periodic Bernoulli polynomial for a number of important special functions including the Lerch zeta, polylogarithm,…

The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…

For a composite $n$ and an odd $c$ with $c$ not dividing $n$, the number of solutions to the equation $n+a\equiv b\mod c$ with $a,b$ quadratic residues modulus $c$ is calculated. We establish a direct relation with those modular solutions…

We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these…

The integer $d$ is called an exponential divisor of $n=\prod_{i=1}^r p_i^{a_i}>1$ if $d=\prod_{i=1}^r p_i^{c_i}$, where $c_i \mid a_i$ for every $1\le i \le r$. The integers $n=\prod_{i=1}^r p_i^{a_i}, m=\prod_{i=1}^r p_i^{b_i}>1$ having…

The integer division of a numerator n by a divisor d gives a quotient q and a remainder r. Optimizing compilers accelerate software by replacing the division of n by d with the division of c * n (or c * n + c) by m for convenient integers c…

A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…

We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…