Some arithmetical properties of the Smarandache series

Page 1

Scientia Magna Vol. 10 (2014), No. 1, 64-67

Some arithmetical properties of the Smarandache series Qianli Yang Department of Mathematics, Weinan Normal University, Weinan, China 714000 Abstract The Smarandache function S(n) is defined as the minimal positive integer m such that n|m!. The main purpose of this paper is to study the analyze converges questions for ∞ ∞ P P 1 1 , i.e., we proved the series diverges for any δ ≤ 1, some series of the form S(n)δ S(n)δ and

∞ P n=1

n=1

n=1

1 S(n) S(n)

converges for any > 0.

Keywords Smarandache function, smarandache series, converges.

§1. Introduction and results For every positive integer n, let S(n) be the minimal positive integer m such that n|m!, i.e., S(n) = min{m : m ∈ N, n|m!}. This function is known as Smarandache function [1] . Easily, one has S(1) = 1, S(2) = 2, S(3) = 3, S(4) = 4, S(5) = 5, S(6) = 3, S(7) = 7, S(8) = 4, S(9) = 6, S(10) = 5, ¡ ¡ ¡ . Îąk 1 Îą2 Use the standard factorization of n = pÎą 1 p2 ¡ ¡ ¡ pk , p1 < p2 < ¡ ¡ ¡ < pk , it’s trivial to have i S(n) = max {S(pÎą i )}. 1≤i≤k

[2]

Many scholars have studied the properties of S(n), for example, M. Farris and P. Mitchell show the boundary of S(pÎą ) as (p − 1)Îą + 1 ≤ S(pÎą ) ≤ (p − 1)[Îą + 1 + logp Îą] + 1.

Z. Xu

[3]

noticed the following interesting relationship formula Ď€(x) = −1 +

[x] X S(n) n=2

n

,

by the fact that S(p) = p for p prime and S(n) < n except for the case n = 4 and n = p, where π(x) denotes the number of prime up to x, and [x] the greatest integer less or equal to x. Those and many other interesting results on Smarandache function S(n), readers may refer to [2]-[6]. 1 This

work is supported by by the Science Foundation of Shanxi province (2013JM1016).

Vol. 10

65

Some arithmetical properties of the Smarandache series

Let p be a fixed prime and n ∈ N, the primitive numbers of power p, denoted by Sp (n), is defined by Sp (n) = min{m : m ∈ N, pn |m!} = S(pn ). ∞ P 1 Z. Xu [3] obtained the identity between Riemann zeta function Îś(s) = ns , Ďƒ > 1 and an n=1

infinite series involving Sp (n) as

∞ X

1

S s (n) n=1 p

=

Îś(s) , ps − 1

and he also obtained some other asymptotic formulae for Sp (n). F. Luca [4] proved the series ∞ ∞ P P 1 1 converges for all δ ≼ 1 and diverges for all δ < 1, and the series S(n)δ S(n) log n n=1

S(n)

n=1

converges for any Îľ > 0. In this note, we studied the analyze converges problems for the infinite series involving S(n). That is, we shall prove the following conclusions: Theorem 1.1. For any δ ≤ 1, the series ∞ X

1 S(n)δ n=1 diverges. Theorem 1.2. For any Îľ > 0, the series ∞ X

1 ÎľS(n) S(n) n=1 converges.

§2. Some lemmas To complete the proof of theorems, we need two Lemmas. Lemma 2.1. Let p be any fixed prime. Then for any real number x ≼ 1, we have the asymptotic formula: ∞ X 1 1 p ln p 1 = ln x + Îł + + O(x− 2 + ), Sp (n) p−1 p−1 n=1 Sp (n)≤x

where γ is the Euler constant, denotes any fixed positive numbers. Proof. See Theorem 2 of [3]. Lemma 2.2.[7] Let > 0 and d(n) denotes the divisor function of positive integer n. Then d(n) = O(n ) ≤ C n , where the o-constant C depends on . Q ι Proof. The proof follows [7] by writing n = p , the standard factorization of n. Then p|n

pι ≼ 2ι = eι ln 2 ≼ ι ln 2 ≼

1 (a + 1) ln 2. 2

66

Qianli Yang

No. 1

If p ≼ 2, then pι ≼ 2ι ≼ ι + 1. Therefore, Y ι+1 Y ι+1 Y d(n) Y ι + 1 = = ≼ ι ι ι n p p p p|n

p|n p <2

The last item in above inequality is

p|n p <2

p|n p ≼2

Q p|n p <2

2 ln 2 ,

1 2 (a

Y ι+1 ι+1 . ι+1 + 1) ln 2 p|n p ≼2

Q

which is less than

p <2

2 ln 2

= C , say, the

o-constant C depends on .

§3. Proof of theorems Proof of Theorem 1. We may treat the case δ = 1 first. By Lemma 1 and the notation Sp (n) = S(pn ), we have ∞ X

∞ X 1 = lim S(pn ) x→+∞ n=1 n=1

1 = ∞. Sp (n)

Sp (n)≤x

Obviously, for δ ≤ 1,

∞ P n=1

1 S(n)δ

diverges follows easily by the trivial inequality:

∞ X

∞ ∞ X X 1 1 1 ≼ ≼ , δ S(n) S(n) n=1 S(pn ) n=1 n=1

complete the proof. Proof of Theorem 2. ∞ P It certainly suffices to assume that ≤ 1. We rewrite series n=1 ∞ X u(k) k=1

k Îľk

1 S(n)ÎľS(n)

as

,

where u(k) = ]{n : S(n) = k}. For every positive integer n such that S(n) = k is a divisor of k!, i.e. u(k) ≤ d(k!). By Lemma 2 and the inequality bellow 2

(k!) =

k Y j=1

j(k + 1 − j) <

2 k Y k+1 j=1

2

=

we have

u(k) ≤ d(k!) ≤ C (k!) < C

k+1 2

k+1 2

2k .

k .

where C means that the constant depending on . k Therefore, recalling that the properties of the sequence 1 + k1 , we have ∞ X u(k) k=1

k Îľk

≤ C

k k ∞ ∞ ∞ X X X 1 k+1 1 k+1 1 = C < C , 1 k Îľk 2 2Îľk k 2Îľk

k=1

k=1

k=1

Vol. 10

Some arithmetical properties of the Smarandache series

for some constant C1 , it follows that series

∞ P k=1

C1

u(k) kεk

67

is bounded above by

∞ X C1 1 = ε , 2εk 2 −1

k=1

completing the proof.

References [1] F. Smarandache, Only problem not solution, Xiquan Publishing House, Chicago, 1993. [2] M. Farris and P. Mitchell, Bounding the Smarandache function, Smarandache Notation Journal, 13(2002), 37-42. [3] Z. Xu, Some arithmetical properties of primitive numbers of power p, 2(2006), No. 1, 9-12. [4] F. Luca, The Smarandache harmonic series, NAW, 5(2000), No. 1, 150-151. [5] Jozsef Sandor, On certain inequalities involving the Smarandache dunction, Scientia Magna, 2(2006), No. 3, 78-80. [6] J. Fu, An equaltion involving the Smarandache function, Scientia Magna, 2(2006), No. 4, 83-86. [7] L. K. Hua, Itroduction to number theory, Springer-Verlag, 1982.

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.