AbstractAn ℓ-composition of n is a sequence of length ℓ of positive integers summing up to n. In this paper, we investigate the number of ℓ-compositions of n satisfying two natural coprimality conditions. Namely, we first give an exact asymptotic formula for the number of ℓ-compositions having the first summand coprime to the others. Then, we estimate the number of ℓ-compositions whose summands are all pairwise coprime
AbstractLet A*k(n) be the number of positive integers a coprime to n such that the equation a/n=1/m1...
Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power ...
AbstractIn this paper we obtain the distribution of the functionω(ϕk(n)) which counts the number of ...
AbstractBy using the Newton interpolation formula, we generalize the recent identities on the Catala...
We prove that the reciprocal sum $S_k(x)$ of the least common multiple of $k\geq 3$ positive integer...
AbstractWe give a new expression for the number of factorizations of a full cycle into an ordered pr...
AbstractWe consider the ternary Goldbach problem with two prime variables of the form k2+m2+1 and fi...
We use elementary arguments to prove results on the order of magnitude of certain sums concerning th...
AbstractA general theorem for providing a class of combinatorial identities where the sum is over al...
We prove that the only solutions to the equation σ(n)=2φ(n) with at most three distinct prime factor...
AbstractRecently Andrews proposed a problem of finding a combinatorial proof of an identity on the q...
We prove that the only solutions to the equation σ(n)=2φ(n) with at most three distinct prime factor...
Given a subset A of the set {1, . . . , v}2 we say that (a1, . . . , av) exhibits pairwise coprimali...
We generalize recent work of Andrews, Just, and Simay on modular palindromic compositions and anti-p...
AbstractIn this paper, a general theorem on |N,pn|k summability factors has been proved. This theore...
AbstractLet A*k(n) be the number of positive integers a coprime to n such that the equation a/n=1/m1...
Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power ...
AbstractIn this paper we obtain the distribution of the functionω(ϕk(n)) which counts the number of ...
AbstractBy using the Newton interpolation formula, we generalize the recent identities on the Catala...
We prove that the reciprocal sum $S_k(x)$ of the least common multiple of $k\geq 3$ positive integer...
AbstractWe give a new expression for the number of factorizations of a full cycle into an ordered pr...
AbstractWe consider the ternary Goldbach problem with two prime variables of the form k2+m2+1 and fi...
We use elementary arguments to prove results on the order of magnitude of certain sums concerning th...
AbstractA general theorem for providing a class of combinatorial identities where the sum is over al...
We prove that the only solutions to the equation σ(n)=2φ(n) with at most three distinct prime factor...
AbstractRecently Andrews proposed a problem of finding a combinatorial proof of an identity on the q...
We prove that the only solutions to the equation σ(n)=2φ(n) with at most three distinct prime factor...
Given a subset A of the set {1, . . . , v}2 we say that (a1, . . . , av) exhibits pairwise coprimali...
We generalize recent work of Andrews, Just, and Simay on modular palindromic compositions and anti-p...
AbstractIn this paper, a general theorem on |N,pn|k summability factors has been proved. This theore...
AbstractLet A*k(n) be the number of positive integers a coprime to n such that the equation a/n=1/m1...
Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power ...
AbstractIn this paper we obtain the distribution of the functionω(ϕk(n)) which counts the number of ...