No label defined (Q4354480)

This book is a survey on the Smarandache function \(S(n)\), where \(S(n)\) is the smallest positive integer \(k\) such that \(n\) divides \(k!\). It consists of two chapters, entitled ``The Smarandache function'' and ``Generalizations of Smarandache function''. The authors present the algorithm given in \textit{F. Smarandache} [An. Univ. Timişoara, Stiinte Mat. 18, 79-88 (1980; Zbl 0471.10004)], see also the same author [Smarandache Funct. J. 1, No. 1, 3-17 (1990; Zbl 0745.11004)], to compute the value \(S(n)\) if the canonical prime power factorization of \(n\) is given. They discuss properties of numerical series, diophantine equations, and other solved and unsolved problems involving the function \(S(n)\) and its extensions. Note that certain statements and generalizations given in this book are inexact or forced, constrained. They do not reflect deeper connections and properties. For example, Theorems 1.4.8, 1.4.9 and Theorem 1.6.1, which states that ``The series \(\sum_{k=2}^{\infty} \frac{S(k)}{(k+1)!}\) converges. If \(\beta\) is its sum, then \(\beta \in (e-\frac{3}{2},\frac1{2})\).'' The convergence of the given series yields at once from \(S(k)\leq k\) and \(e-\frac{3}{2}=1,21...>\frac1{2}\) (?). As a connection with the Fibonacci sequence the authors discuss the equation \(S(n-2)+S(n-1)=S(n)\) (page 111) and remark that it has infinitely many solutions \(n\), but this problem and its result have nothing to do with the Fibonacci sequence.