English
Related papers

Related papers: Some remarks on sum of Euler's totient function

200 papers

We prove several new variants of the Lambert series factorization theorem established in the first article "Generating special arithmetic functions by Lambert series factorizations" by Merca and Schmidt (2017). Several characteristic…

Combinatorics · Mathematics 2017-06-09 Mircea Merca , Maxie D. Schmidt

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

General Mathematics · Mathematics 2025-09-16 Brahim Mittou

New unconditional estimates of the divisor and totient functions are contributed to the literature. These results are consistent with the Riemann hypothesis and seem to solve the Nicolas inequality for all sufficiently large integers.

Number Theory · Mathematics 2008-07-16 N. A. Carella

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…

Number Theory · Mathematics 2024-01-09 Alfredo Nader

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…

Number Theory · Mathematics 2026-04-06 David H Bailey , Ross McPhedran , Bruno Salvy

The Euler phi function on a given integer $n$ yields the number of positive integers less than $n$ that are relatively prime to $n$. Equivalently, it gives the order of the group of units in the quotient ring $\mathbb{Z}/(n)$. We generalize…

Number Theory · Mathematics 2021-08-10 Emily Gullerud , Aba Mbirika

Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower…

Number Theory · Mathematics 2024-05-30 Jean-Marie De Koninck , William Verreault

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.…

Number Theory · Mathematics 2023-10-31 Bruce Sagan

The aim of this note is to provide an upper bound of the number of positive integers $\le x$ which can be written as $\varphi(n)$ for some positive integer $n$, where $\varphi$ stands for the Euler's function. The order of magnitude of this…

Number Theory · Mathematics 2015-10-07 Paolo Leonetti

Two sums over the inverse of the product of an integer n and its greatest prime factor G(n), are computed to first 13 decimal digits. These sums converge, but converge very slowly. They are transformed into sums involving Mertens' prime…

General Mathematics · Mathematics 2024-07-18 Tengiz O. Gogoberidze

The partial Stirling numbers T_n(k) used here are defined as the sum over odd values of i of (n choose i) i^k. Their 2-exponents nu(T_n(k)) are important in algebraic topology. We provide many specific results, applying to all values of n,…

Number Theory · Mathematics 2011-09-23 Donald M. Davis

In this paper, we use the transference principle to investigate the representation of sufficiently large positive integers as the sum of prime powers and integer powers, where the primes are drawn from a positive density subset of the set…

Number Theory · Mathematics 2024-02-20 Meng Gao

Let $\Phi_k(n)=|\{ (x_1, x_2, \cdots, x_k)\in \left(\mathbb{Z}/n\mathbb{Z}\right)^k; \ \gcd(x_1^2+x_2^2+ \cdots+ x_k^2, n)=1\}|$ be a general totient function introduced first by Cald\'{e}ron et. al. Motivated by the classical works of…

Number Theory · Mathematics 2023-04-06 Debika Banerjee , Bittu Chahal , Sneha Chaubey , Khyati Khurana

In this paper, we give a short elementary proof of the well known Euler's recurrence formula for the Riemann zeta function at positive even integers and integral representations of the Riemann zeta function at positive integers and at…

Probability · Mathematics 2019-02-01 Jiamei Liu , Yuxia Huang , Chuancun Yin

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$…

Number Theory · Mathematics 2016-07-27 Titus Hilberdink , László Tóth

In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…

Combinatorics · Mathematics 2018-02-27 Dmitry V. Kruchinin , Vladimir V. Kruchinin

Sums of positive integer powers have captivated the attention of mathematicians since ancient times. Over the centuries, mathematicians from diverse backgrounds have provided expressions for the sum of positive integer powers of the first…

General Mathematics · Mathematics 2024-10-22 Abdulhafeez A. Abdulsalam

The first-order Euler-Maclaurin formula relates the sum of the values of a smooth function on an interval of integers with its integral on the same interval on $\mathbb R$. We formulate here the analogue for functions that are just of…

Functional Analysis · Mathematics 2017-01-04 Giuseppe De Marco , Carlo Mariconda , Marco De Zotti

Let $\taue_k \colon \Z\to\Z$ be a multiplicative function such that $ \taue_k(p^a) = \sum_{d_1... d_k=a} 1 $. In the present paper we introduce generalizations of $\taue_k$ over the ring of Gaussian integers $\Zi$. We determine their…

Number Theory · Mathematics 2012-11-06 Andrew V. Lelechenko

It is well known that $\sum_{p\le n} 1/p =\ln(\ln(n)) + O(1)$ where $p$ goes over the primes. We give several known proofs of this. We first present a a proof that $\ge \ln(\ln(n)) + O(1)$. This is based on Euler's proof that $\sum_p 1/p$…

History and Overview · Mathematics 2015-11-17 William Gasarch , Larry Washington