相关论文: Divisors of the Euler and Carmichael functions

Motivated by an application of semigroup variants to the discrete log problem in groups and related cryptographic applications, we introduce a new kind of totient function, related to both Euler's function and a generalisation of Euler's…

In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…

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…

Observing a multiple version of the divisor function we introduce a new zeta function which we call a multiple finite Riemann zeta function. We utilize some $q$-series identity for proving the zeta function has an Euler product and then,…

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…

We present the construction of a theory of distributions (generalized functions) with a ``thick submanifold'', that is, a new theory of thick distributions on $\mathbb{R}^n$ whose domain contains a smooth submanifold on which the test…

Let $\varphi(n)$ denote the Euler totient function. In this paper, we first establish a new upper bound for $n/\varphi(n)$ involving $K(n)$, the function that counts the number of primorials not exceeding $n$. In particular, this leads to…

An interplay between the Lambert series and Euler's Pentagonal Number Theorem gives an Euler-type recurrence relation for any given arithmetical function. As consequences of this, we present Euler-type recurrence relations for some…

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…

In this article, we study the higher-power moments of restricted divisor functions. In order to establish our main results, we prove a more general result pertaining to the distribution of solutions to certain multiplicative Diophantine…

The distribution of the zeros of the Euler double zeta-function $\zeta_2(s_1,s_2)$, in the case when $s_1=s_2$, is studied numerically. Some similarity to the distribution of the zeros of Hurwitz zeta-functions is observed.

Ordinary and partial differential equation for unknown functions defined on the Cantor dyadic group are studied. We consider two types of equations: related to the Gibbs derivatives and to the fractional modified Gibbs derivatives (or…

We study the angular distributions of the splitting functions for processes for which a parton splits into three partons. Unlike the case of coherent branching, we find that both in vacuum and in the presence of the dense QCD matter, such…

Inspired by Lehmer's and Deaconescu's conjectures, as well as various analogue problems concerning Euler's totient function $\varphi(n)$, Schemmel's totient function $S_{2}(n)$, Jordan totient function $J_k$, and the unitary totient…

We consider very general "random integers" and (attempt to) prove that many multiplicative and additive functions of such integers have limiting distributions. These integers include, for instance, the curvatures of Apollonian circle…

An interesting line of research is the investigation of the laws of random variables known as Dirichlet means. However, there is not much information on interrelationships between different Dirichlet means. Here, we introduce two…

We investigate the behaviour of a certain additive function depending on prime divisors of specific integers lying in large gaps between consecutive primes. The result is obtained by a combination of results and ideas related to large gaps…

The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…

``In this paper we give the history of Leonhard Euler's work on the pentagonal number theorem, and his applications of the pentagonal number theorem to the divisor function, partition function and divergent series. We have attempted to give…

In this work we discuss Dirichlet products evaluated at Fibonacci numbers. As first applications of the results we get a representation of Fibonacci numbers in terms of Euler's totient function, an upper bound on the number of primitive…