We survey general properties of multiplicative arithmetic functions of several variables and
related convolutions, including the Dirichlet convolution and the unitary convolution. We …

As a fundamental theorem in number theory, the Chinese Reminder Theorem (CRT) is
widely used to construct cryptographic primitives. This paper investigates the security of a …

Divisibility properties of random samples of integers | Revista de la Real Academia de Ciencias
Exactas, Físicas y Naturales. Serie A. Matemáticas Skip to main content SpringerLink Account …

The positive integers a1, a2,…, as are k-wise relatively prime if any k of them are relatively
prime. For a (k-1)-tuple of positive integers u=(u1,…, uk-1), let denote the number of s-tuples …

In this paper, we propose a network whose nodes are labeled by the composite numbers
and two nodes are connected by an undirected link if they are relatively prime to each other …

We consider the possible visits to visible points of a random walker moving up and right in
the integer lattice (with probability α and 1− α, respectively), and starting from the origin. We …

Preserving data confidentiality in clouds is a key issue. Secret Sharing, a cryptographic
primitive for the distribution of a secret among a group of n participants designed so that only …

Let be an arithmetic function of n variables, where. We study the mean-value of f that is
defined to be if this limit exists. We first generalize the Wintner theorem and then consider …

We define the k-dimensional generalized Euler function φ _k (n) φ k (n) as the number of
ordered k-tuples (a_1, ..., a_k) ∈ N^ k (a 1,…, ak)∈ N k such that 1 ≤ a_1, ..., a_k ≤ n 1≤ a …

Let r≥ k≥ 2 be fixed positive integers. Let ϱ r, k denote the characteristic function of the set
of r-tuples of positive integers with k-wise relatively prime components, that is any k of them …