This function is a generalization of the famous Smarandache function S(n). The main purpose of this paper is using the elementary and analytic methods to study the mean value properties of P(n), and give two interesting mean value formulas for it.
The paper presents a calculation algorithm for the values of the function S, defined by Fl. Smarandache [6], [1], [4], [5], an algorithm that uses the writing of numbers in base ten and it is based on Legendre's formula and some theoretical results. It differs from the one presented in [8], which avoids factorization, and from the one presented in [6], which requires writing on a generalized basis. Then a characterization of a prime number is given. Finally, a numerical application is presented.The paper presents a calculation algorithm for the values of the function S, defined by Fl. Smarandache [6], [1], [4], [5], an algorithm that uses the writing of numbers in base ten and it is based on Legendre's formula and some theoretical results. It differs from the one presented in [8], which avoids factorization, and from the one presented in [6], which requires writing on a generalized basis. Then a characterization of a prime number is given. Finally, a numerical application is presented.
A collection of papers concerning Smarandache type functions, numbers, sequences, inteqer algorithms, paradoxes, experimental geometries, algebraic structures, neutrosophic probability, set, and logic, etc.
This paper is aimed to provide generalizations of the Smarandache function. They will be constructed by means of sequences more general than the sequence of the factorials. Such sequences are monotonously convergent to zero sequences and divisibility sequences (in particular the Fibonacci sequence).
A collection of papers concerning Smarandache type functions, numbers, sequences, inteqer algorithms, paradoxes, experimental geometries, algebraic structures, neutrosophic probability, set, and logic, etc.
A collection of papers concerning Smarandache type functions, numbers, sequences, inteqer algorithms, paradoxes, experimental geometries, algebraic structures, neutrosophic probability, set, and logic, etc.