Related papers: On the representation of number-theoretic function…
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
In this article, we present relations for the Euler totient function $\varphi(n)$ and the number of divisors $\tau(n)$ in terms of finite sums of integer parts of rational numbers or greatest common divisors of pairs of integers. Some of…
The purpose of this paper is to give the explicit formulae of p-adic l-functions and sums of powers which are related to Euler numbers.
Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…
In this article we present certain formulas involving arithmetical functions. In the first part we study properties of sums and product formulas for general type of arithmetic functions. In the second part we apply these formulas to the…
In this sequel to our recent note it is shown, in a unified manner, by making use of some basic properties of certain special functions, such as the Hurwitz zeta function, Lerch zeta function and Legendre chi function, that the values of…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
In this expository note, we revisit several classical arithmetic functions - namely Euler's totient function, the divisor sum functions and Dedekind's $\psi$-function - within a unifying algebraic framework that highlights their connections…
Let $H_k = 1 + 1/2 + 1/3 + \cdots + 1/k$ denote the $k$th harmonic number. We present an easy-to-implement algorithm for the computation of explicit closed-form evaluations, in terms of the digamma and polygamma functions, for Euler sums of…
We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…
Integral Cauchy theorem is used to derive closed-form expressions of the roots of a univariate polynomial of any degree as integrals of elementary functions.
We present explicit expressions for multi-fold logarithmic integrals that are equivalent to sums over polygamma functions at integer argument. Such relations find application in perturbative quantum field theory, quantum chemistry, analytic…
The aim of this paper is to construct generating functions for some families of special finite sums with the aid of the Newton-Mercator series, hypergeometric series, and $p$-adic integral (the Volkenborn integral). By using these…
Recently, Merca and Schmidt proved a number of identities relating partitions of an integer with two classic number-theoretic functions, namely the M\"obius function and Euler's totient function. Their demonstrations were mainly algebraic.…
For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…
We define "splitting functions of level l" for any integer l>0. These functions generalize Dwork's splitting functions : they allow us to represent additive characters of order $p^l$. Then we use these functions to obtain a Stickleberger…
Riemannian Geometry, Topology and Dynamics permit to introduce partially defined holomorphic functions on the variety of representations of the fundamental group of a manifold. The functions we consider are the complex valued Ray-Singer…
We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.
We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…
We cover some useful techniques in computational aspects of analytic number theory, with specific emphasis on ideas relevant to the evaluation of L-functions. These techniques overlap considerably with basic methods from analytic number…