Two Equations Related to the Smarandache Function
Guan Wen-j
Abstract
Guan Wen-j
Abstract
For any natural number n, Smarandache function S(n) means the smallest positive integer m can satisfy n│m!. For any given positive integer n,the famous pseudo Smarandache function Z(n)is defined as the smallest positive integer m to make n│1+2+…m=m(m+1)2.. This paper uses elementary method to study the equation S(n)+Z(n)=n and S(n)=P(n), and gives their all solutions.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For any natural number n, Smarandache function S(n) means the smallest positive integer m can satisfy n│m!. For any given positive integer n,the famous pseudo Smarandache function Z(n)is defined as the smallest positive integer m to make n│1+2+…m=m(m+1)2.. This paper uses elementary method to study the equation S(n)+Z(n)=n and S(n)=P(n), and gives their all solutions.
Key concepts: Integer (computer science), Combinatorics, Function (biology), Mathematics, Natural number, Computer science, Programming language, Evolutionary biology