ONTHEMEANVALUEOF THESCBF FUNCTION

Zhang Xiaobeng
Department of Mathematics, Northwest University Xian, Shaanxi, P.R.China
Abstract The main purpose of this paper is using the elementary method to study the
asymptotic properties of the SCBF function on simple numbers, and give an
interesting asymptotic formula for it.
Keywords: SCBF function; Mean value; Asymptotic formula.
1. Introduction
In reference [1], the Smarandache Sum of Composites Between Factors
function SCBF(n) is dened as: The sum of composite numbers between
the smallest prime factor of n and the largest prime factor of n. For example,
SCBF(14)=10, since 27 = 14 and the sumof the composites between 2 and
7 is: 4 + 6 = 10. In reference [2]: A number n is called simple number if the
product of its proper divisors is less than or equal to n. Let A denotes set of all
simple numbers. That is, A = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 19,
21, }.
According to reference [1], Jason Earls has studied the arithmetical proper-
ties of SCBF(n) and proved that SCBF(n) is not a multiplicative function.
For example, SCBF(14 15) = 10 and SCBF(14) SCBF(15) = 40.
He also got that if i and j are positive integers then SCBF(2
i
5
j
) = 4,
SCBF(2
i
7
j
) = 10, etc. In this paper, we use the elementary method to
study the mean value properties of SCBF(n) on simple numbers, and give an
interesting asymptotic formula for it. That is, we shall prove the following:
Theorem. Let x 1, A denotes the set of all simple numbers. Then we
have the asymptotic formula

nx
nA
SCBF(n) = B
x
3
lnx
+ O
_
x
3
ln
2
x
_
,
where B =
1
3

p
1
p
3
is a constant,

p
denotes the summation over all primes.
2. Some Lemmas
To complete the proof of the theorem, we need the following lemmas:
208 SCIENTIA MAGNA VOL.1, NO.1
Lemma 1. For any prime p and positive integer k, we have the asymptotic
formula
SCBF(p
k
) = 0.
Proof. (See reference [1]).
Lemma 2. Let n A, then we have n = p, or n = p
2
, or n = p
3
, or
n = pq four case, where p, q denote the distinct primes.
Proof. First let n be a positive integer, p
d
(n) is the product of all positive
divisors of n, that is, p
d
(n) =

d|n
d. q
d
(n) is the product of all positive
divisors of n but n. That is, q
d
(n) =

d|n,d<n
d. Then from the denition of
p
d
(n) we know that
p
d
(n) =

d|n
d =

d|n
n
d
.
So from this formula we have
p
2
d
(n) =

d|n
d

d|n
n
d
=

d|n
n = n
d(n)
.
where d(n) =

d|n
1. Then we may immediately get p
d
(n) = n
d(n)
2
and
q
d
(n) =

d|n,d<n
d =

d|n
d
n
= n
d(n)
2
1
.
By the denition of the simple numbers, we get n
d(n)
2
1
n. Therefore, we
have
d(n) 4.
This inequality holds only for n = p, or n = p
2
, or n = p
3
, or n = pq four
cases. This completes the proof of Lemma 2.
Lemma 3. For any distinct prime p and q, we have the asymptotic formula
SCBF(pq) =
q
2
2
_
1
1
lnq
_

p
2
2
_
1
1
lnp
_
+ O
_
q
2
ln
2
q
_
.
Proof. From the denition of SCBF(n), we have
SCBF(pq) =

p<n<q
n

p<q
1
<q
q
1
,
where q
1
is a prime. Using the Abels Identity [3] and note that the asymptotic
formula

nx
n

=
x
+1
+ 1
+ O(x

)
On the mean value of the SCBF function 209
we can get
SCBF(pq) =

p<n<q
n

p<q
1
<q
q
1
=

p<nq1
n

p<q
1
q1
q
1
=

nq1
n

np
n

p<q
1
q1
q
1
=
(q 1)
2
2

(p 1)
2
2
+ O(q) (q 1)(q 1) + p(p)
+
_
q1
p
(t)dt
=
q
2
2

q
2
2 lnq

p
2
2
+
p
2
2 lnp
+ O
_
q
2
ln
2
q
_
.
This completes the proof of Lemma 3.
Lemma 4. For real number x 1, we have the asymptotic formula

pqx
SCBF(pq) = B
x
3
lnx
+ O
_
x
3
ln
2
x
_
,
where p and q are two distinct primes, B =
1
3

p
1
p
3
is a constant, and

p
denotes the summation over all primes.
Proof. From the denition of SCBF(n) and Lemma 1, Lemma 3, we get

pqx
SCBF(pq) = 2

pqx,p<q
SCBF(pq)

p
2
x
SCBF(p
2
)
= 2

p

p<q
x
p
SCBF(pq)
=

p

p<q
x
p
_
q
2

q
2
lnq
p
2
+
p
2
lnp
+ O
_
q
2
ln
2
q
__
.
Noting that (x) =
x
ln x
+ O
_
x
ln
2
x
_
, using Abels Identity [3] we get

p<q
x
p
q
2
= (
x
p
)
x
2
p
2
(p)p
2
2
_ x
p
p
(t)tdt
=
x
3
3p
3
ln
x
p

p
3
3 lnp
+ O
_
x
3
p
3
ln
2 x
p
_
210 SCIENTIA MAGNA VOL.1, NO.1
and

p<q
x
p
q
2
lnq
= A(
x
p
)f(
x
p
) A(p)f(p)
_ x
p
p
A(t)f(t)

dt
=
x
3
3p
3
ln
2 x
p

p
3
3 ln
2
p

p
3
9 ln
3
p
+ O
_
x
3
p
3
ln
3 x
p
_
,
where A(
x
p
) =

p<q
x
p
q
2
, f(x) =
1
ln x
. From reference [3], we know that

px
1
p
= ln lnx + C + O
_
1
lnx
_
,
where C is a computable constant. And then we also get

x
p =
x
lnx
+ O
_
x
ln
2
x
_
and

x
p
3
=
x
2
2 lnx
+ O
_
x
2
ln
2
x
_
.
Using the same method, we obtain

x
p
lnp
=
2x
ln
2
x
+ O
_
x
ln
3
x
_
and

x
p
3
lnp
=
x
2
ln
2
x
+ O
_
x
2
ln
3
x
_
.
Noting that
1
1
ln p
ln x
= 1 +
ln p
ln x
+
ln
2
p
ln
2
x
+ +
ln
m
p
ln
m
x
+ , then we get the
following two formulae:

p<q
x
p
q
2
=

p

x
_
x
3
3p
3
ln
x
p

p
3
3 lnp
+ O
_
x
3
p
3
ln
2 x
p
__
=
x
3
3 lnx

x
1
p
3
_
1 +
lnp
lnx
+
ln
2
p
ln
2
x
+
_

1
3

x
p
3
lnp
+ O
_
_
x
3
ln
2
x

x
1
p
3
_
1 + 2
lnp
lnx
+ 3
ln
2
p
ln
2
x
+
_
_
_
= C
1
x
3
lnx
+ O
_
x
3
ln
2
x
_
;
On the mean value of the SCBF function 211

p<q
x
p
q
2
lnq
=

p

x
_
x
3
3p
3
ln
2 x
p

p
3
3 ln
2
p

p
3
9 ln
3
p
+ O
_
x
3
p
3
ln
3 x
p
__
=
x
3
3 ln
2
x

x
1
p
3
_
1 + 2
lnp
lnx
+ 3
ln
2
p
ln
2
x
+
_

1
3

x
p
3
ln
2
p

1
9

x
p
3
ln
3
p
+ O
_
_

p

x
x
3
p
3
ln
3 x
p
_
_
= C
2
x
3
ln
2
x
+ O
_
x
2
ln
2
x
_
,
where C
1
= C
2
=
1
3

p
1
p
3
.
So we have
2

p

p<q
x
p
SCBF(pq)
=

p

p<q
x
p
_
q
2

q
2
lnq
p
2
+
p
2
lnp
+ O
_
q
2
ln
2
q
__
=

p

p<q
x
p
q
2

p<q
x
p
q
2
lnq

x
p
2

p<q
x
p
1
+

p

x
p
2
lnp

p<q
x
p
1 + O
_
_
_

p<q
x
p
q
2
ln
2
q
_
_
_
= B
x
3
lnx
+ O
_
x
3
ln
2
x
_
,
where B =
1
3

p
1
p
3
. This proves Lemma 4.
3. Proof of the theorem
In this section, we complete the proof of Theorem. According to the deni-
tion of simple numbers and Lemma 2, we have

nx
nA
SCBF(n)
212 SCIENTIA MAGNA VOL.1, NO.1
=

px
SCBF(p) +

p
2
x
SCBF(p
2
) +

p
3
x
SCBF(p
3
) +

pqx
SCBF(pq).
And then, using Lemma 1 and Lemma 4 we obtain

nx
nA
SCBF(n) =

pqx
SCBF(pq)
= B
x
3
lnx
+ O
_
x
3
ln
2
x
_
.
This completes the proof of Theorem.
Acknowledgments
The author express his gratitude to his supervisor Professor Zhang Wenpeng
for his very helpful and detailed instructions.
References
[1] Jason Earls, The Smarandache Sum of Composites Between Factors
Function, Smarandache Notions Journal, 14 (2004), 265270.
[2] F. Smarandache, Only Problems, Not Solutions, Chicago, Xiquan Publ.
House, 1993.
[3] Tom M. Apstol, Introduction to Analytic Number Theory, New York,
Springer-Verlag, 1976.