Article: A lower bound for S ([2.sup.p-1]([2.sup.p]-1)).(Brief article)

Abstract. Let p be a prime, and let n = [2.sup.p-1]([2.sup.p]-1).In this paper we prove that S(n) [greater than or equal to] 2p+1.

Key words. Smarandache function, function value, lower bound.

**********

For any positive integer a, Iet S(a) be the Smarandache function. In[2], Sandor showed that if (1) 11 = [2.sup.p-1]([2.sup.p]-1) is an even

perfect number, then S(n) = [2.sup.p]-1. It is a well known fact that if n is an even perfect number then p must be a prime. But, its inverse proposition is false (see [1, Theoemzs 18 and 276]). In this paper we give a lower bound for S(n) in the general cases. We prove the following result.

...

Related newspaper, magazine, and journal articles:

 
 
Newsweek Harper's Magazine The Washington Post Chicago Tribune Crain's Chicago Business PRNewswire Pediatric News The Nation Advertising Age The Economist (US) A FREE trial gives you access to over 80 million articles! Access over 6,500 publications with a FREE trial!