Number Theory


Applications of Smarandache Function, and Prime and Coprime Functions

Authors: Sebastián Martín Ruiz

The Smarandache function is defined as follows: S(n)= the smallest positive integer such that S(n)! is divisible by n. [1] In this article we are going to see that the value this function takes when n is a perfect number of the form n = 2k - 1.(2k - 1) , p = 2k - 1 being a prime number.

Comments: 25 pages

Download: PDF

Submission history

[v1] 7 Mar 2010

Unique-IP document downloads: 66 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus