ON SMARANDACHE SIMPLE FUNCTIONS

Page 1

ON SMARANDACHE SIMPLE FUNCTIONS

MaohuaLe Department of Mathematics, Zhanjiang Normal College Zhanjiang, Guangdong, P.R China.

Absatract. Let p be a prime, and let k be a positive integer. In this paper we prove that the Smarandache simple functions S p (k) satisfies piS p (k) and k (p - 1) < S p (k) ~ k p .

For any prime p and any positive integer k, let S p (k) denote the smallest positive integer such that p Ie I S p (k)!. Then S p (k) is called the Smarandache simple function of p and k (see [1, Notion 121]). In this paper we prove the following result. Theorem. For any p and k, we have piS p (k) and

(1)

k (p - 1) < S p (k) ~ k P .

Proof Let integer such that

a = S p (k). Then a is the smallest positive

If pIa, then from (2) we get So we have pia.

p Ie I (a - I)!, a contradiction.

161


(kp)! = 1 ... P ... (2p) ... (kp) , we get

Since implies that (3)

p

k

I (kp)! .

a!> k p .

On the other hand, let pT I a! ,where It is a well known fact that

r

is a positive integer.

i=1

where [a / pi ] is the greatest integer which does not exceed a/pi. Since [a/pi]!> a/pi forany i, we see from (4) that

(5)

-

r<I(a/pi)=a/(p-1) i

=

Further, since (6)

1

k

~

r

by (2) ,we find from (5) that

a > k (p - 1).

The combination of (3) and (6) yields (1). The theorem is proved.

Reference 1. Editor of Problem Section, Math. Mag 61 (1988), No.3, 202.

162

It


Turn static files into dynamic content formats.

Create a flipbook
Issuu converts static files into: digital portfolios, online yearbooks, online catalogs, digital photo albums and more. Sign up and create your flipbook.