Beruflich Dokumente
Kultur Dokumente
( Amarnath Murthy, S.E.(E&T), Well Logging Services, ONGC , Sabarmati , Ahmedabad, INDIA) The Smarandache Function is defined as smallest integer such that n divides kl Let us define Seen) Smarandache Reciprocal Function as follows: Seen)
=
Sen)
k . Where k
is the
yin!
THEOREM-I.
If Seen) = x ,and n::;c 3 , then x + 1 is the smal1est prime greater than n.
PROO:F:
It is obvious
th~t
to prove that nl is also divisible by n + 1 , n + 2 , ... n + m (= x) ,where n + m + 1 is the smallest prime greater than r n.. Let r be any of these
must be factorable into two factors each of p, q :2: 2. If one of the factors (say q ) is
must be a prime between nand 2n, there is a contradiction here since all the numbers fronl n + 1 to n + m (n + 1
composite. I-Ience neither of the two factors p , q can be:2: n. So each must be < n. Now there are two possibilities:
312
Case-I
:I:
q.
prIme
=
Tn this case
possibilities: (a) p ~ 5. Then r
=
p2
where p
IS
3 , Then r
p2
3! , Hence the theorem holds for all integral values of n except n = 3. This completes the proof. Remarks: Readers can note numbers between nand 2n. Note: We have the well known inequality Sen) ::; n. ---------(2) From the above theorem one can deduce the followjng inequality. If Pr is the rlh prime and Pr ::; n < Pr+l then improvement on (2)). Sen) ::; Pr. (A slight that nl
IS
313
i.e. S(Pr) = Pr, S(Pr+ 1) < Pr, S(Pr+ 2) < Pr, .,. S(Pr+l - 1) < Pr ,S(Pr+L
=
L
t =
Pr ) Pr
Summing up for all the numbers up to the sth pnme, defining po get
p.
5
1,
Wt
L
k=l
S (k) ::;;
L
r=O
(Pr+l - pr ) Pr
--------(3)
More generally
L
k=1
pp(k) is given by
L
k=2
p1t(n)
1 ). P1t(n)
-----( 4)
we get
314
L S (k)
k=l
~ Xn
REFERENCES: [1] "Krassimir T. Atanassov" , ON SOME OF THE SMARANDACHE'S PROBLEMS' AMERICAN RESEARCH PRESS Lupton, AZ USA. 1999. ( 22-23)
I II
[2]
The Florentine Smarandache " Special Collection, Archives of American Mathematics, Centre for American History, University of Texax at Austin, USA.
[3] 'Smarandache Notion Journal' Vol. 10 ,No. 1-2-3, Spring 1999. Number Theory Association of the UNIVERSITY OF CRAIOVP
315