About the works of Florentin Smarandache have been written a lot of books (he himself wrote dozens of books and articles regarding math, physics, literature, philosophy). Being a globally recognized personality in both mathematics (there are countless functions and concepts that bear his name) and literature, it is natural that the volume of writings about his research is huge. What we try to do with this encyclopedia is to gather together as much as we can both from Smarandache’s mathematical work and the works of many mathematicians around the world inspired by the Smarandache notions. We structured this book using numbered Definitions, Theorems, Conjectures, Notes and Comments, in order to facilitate an easier reading but also to facilitate references to a specific paragraph. We divided the Bibliography in two parts, Writings by Florentin Smarandache (indexed by the name of books and articles) and Writings on Smarandache notions (indexed by the name of authors). We treated, in this book, about 130 Smarandache type sequences, about 50 Smarandache type functions and many solved or open problems of number theory. We also have, at the end of this book, a proposal for a new Smarandache type notion, id est the concept of “a set of Smarandache-Coman divisors of order k of a composite positive integer n with m prime factors”, notion that seems to have promising applications, at a first glance at least in the study of absolute and relative Fermat pseudoprimes, Carmichael numbers and Poulet numbers. This encyclopedia is both for researchers that will have on hand a tool that will help them “navigate” in the universe of Smarandache type notions and for young math enthusiasts: many of them will be attached by this wonderful branch of mathematics, number theory, reading the works of Florentin Smarandache.

It is always difficult to talk about arithmetic, because those who do not know what is about, nor do they understand in few sentences, no matter how inspired these might be, and those who know what is about, do no need to be told what is about. Arithmetic is that branch of mathematics that you keep it in your soul and in your mind, not in your suitcase or laptop. Part One of this book of collected papers aims to show new applications of Smarandache function in the study of some well known classes of numbers, like Sophie Germain primes, Poulet numbers, Carmichael numbers ets. Beside the well-known notions of number theory, we defined in these papers the following new concepts: “Smarandache-Coman divisors of order k of a composite integer n with m prime factors”, “Smarandache-Coman congruence on primes”, “Smarandache-Germain primes”, Coman-Smarandache criterion for primality”, “Smarandache-Korselt criterion”, “Smarandache-Coman constants”. Part Two of this book brings together several papers on few well known and less known types of primes.

The purpose of this book is to show that the method of concatenation can be a powerful tool in number theory and, in particular, in obtaining possible infinite sequences of primes. Part One of this book, “Primes in Smarandache concatenated sequences and Smarandache-Coman sequences of primes” , contains 12 papers on various sequences of primes that are distinguished among the terms of the well known Smarandache concatenated sequences. The sequences presented in this part are related to concatenation in three different ways: the sequence is obtained by the method of concatenation but the operation applied on its terms is some other arithmetical operation; the sequence is not obtained by concatenation but the operation applied on its terms is concatenation or both the sequence and the operation applied on its terms (in order to find sequences of primes) are using the method of concatenation. Part Two of this book, “Sequences of primes obtained by the method of concatenation” brings together 51 articles which aim, using the mentioned method, to highlight sequences of numbers which are rich in primes or are liable to lead to large primes. The method of concatenation is applied to different classes of numbers, e.g. Poulet numbers, twin primes, reversible primes, triangular numbers, repdigits, factorial numbers, fibonorial numbers, primordial numbers in order to obtain sequences of primes.

The functions S: N --> N, where for each natural number n > 0, S(n) is the smallest integer such that S(n)! is multiple of n.