The Smarandache function, say S, is a numerical function defined such that for every positive integer n, its image S(n) is the smallest positive integer whole factorial is divisible by n.

A collection of papers concerning Smarandache type functions, numbers, sequences, inteqer algorithms, paradoxes, experimental geometries, algebraic structures, neutrosophic probability, set, and logic, etc.

Made available online by the Smarandache Notion Journal and the University of New Mexico - Gallup.

A collection of papers concerning Smarandache type functions, numbers, sequences, inteqer algorithms, paradoxes, experimental geometries, algebraic structures, neutrosophic probability, set, and logic, etc.

The Smarandache function, say S, is a numerical function defined such that for every positive integer n, its image S(n) is the smallest positive integer whole factorial is divisible by n.

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.

This function is originated from the Romanian professor Florentin Smarandache.

A collection of papers concerning Smarandache type functions, numbers, sequences, inteqer algorithms, paradoxes, experimental geometries, algebraic structures, neutrosophic probability, set, and logic, etc.