In this paper an explicit formula for the number of tuples of positive integers having\ud the same lowest common multiple n is derived, and some of the properties of the resulting\ud arithmetic function are analyzed. The tuples having also the same greatest common divisor are\ud investigated, while some novel or existing integer sequences are recovered as particular cases.\ud A formula linking the gcd and lcm for tuples of integers is also presented
In this paper we perform a further investigation for r-gcd-sum function over r-regular integers (mod...
There is the well known result that n! divides the product of any set of n consecutive numbers. Usin...
The main purpose of this paper is using the elementary method to study the properties of the Smarand...
Let S={x1,x2,…,xn} be a set of positive integers, and let f be an arithmetical function. The matrice...
This Demonstration illustrates the concepts of the least common multiple (LCM) and the greatest comm...
AbstractWe present here a method which allows to derive a nontrivial lower bounds for the least comm...
Let S = {x1,x2,...,xn} be a set of positive integers, and let f be an arithmetical func-tion. The ma...
AbstractLet S={x1,…,xn} be a set of n distinct positive integers. The matrix [S]n having the least c...
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role...
Abstract. This paper proposes an Integer Programming model to obtain the Least Common Multiply (LCM)...
Abstract For any positive integer n, let SL(n) denotes the least positive integer k such that L(k) ...
Summary. We introduce the following notions: 1)the least common multiple of two integers (lcm(i, j))...
Abstract For any positive integer n, the famous F.Smarandache LCM function SL(n) is defined as the s...
In this thesis we give some new asymptotic formulas for mean values of multiplicative functions of ...
AbstractLet e be a real number and S={x1,…,xn} be a set of n distinct positive integers. The set S i...
In this paper we perform a further investigation for r-gcd-sum function over r-regular integers (mod...
There is the well known result that n! divides the product of any set of n consecutive numbers. Usin...
The main purpose of this paper is using the elementary method to study the properties of the Smarand...
Let S={x1,x2,…,xn} be a set of positive integers, and let f be an arithmetical function. The matrice...
This Demonstration illustrates the concepts of the least common multiple (LCM) and the greatest comm...
AbstractWe present here a method which allows to derive a nontrivial lower bounds for the least comm...
Let S = {x1,x2,...,xn} be a set of positive integers, and let f be an arithmetical func-tion. The ma...
AbstractLet S={x1,…,xn} be a set of n distinct positive integers. The matrix [S]n having the least c...
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role...
Abstract. This paper proposes an Integer Programming model to obtain the Least Common Multiply (LCM)...
Abstract For any positive integer n, let SL(n) denotes the least positive integer k such that L(k) ...
Summary. We introduce the following notions: 1)the least common multiple of two integers (lcm(i, j))...
Abstract For any positive integer n, the famous F.Smarandache LCM function SL(n) is defined as the s...
In this thesis we give some new asymptotic formulas for mean values of multiplicative functions of ...
AbstractLet e be a real number and S={x1,…,xn} be a set of n distinct positive integers. The set S i...
In this paper we perform a further investigation for r-gcd-sum function over r-regular integers (mod...
There is the well known result that n! divides the product of any set of n consecutive numbers. Usin...
The main purpose of this paper is using the elementary method to study the properties of the Smarand...