Research On Smarandache Problems in Number Theory, Edited by Zhang Wenpeng

RESEARCH ON
SMARANDACHE PROBLEMS
IN NUMBER THEORY
(Collected papers)
Edited by
ZHANG WENPENG
Department of Mathematics
Northwest University
Xi’an, P. R. China
Hexis
2004
RESEARCH ON
SMARANDACHE PROBLEMS
IN NUMBER THEORY
(Collected papers)
Edited by
ZHANG WENPENG
Department of Mathematics
Northwest University
Xi’an, P. R. China
Hexis
2004
This book can be ordered in a paper bound reprint from:
Books on Demand
ProQuest Information & Learning
(University of Microfilm International)
300 N. Zeeb Road
P.O. Box 1346, Ann Arbor
MI 48106-1346, USA
Tel.: 1-800-521-0600 (Customer Service)
http://wwwlib.umi.com/bod/search/basic
Peer Reviewers:
A. W. Vyawahare, H. O. D. Mathematics Department, M. M. College Of Science, Umred
Road, Sakkardara, Nagpur University, Nagpur, PIN :- 440009, India.
K. M. Purohit, H. O. D. Mathematics Department, V.M.V. Com., J.M.T. Arts & J.J.P.
Science College, Wardhaman Nagar, Nagpur University, Nagpur, PIN : – 440008 , India.
Dr. (Mrs.) W.B.Vasantha Kandasamy, Department of Mathematics, Indian Institute of
Technology, IIT Madras, Chennai - 600 036, India.
Copyright 2004 by Hexis (Phoenix, USA) and Zhang Wenpeng, and Authors.
Many books one can download from the Digital Library:

http://www.gallup.unm.edu/~smarandache/eBooks-otherformats.htm
ISBN: 1-931233-88-8
Standard Address Number: 297-5092

Printed in the United States of America
This book is dedicated to the
memory of Florentin
Smarandache, who listed
many new and unsolved
problems in number theory.
Contents
Dedication v
Preface xi
An arithmetic function and the primitive number of power 1

Zhang Wenpeng
On the primitive numbers of power and -power roots 5

Yi Yuan, Liang Fangchi
Mean value on the pseudo-Smarandache squarefree function 9

Liu Huaning, Gao Jing
On the additive -th power complements 13

Xu Zhefeng
On the Smarandache pseudo-multiples of sequence 17

Wang Xiaoying
An arithmetic function and the divisor product sequences 21

Zhang Tianping
The Smarandache irrational root sieve sequences 27

Zhang Xiaobeng, Lou Yuanbing
A number theoretic function and its mean value 33

Lv Chuan
On the primitive numbers of power and its triangle inequality 37

Ding Liping
The additive analogue of Smarandache simple function 39

Zhu Minhui
On the -power complement sequence 43

Yao Weili
On the inferior and superior factorial part sequences 47

Li Jie

Gao Nan
viii RESEARCH ON SMARANDACHE PROBLEMS IN NUMBER THEORY
On the generalized constructive set 53

Gou su
On the inferior and superior prime part 57

Lou Yuanbing
Identities on the -power complements 61

Zhang Wenpeng
On the asymptotic property of divisor function for additive complements 65

Yi Yuan, Liang Fangchi
Mean value on two Smarandache-type multiplicative functions 69

Liu Huaning, Gao Jing
On the Smarandache ceil function and the number of prime factors 73

Xu Zhefeng
On the mean value of an arithmetical function 77

Wang Xiaoying
Two asymptotic formulae on the divisor product sequences 81

Zhang Tianping
On the Smarandache pseudo-even number Sequence 85

Zhang Xiaobeng, Lou Yuanbing

Lv Chuan
An arithmetical function and its cubic complements 93

Ding Liping
On the symmetric sequence and its some properties 97

Zhu Minhui
The additive analogue of Smarandache function 99

Yao Weili
An asymptotic formula on Smarandache ceil function 103

Li Jie
A hybrid number theoretic function and its mean value 107

Gao Nan
On the Smarandache pseudo-number 111

Lou Yuanbing
Several asymptotic formulae on a new arithmetical function 115

Guo Jinbao and He Yanfeng
On the Smarandache function and the -th roots of a positive integer 119
Li Hailong and Zhao Xiaopeng
Contents ix
On a dual of the Pseudo Smarandache Function and its Asymptotic Formula 123
Liu Duansen and Yang Cundian
The primitive numbers of power and its asymptotic property 129

Liang Fangchi, Yi Yuan
Some Asymptotic properties involving the Smarandache ceil function 133

He Xiaolin and Guo Jinbao
Asymptotic formulae of Smarandache-type multiplicative Functions 139

Yang Cundian and Li Chao
On the integer part of the -th root of a positive integer 143

Yang Mingshun and Li Hailong
On the additive cubic complements 147

Liang Fangchi, Yi Yuan
An arithmetical function and its hybrid mean value 151

Li Chao and Li Junzhuang
On the -th power free sieve sequence 155

Guo Jinbao and Zhao Xiqing
On a new Smarandache sequence 159

Zhao Xiaopeng and Yang Mingshun
On some asymptotic formulae involving Smarandache multiplicative functions 163

Li Junzhuang and Liu Duansen
Preface
Arithmetic is where numbers run across your mind looking for the answer.
Arithmetic is like numbers spinning in your head faster and faster until you blow up with the
answer.
KABOOM!!
Then you sit back down and begin the next problem.
(Alexander Nathanson)
Number theory is an ancient subject, but we still cannot answer many simplest and most natural
questions about the integers. Some old problems have been solved, but more arise. All the research
for these ancient or new problems implicated and are still promoting the development of number
theory and mathematics.
American-Romanian number theorist Florentin Smarandache introduced hundreds of interest

sequences and arithmetical functions, and presented many problems and conjectures in his life. In
1991, he published a book named Only problems, Not solutions!. He presented 105 unsolved
arithmetical problems and conjectures about these functions and sequences in it. Already many
researchers studied these sequences and functions from his book, and obtained important results.
This book, Research on Smarandache Problems in Number Theory (Collected papers), contains 41
research papers involving the Smarandache sequences, functions, or problems and conjectures on
them.
All these papers are original. Some of them treat the mean value or hybrid mean value of
Smarandache type functions, like the famous Smarandache function, Smarandache ceil function, or
Smarandache primitive function. Others treat the mean value of some famous number theoretic
functions acting on the Smarandache sequences, like k-th root sequence, k-th complement sequence,
or factorial part sequence, etc. There are papers that study the convergent property of some infinite
series involving the Smarandache type sequences. Some of these sequences have been first
investigated too. In addition, new sequences as additive complement sequences are first studied in
several papers of this book.
Most authors of these papers are my students. After this chance, I hope they will be more interested
in the mysterious integer and number theory!
All the papers are supported by the N. S. F. of P. R. China (10271093). So I would like to thank the
Department of Mathematical and Physical Sciences of N. S. F. C.
I would also like to thank my students Xu Zhefeng and Zhang Xiaobeng for their careful typeset
and design works. My special gratitude is due to all contributors of this book for their great help to
the publication of their papers and their detailed comments and corrections.
More future papers by my students will focus on the Smarandache notions, such as sequences,
functions, constants, numbers, continued fractions, infinite products, series, etc. in number theory!
August 10, 2004
Zhang Wenpeng
AN ARITHMETIC FUNCTION

AND THE PRIMITIVE
NUMBER OF POWER
Zhang Wenpeng
Research Center for Basic Science, Xi’an Jiaotong University, Xi’an, Shaanxi, P.R.China
wpzhang@nwu.edu.cn
Abstract For any fixed prime , we define

! %$'&()*

#"
+,

0
/
46
-. -21435"
7
8
The main purpose of this paper is to study the mean value properties of ,
and give an interesting asymptotic formula for it.
Keywords: Primitive number; Mean value; Asymptotic formula.

9
1. Introduction
Let be a prime, : be any positive integer, we define two arithmetic func-
tions as following:
;=<4> IHJ . IHQP > S
:@?BADC.E F)G C KML0:ON C RTU?VKE
<> XWYJ : IW[Z@\]P :#^
L :@?#ADC.E F)G L :ON
In problem 49 and 68 of reference [1], Professor F.Smarandache asked us to

study the properties of these two arithmetic functions. About these problems,
many scholars showed great interests in them (See references [2], [3]). But it
seems that no one knows the relationship between these two arithmetic func-
tions before. In this paper, <we
>_;=<shall
> use the elementary methods to study the
mean value properties of L :@?`? , and give an interesting asymptotic for-
mula for it. That is , we shall prove the following conclusion:
Theorem. For any fixed prime and any real number acbdT , we have the
asymptotic formula
e <>_;4<> ih T
L :@?`?BA > a hmlonqp7r4s aut^
H fg RTU?kj
Taking Awv , x in the theorem, we may immediately obtain the following

2 RESEARCH ON SMARANDACHE PROBLEMS IN NUMBER THEORY
Corollary. For any real number ayboT , we have the asymptotic formula
e >_; >
L j j :@?`?BAwx,a hml n pzr=s a t E
H0fg
e >_; >
L s s :@?`?BADa hml n pzr s a t ^
H0fg
9
2. One simple lemma
To complete the proof of the theorem, we need the following simple lemma:
Lemma. For any fixed prime and real number a{boT , we have
e } j j h{ hml~ a j
| A > g ^
| fg RTU? s
Proof. First we come to calculate

e } jU |
A ^
| fH
Note that the identities

T e H } j e H } j
TR B A | R | Z@\
|! \ |! \
H e \ > }h
T : j h TU? j R } j
A R H Z@\ | Z@\
|! \
He \

T : j h v }yh T
A R H Z@\ | Z@\ E
|! \
and
{
H0e \
T j ~ T R : j h v }h T T
TR A H Z@\ | Z@\ TR
|! \
H e \ e H
T T h : j Rc: j h v }h T v } R T
A R H Z j | Z@\ R | Z@\
j |! \ |!
j
He \
>
T h v h : j Rc: j h v h : j Rc: j R v,:RTU?
A H Z j | Z@\ H Z j
j |!
> H \ j>
T h v 0 R TU? h
: j R : j h ,v :RTU?
A H Z@\ R H H Z j ^
So we have
> 0 >
~ T h v H \
R TU? h : j R : j h v,:RTU? T
A H Z@\ R H H Z j n TR <\ j
t
An arithmetic function and the primitive number of power 3
> 0 >
h v H \
R TU? h : j R : j h ,v :RmTU?
A > H0 j > RmUT ? s H > ^
RTU?kj RTU?kj
Then we can immediately obtain
e } j
A > h >
v hl ~ a j
| gu
| fg RmTU? j R TU? s

j
h
hml~ a j
A > s g ^

RmTU?
This completes the proof of the Lemma.

9
3. Proof of the Theorem
In this section, we shall use the; < above > Lemma < > to complete the proof of the
Theorem. From the definition of :@? and L :@? , we may immediately get
e <4>_;=<>
L :@?`?
H fg
e } j A e } j A e } j e
A < < < T
<W =f g < W fg fg W <f
gU
W W[ \ W \
e } j e e >
A < < < N5?
fg W fgU W
e } j e > e
A < N5? T
fg
<
fgU <
e } j e e
A < [
T R T+
fg fgU <
f U
g
<
1 = 3
e } j a a hml > UT ?
A < | R | Z@\
fg
e } j e } j e
a h l
m }
A < | R < | Z@\ < j
| f¡ gU¡ | f¡ 4gU¡ | f¡ gU!¡

T e } j hml£n¤p7r s
A T¢R a < | aut
| f¡ gU¡

h pzr j a
A T¢R
T ~ > j hml~ a ¥h l n pzr s a t
RTU? s a ¢

ih T
A > a h¥l n pzr s a t ^
RTU?kj
This completes the proof of the Theorem.
References
[1] Smarandache F. Only problems, not Solutions. Chicago: Xiquan Publ.
House, 1993.
[2] Liu Hongyan and Zhang Wenpeng. A number theoretic function and its
mean value property. Smarandache Notions Journal, 2002, 13: 155-159.
[3] Zhang Wenpeng and Liu Duansen. On the primitive number of power
and its asymptotic property. Smarandache Notions Journal, 2002, 13: 173-175.
[4] Apostol T M. Introduction to Analytic Number Theory. New York:
Springer-Verlag, 1976.

ON
¦
THE PRIMITIVE NUMBERS OF POWER AND
-POWER ROOTS
Yi Yuan
yiyuan74@163.com
Liang Fangchi
School of Science, Air Force Engineering University, Xi’an, Shaanxi, P.R.China
fc-liang@163.com

5
Abstract Let be a prime, be any positive integer, denotes the smallest integer
M§%¨
1 , where . In this paper, we study the mean value properties

of , where is the superior integer part of © -power roots, and give an

interesting asymptotic formula for it.
Keywords: Primitive numbers of power ; © -power roots; Asymptotic formula.

9
1. Introduction and results
;I<4>
Let be a prime, ;<=> : be any positive H integer,
:@? denotes
; > the ; smallest
>
integer such that @
: V
? K is divisible by . For example, s U
T ¢
? ª
A x , s v!?A
« ; > ; >®
, s x!?AM¬ , s ?AM¬ , ¯¯¯U¯¯¯ . In problem 49 of book [1], ;<=> Professor F.
Smarandache ask us to study the properties of the sequence ° :@?¤± . About
this problem, Professor Zhang and Liu in [2] have studied it and obtained an
interesting asymptotic formula. That is, for any fixed prime and any positive
integer : ,

;=<> > m
h l pzr
:@?#A RTU?): p7r] ¯ : ^
For any fixed positive intger , let L H denotes the superior integer part of -
power roots, that is, L \ AªT , ¯¯¯ ,L \ AYT , L A³v , ¯¯¯ . In problem 80 of book
j(² j(²
[1], Professor F. Smarandache ask us to study the properties of the sequence
L H . About this problem, the author of [3] have studied it and obtained an
interesting asymptotic formula. That is, for any real number ayboT ,

e > T pzrpzr T ¶
> µ a
L H ?BA a a h R pzr ?@¯a hml z
p r E
H0fgO´ a
> µ
where :@? denotes the numbers of all prime divisor of : , be a computable
´
constant.
In this paper,
;<4> we will use the elementary method to study the asymptotic
properties of L H ? in the following form:
e T J; < > ; < >
L H Z@\ ?]R L H ? J E
H0fg
where a be a positive real number, and give an interesting asymptotic formula

for it. In fact, we shall prove the following result:
Theorem. For any real number a·bMv , let be a prime and : be any
positive integer. Then we have the asymptotic formula

e T J; < > ; < > T pzr a
L H Z@\ ?]R J
L H ? ADa ² 3 ¯ T[R m
h ¹
l ¸
pzr] E
H fg
where lº¸ denotes the l -constant depending only on parameter .

9
In this section, we shall complete the proof of the theorem. First we need
following one simple Lemma. That is,
Lemma. Let be a prime and : be any positive integer, then we have
J ;=<> : h ;4<=> E if H JJ C.K¼

TU?]R :@? J A» ½
E otherwise E
;4<>
where :@?#ADC , H¾ C.K denotes that H J C.K and H Z@\ P C.K .
Proof.
> Now
;4<> we will discuss it in two cases.
Fk? Let :; @< ?#> ADC , if H¾ C.K , then H J K and H Z@\ P C.K . From the
P > h we haveH Z@\ P C. > h >
definition of :@> ? we have ;4<> C H @
Z \ TU?VK , C v!?VK , ¯¯¯ , H Z@\ P C h
RTU?VK and H Z@\ C J {
h ?VK , so : h TU?BADC {
h , then we get
J ; < > : h TU?]R ; < > :@? J A ^ (1)
> ;=<> ;<=> h
F_Fk? Let :@?[AoC , if H J C.K and H Z@\ J C.K , then we have : TU?[A£C ,
so
J ;4<> : h TU?]R ;=<4> :@? J A ½ ^ (2)
Combining (1) and (2), we can easily get
J ;=<4> : h ;=<> E if H¾ C.K¼

TU?]R :@? J A¿» ½
E otherwise ^
This completes the proof of Lemma.

Now we use above Lemma to complete the proof of Theorem. ¸Á For> any real
¸
number abv , let À be a fixed positive integer such that À ayÂ À h TU? ,
On the primitive numbers of power and -power roots 7
;<4>
then from the definition of :@? and the Lemma we have
e T J ;=<4> ;=<>
L H Z@\ ?@R L H ? J (3)
H fg
e \ e T J ;=<4> ;=<4>
A Ã L H Z@\ ?ÄR L H ? J
\
² f H0f Z@\) ² \
h e T ;J < > ; < >
L H Z@\ ?]R L H ? J
² f H fg
e Ã \ T J ;=<>®Å h ;=<4>®Å J h e T J ;4<=> ;=<>
A Ã TU?]R ? L H Z@\ ?@R L H ? J
\
² fH0fg
e \ T J ;=<>®Å h ;=<4>®Å J Ã
A Ã TU?]R ?
\
e >
A T h¥l TU?V^ (4)

<UfÆ_ g ² 3
W¢Ç
;4<4>®Å ¾
where ?yAÈC . Note that if C.K , then we have (see reference [4],
Theorem 1.7.2)
Å e C e C
A É ÊÌ A Ê+Ì
Ê \Ë Êf ¡Í`Î W Ë
e T hmlonVpÏÐ <
A C¯ Ê Ct
Ê f¡Í`Î W

C zp r C
A hml
RT zp r] ^ (5)
From (4), we can deduce that

> Å ºpzr Å
CÑA R TU? hml
pzr] ^ (6)
So that
Á Á > ¹pzr a Á Å Á
T C RTU?]¯a ² 3 hml¹¸ p7r] E if T a ²3 ^
Å ¾
Note that
¾ for
> any fixed positive
> integer , if there > has one C such that C.K ,
then C h TU?VK , ¾ C h v!?VK , ¯¯¯ , ¾ C h{ RTU?VK . Hence there have
Å Ò <W Õ`Ö
times of C such that A Ê É in the interval
\ÔÓ

Á Á > ¹pzr a
T C RTU?Ä¯a ² 3 h¥l¹¸ pzr] ^
Then from this and (3), we have

e T J ;4<> ;=<4>
L H Z@\ ?]R L H ? J
H0fg
e >
A T hml TU?
f g 3
<Æ ²
W×Ç
T > ¹pzr a
A RTU?]¯a ² 3 m
h l¹¸ h¥l > TU?
p7r] Ô

T pzr a
A a ²3 ¯ TR hml¹¸
pzr] ^
This completes the proof of Theorem.
References
House, 1993.
[2] Zhang Wenpeng and Liu Duansen. primitive numbers of power and its
asymptotic property, Smaramche Notions Journal 2002, 13: 173-175.
[3] Yang Hai. Yan’an University master’s degree dissertion, 2004, 19-23.
[4] Pan Chengdong and Pan Chengbiao, The Elementary number Theory,
Beijing University Press Beijing, 2003.
MEAN VALUE ON THE PSEUDO-SMARANDACHE
SQUAREFREE FUNCTION
Liu Huaning
Department of Mathematics, Northwest University, Xi’an, Shaanxi, P.R.China
hnliu@etang.com
Gao Jing
School of Science, Xi’an Jiaotong University, Xi’an, Shaanxi, P.R.China
jgao@china.com.cn

Abstract For any positive integer , the pseudo-Smarandache squarefree function ØÚÙ

is defined as the least positive integer such that is divisible by . In this

paper, we study the mean value of ØÚÙ , and give a few asymptotic formulae.
Keywords: Pseudo-Smarandache squarefree function; Mean value; Asymptotic formula.

9
1. Introduction
>
According to [1], the pseudo-Smarandache squarefree function ÛÜ :@? is
defined as the least H is divisible by : . It is
> positive integer C such that C
obvious that ÛÜ TU?BAªT . For :ÞÝoT , Maohua Le [1] obtained that
> X¸
ÛÜ :@?#A \ j ¯¯¯ E (1)
where \ , j , ¯¯¯ , X¸ are distinct prime divisors of : . Also he showed that
e T ½
É > > E L'à{áiE L'Ý
H \ ÛºÜ :@?`?kß
is divergence. >
In this paper, we study the mean value of ÛÜ :@? , and give a few asymptotic
formulae. That is, we shall prove the following:
½
Theorem 1. For any real numbers } E¤â with â@R } o Ý T and } Ý , we have
| > > >
e ÛÜ :@? â? â×R } ? T
É Aåä > ä < TR | Ì E
H \ :Úã vâ×Ræv } ?oç Ë ã
h
ä
>
where â? is the Riemann zeta function, < denotes the product over all prime
ä ç
numbers.
½
Theorem 2. For any real numbers } Ý and ayboT , we have
> }h |
e | > TU?)a Z@\ T |
ÛÜ :@?#A ä > > }yh < TR | > ih Ì hml n a Z è3 Zé t ^
H fg v!? TU?Yç Ë TU?
ä
e > > } > }{h TU?[AT , so from
Noting that ÛºÜ£ê :@?[Aëa hl TU? and | pzìzí
H fg Uî ê 1 ä
Theorem 2 we immediately have the limit

pzì7í T T >
| î } ç< T[R | > ïh A v!?V^
ê 1 TU? ä
9
2. Proof of the theorems
Now we prove the theorems. For any real numbers } , â with â#R } ÝoT and
} Ý ½ , let
e | >
> ÛºÜ :@?
G â?#A É ^
H \ :Úã
From (1) and the Euler product formula [2] we have
| | <Uóõ\ ô
> h h h h
G â,?ðA < T ¯¯¯ Ì A <òñ T < óö
ç Ë ã j(ã ç T¢R \
<ó)\ ô
~ T h T
A <òñ
< \ ó TR {
h | ö
ç T[R ã
> >
â? â×R } ? T
A ä > ä
vâ×Ræv } ?oç
< T[R
ã h | Ì ^
ä Ë
This proves Theorem 1.
½
For any real numbers } Ý and ayboT , it is obvious that
Á e | >
J ÛÜ | > :@? J :
|
and ÷ É
ÛºÜ :@?
÷ Â ù
T
E
÷
÷H \ :Oø ÷
÷ R }
÷ ÷
÷ ÷
where ù is the real part of â . So by Perron formula [3] we can get
e ÛºÜ
| >
:@? T Z Êÿþ > h a ã a
> h ù
?
A G â â ? dâ
h l ~ ê
: )
ã ú
v
û #
F
ü ý ÿ
Ê þ ê â ý
H fg
> pÏÐ a
ýh l
a \ ø ú v,a2? íìzr TE B

> a
h l a øú ? íìzr TE JJ JJ B E
a
Mean value on the pseudo-Smarandache squarefree function 11
½
where is the nearest integer to a , and JJ a JJ A J a.R J . Taking â A ,
s and Ýv in the above, then we have ê
A }h
j
e | > T Z è Z Êÿþ
|
> a ã
| Z
è
ÛÜ :@?BA G â? d â hml ~ a
|
vûF ü Z
è ÿ
Ê þ â
^
H0fg

Now we move the integral line from }h s F to }h \ R.F . This time,
j j
the function
> a ã
G â,?
â
have a simple pole point at âA
} h T with residue
> }h |
TU?)a Z@\ T
ä > > < TR | > ïh Ì ^
v!? }h TU? ç Ë U
T ?
ä

Now taking ADa , then we have
> }h |
e | > TU?)a Z@\ T
ÛºÜ :@?BA ä > > }yh < T[R | > h Ì
H fg v!? TU? ç Ë TU?
ä
| Z è3 Z Ê g
T > a ã | è Z é
h
| Ê G â,? d â hml£n a Z 3 t
vûF ü Z è3 g â
> }h | Z@\
TU?)a T
A ä > > }h < TR | > ïh Ì
v!? TU? ç Ë TU?
ä |
h l ~
g T a Z è3 Zé Å n a | Z è3
Z ét
÷ G }h h @h Fõa
÷ T hëJ Å J ? d
> hml
ü g ÷ v ÷
> }h ÷ | ÷
TU?)a ÷ Z@\ T ÷ |
Aä > > }h < TR | > ïh Ì hmlon a Z è3
Z é
t ^
v!? TU?ªç Ë TU?
ä
This completes the proof of Theorem 2.
References
[1] Maohua Le. On the pseudo-Smarandache squarefree function. Smaran-
dache Notions Journal, 2002, 13: 229-236.
[3] Chengdong Pan and Chengbiao Pan. Foundation of Analytic Number
Theory. Beijing: Science Press, 1997.
¦
ON THE ADDITIVE -TH POWER COMPLEMENTS
Xu Zhefeng
Department of Mthematics, Northwest University, Xi’an, Shaanxi, P.R.China
zfxu@eyou.com
Abstract In this paper, similar to the Smarandache © -th power complements, we defined
the additive © -th power complements. Using the elementary method, we study
the mean value properties of the additive square complements, and give some
interesting asymptotic formulae.
Keywords: Additive © -th power complements; Mean value; Asymptotic formula.

9
1. Introduction
¸ >
For any positive integer : , the Smarandache >
-th power complements :@?
is the smallest positive integer such that : ¸ :@? is a complete -th power, see
problem 29 of [1]. Similar to the Smarandache > -th power complements, we
define the additive -th power complements L ¸ :@? as follows: L ¸ > :@? is the
>
smallest nonnegative integer such that L ¸ :@? h : is a complete -th power.
For > example,
> if DA v , we have the additive square complements sequence
½ ½ ½ « ½
°UL j :@?¤± :{AªTE¤v5E¯¯¯z? as follows: E¤v5ETE E E¤x5E¤v5ETE E E¤5> E E!x5E¤v5ETE > E > E¯¯¯ .
In this paper,
> we stdudy the mean value properties of L ¸ :@? and N L ¸ :@?`? ,
where N :@? is the Dirichlet divisor function, and give several interesting asymp-
totic formulae. That is, we shall prove the following conclusion:
Theorem 1. For any real number a{bx , we have the asymptotic formula
e > j è
L ¸ @ : ?#A a j ² 3 hml n a j t ^
²
H fg ïRæv
Theorem 2. For any real number a{bx , we have the asymptotic formula

e > ¸ > T T
N L :@?`?BA T[R a 7
p r a h v h p7r iRæv h a h.lën a \ ² 3 pzr aXtE
H0fg
where is the Euler constant.

9
2. Some lemmas
Before the proof of the theorems, some lemmas will be usefull.
Lemma 1. For any real number aybx , we have the asymptotic formula:
e > > è
N a? Aa pzr a h v RTU?)a h¥l£n a 3 tºE
H fg
Proof. See reference [2].
Lemma> 2. For any > ½ real½ number a b·x and any nonnegative arithmetical
function G :@? with G ?BA , we have the asymptotic formula:
g ²3 Ö \
e > ¸ > Ó e e > e >
G L @ : ?`?BA G :@? h¥l
G :@?
E
H fg \
H0f H f n g 3 Ö t
²
Ó
>®Å
where
¸ a denotes the greatest integer less than or equal to a and ? A
e \ F ÅÊ
.
Ê \
Proof. For any real number m a b T , let À be a fixed positive integer such
that ¸ Á > ¸
À aÂ À h TU? ^
Å ¸ >®Å h ¸
Noting that if : pass through the integers in the interval E TU? t , then
> ½ >®Å ¸ ÓÅ ¸ >½
L ¸ :@? pass through the integers in the inteval E h TU? R RT Ö and G ?#A
½ Ó
, we can write
e > > e \ e > ¸ > e > ¸ >
G L ¸ @
: ?`? A Ã G L @ : ?`? h G L @ : ?`?
\
H fg ² f H @Z \) ² ² fH fg
e \ e > e Ã >
A Ã G :@? h G :@?VE
\
H f 7Z ² gfH
¸ Ã Ã Ã
>®Å e \ F ÅÊ Ö
where ?BA . Since À A a ² 3 , so we have
Ê \ Ó
g ²3 Ö \
e > ¸ > Ó e e > e >
G L @ : ?`?BA G :@? h¥l
G :@?
^
H fg \
H0f H f n g 3 Ö t
²
Ó
This proves Lemma 2.
Note: This > Lemma is very usefull. Because if we have the mean value for-
mulae of G @
: ? , then from this lemma, we can easily get the mean value formula
> ¸ >
of G L :@?`? .
H fg
On the additive -th power complements 15
9
In this section, we will complete the proof of the theorems. First we prove
Theorem
> 1. From Lemma 1 and the Euler summation formula (See [3]), let
G :@?#AD: , we have
g ²3 Ö \
e > Ó e e e
L ¸ :@?ðA : hml :
\
H0fg f
H H f n g ² 3 Ö t

Ó
3 Ö
g ² \
T Ó e Å ¸ è
A j j j hl n a j ² t
v \
j è
A a j ² 3 hml£n a j ² t^
iRæv
Now we prove Theorem 2. From Lemma 1 and Lemma 2, we have
e > >
N L ¸ :@?`?
H fg
g ²3 Ö \
Ó e e > e >
A N :@? h¥l N :@?
\
H0f f n g ²3 Ö t
H

Ó
g ²3 Ö \
Ó e Å ¸ \ pzr Å ¸ \ h pzr T
A T hml Å BÔ
\
¸
h > v RTU? Å \ t hmlon a \ 3 p7r aXt
²
g 3 Ö \
Ó e² ¸
n > ïRTU? Å \ pzr Å h > v h%pzr iRTU? Å \
¸
A
\
¸
h l >®Å j ?kt h¥l£n a \ 3 pzr aXt
²
g ²3 \ Ö g ²3 Ö \
> Ó e ¸
Å \pzr Å h > Ó e Å¸ \
A iRTU? v h pzr RTU?
\ \
h lën a \ 3 p7r aXt^
²
Then from the Euler summation formula, we can easily get
e > > T T
N L ¸ :@?`?BA T[R a p7r a h v h p7r iRæv h
a
h.lën a \ 3 zp r X
² a t^
H0fg
This completes the proof of the theorems.
References
[1] F.Smaradache. Only problems, not solutions, Xiquan Publishing House,
Chicago, 1993.
[2] G.L.Dirichlet. Sur l’usage des series infinies dans la theorie des nom-
bres. Crelle’s Journal, No.18, 1938.
[3] Tom M. Apostol. Introduction to Analytic Number Theory, Springer-
Verlag, New York, 1976, pp54.
ON THE SMARANDACHE PSEUDO-MULTIPLES
OF SEQUENCE
Wang Xiaoying
1. Research Center for Basic Science, Xi’an Jiaotong University, Xi’an, Shaanxi, P.R.China
2. Department of Mathematics, Northwest University, Xi’an, Shaanxi, P.R.China
xdwxy@163.com
Abstract The main purpose of this paper is to study the mean value properties of the
Smarandache pseudo-multiples of number sequence, and give an interesting
asymptotic formula for it.
Keywords: Pseudo-multiples of numbers; Mean value; Asymptotic formula.

9
1. Introduction
A number is a pseudo-multiple of if some permutation of its digits is a
½ ½
multiple of , including the identity permutation. For example: E¤5ET µ ET5E
½ ½ ½ ½
v E¤v5E¤x E¤x5E E¤ EV=TE¤v=E¯U¯¯ are pseudo-multiple of numbers. Let de-
notes the set of all the pseudo-multiple of numbers. In reference [1], Profes-
sor F. Smarandache asked us to study the properties of the pseudo-multiple of
sequence. About this problems, it seems that none had studied it, at least we
have not seen such a paper before. In this paper, we use the elementary method
to study the mean value properties of this sequence, and obtain an interesting
asymptotic formula for it. That is, we shall prove the following:
Theorem. For any real number ayboT , we have the asymptotic formula
e > e >
G :@?]A G :@? hml£n Ào"
a ! # 3 $ ú tE
!#
H
H0fg
H fg
where À A í % ' ° J G > :@? J ± . Taking G > :@? A N > :@? , > :@? as the Dirichlet
&
\ fH0fg ´
divisor function and the function of the number of prime factors respectively,
then we have the following:
Corollary 1. For any real number a{boT , we have the asymptotic formula
e > >
N :@?#ADa pzr a h v RTU?)a h¥lon * a ! #)3 $ ú Zé tE
!#
H )
(
H fg
where is the Euler constant, is any fixed positive number.
Corollary 2. For any real number a{boT , we have the asymptotic formula

e > z
p
r z
p r h m
h l a
:@?#ADa a a pzr a E
H ´
H fg
where is a computable constant.
9
½ ¸Á ½ ¸ Z@\
> Now we completes
Á the proof of the Theorem. First let T
a Â T
bÑTU? , then pÏÐ aDÂ¿ h T . According to the definition of set µ , we
Á µ ¸
know that the largest number of digits ( a ) not attribute set is + Z@\ . In
«
fact, in these numbers, there are + one digit, they are ¸ TE¤v5E¤x5E E E E+5E¤¬ ; There
are + j two
Á digits; The number µ of the digits are ¸ + . So> the ¸ largest Á ¸ number of
digits ( a ) not attribute set is + h + j h ¯¯¯ h + - A ,. + RÞTU? +
Z@\ . Since
¸ Á 3 ú >
¡Í`Î g A n + ¡Í`Î g t 3 A a? 3 ú ADa ^
+ + 3 ! #)$ ú
!# 3
$ ! /0 $ ! /0 $
So we have, ¸
n a1! #)$ t ^ A l
+ ú
!# 3
> > Á
Next, let À denotes the upper bounds of J G :@? J : a? , then
e >
G :@?#A lon À£a ! #)3 $ ú tº^
!#
Hu
H0fg
Finally, we have
e > e > e >
G :@?ðA G @ : ?@R G :@?
H H fg HX
H fg H fg
e >
A G :@? hml n £ À a ! #)$ ú t ^
!# 3
H fg
This proves the Theorem.
Now the Corollary 1 follows from the Theorem, the asymptotic formula
e > >
N :@?BADa p7r a h v RTU?)a hmlon a è3 t
H0fg
> Á Á
(see [2]), and the estimate N :@* ? 2 a é (for all T : a ). And then, the
Corollary 2 follows from the Theorem, the asymptotic formula

e > z
p
r 7
p r h ¥
h l a
:@?#ADa a a pÏÐ a
H0fg ´
> Á Á
(See [3]), and the estimate :@3 ? 2Èa é (for all T : a ).
´
On the Smarandache pseudo-multiples of sequence 19
References
House, 1993.
[2] Tom M. Apostol. Introduction to Analytic Number Theory. New York:
[3] G.H. Hardy and S. Ramanujan. The normal number of prime factors of
a number : . Quart. J. Math. 48(1917), 76-92.
AN ARITHMETIC FUNCTION AND THE DIVISOR
PRODUCT SEQUENCES
Zhang Tianping
tianpzhang@eyou.com

Abstract Let be any positive integer, 465 denotes the product of all positive divisors

5
of . Let be a prime, denotes the largest exponent (of power ) such

that divisible by . In this paper, we study the asymptotic properties of the mean

8
value of 465 , and give an interesting asymptotic formula for it.
Keywords: Divisor product sequences; Mean value; Asymptotic formula.

9
1. Introduction
>
Let : be any positive integer, 7 :@? denotes the product of all positive
> > TU?A TE87 > v!?A
divisors of : . That is, 7 :@?yA < N . For example, 7
ç
> >® <4>
v58E 7 x!?¹Adx5E87 ?×A9+5E¯¯¯U^ Let
be a prime, L :@? denotes the largest ex-
ponent (of power ) such that ß H J : . In problem 25 and 68 of reference [1],
Professor F.Smarandache asked us to study the properties of these two arith-
metic functions. About these problems, many scholars showed great interests
in them (see references [2],[3]). But it seems that no one knows the relation-
ship between these two arithmetic functions before. In this paper,< we >_; < shall
>
use the elementary methods to study the mean value properties of L :@?`? ,
and give an interesting asymptotic formula for it. That is , we shall prove the
following conclusion:
Theorem. Let be a prime, then for any real number a b·T , we have the
asymptotic formula
e <> > a pzr a

L 7 : ?`?ÔA
@ >
H fg RTU?
> > h s h{ j Ræv ïh
RTU? s v RmTU?]R;:¶v =<
T?> pzr] > è
h > < a hml a 3 Zé ?VE
RTU?
where is the Euler constant, and denotes any fixed positive number.
Taking Awv , x in the theorem, we may immediately obtain the following
«
e > > T pzr h vR pzr vºRT hml > è3 Zé
L j 7 :@?`?ÔA a a a a ?V¼
H fg v v

e > > T pzr x pzr xR
+RT@ > è
L s 7 :@?`?ÔA « a a h a hml a 3 Zé ?V^
H fg v
9
2. Some lemmas
To complete the proof of the theorem, we need the following simple lem-
mas:
Lemma 1. For any positive integer : , we have the identity
> :@?#AD:
58A
è B E
7
>
where N :@? is the divisor function.
Proof. This formula can be immediately got from Lemma 1 of [2].
Lemma 2. For any real number ayboT , we have the asymptotic formula

e > e pzr] T j hml > è3 Zé
N :@?BADa p7r a h vRmT h v < < TR a ?VE
0
H
f g W RmT ç W

H W \
where < denotes the product over all primes, is the Euler constant, and
ç
denotes any fixed positive number.
µi> T j
Proof. Let A£a \ j E â?A < T[R ^ Then by the Perron formula
ç ã
(See Theorem 2 of reference [4]), we may obtain
è Z
Êÿþ
e > T > µi> a ã > è
N :@?BA ÿ
Ê þ j â,? â? N5â hl a 3 Zé ?VE
v,Fõû{ü è ä â
H fg
H W \
>
where â? is the Riemann-zeta function.
ä
Moving the integral line from s F to \ F . This time, the function
j j
> > µi> a ã
G â,?ÄA j â,? â,?
ä â
has a second order pole point at âºAªT with residue

e pzr] T j
a p7r a h v R T h
v < TR ^
W R T <ç W

So we have
T Z ÿÊ þ è è3 Z Êÿþ è3 Êÿþ è ÿÊ þ > µ > a ã
~ h h h
v,Fõû ü è ÿ
Ê þ ü è Z ÿ
Ê þ ü è3 Z Ê ÿ þ ü è3 Êÿþ ä j â ? â?
â
N â

e pzr] T j
ADa pzr a h v RT h v < < T¢R ^
W RT ç W
Note that
T è3 Z Ê þ è3 Êÿþ è
Êÿþ
> µ > a ã
~ h h j â? â? N â
v,F)û ü è Z ÿ
Ê þ ü è3 Z Ê ÿ þ ü è3 Ê þ ä â
è
2 a 3 Zé ^
From the above we can immediately get the asymptotic formula:

e > e pzr] T j hml > è3
N :@?BADa p7r a h v RT h v < < TR a Z é V? ^

R T ç
H0 fg W W
H W \
This completes the proof of Lemma 2.
Lemma 3. Let be a prime, then for any real number a.b·T , we have the
following asymptotic formulae

e } a
hml
| A > g E (1)
| fg RmTU?kj
e } j j hy hml ~ a j
| A > g2 E (2)
| fg RTU? s
e } s s h j h s
> hml ~ a
| A g ^ (3)
| fg RTU? <
> >
Proof. We only prove formula v!? and x!? . First we come to calculate
e } j | ^
GA
| fH

T eH } j e H } j
G TR Ô A | R | Z@\
|! \ |! \
H e \ > }h
T : j h TU? j R } j
A R H Z@\ | Z@\
|! \
He \

T : j h v }h T
A R H Z@\ | Z@\
|! \
and

T j
G TR B

H e \
~ T R : j h v }h T T
A H Z@\ | Z@\ TR B
|! \
H0e \ e H
T T h : j Rc: j h v }h T v } R T
A R H Z j | Z@\ R | Z@\
j |! \ |!
j
H0e \ >
T h v h : j Rc: j h v h : j Rc: j R v,:RTU?
A H Z j | Z@\ H Z j
j |!
> H \ j>
T h v R TU? h
: j R : j h v,:RTU?
A H Z@\ R H H Z j ^
So we have
> >
~ T h v H \
R TU? h : j R : j h v,:RTU? T
G A H Z@\ R H H Z j n TR <\ j
t
> >
h v H \
R TU? h : j R : j h ,v :RTU?
A > H j > RUT ? s H > ^
RmTU?kj RTU?kj
Then we can immediately obtain
e } j
A > h >
v h¥l~ a j
| s g
2
| fg RTU?kj R TU?

j
h
hml ~ a j
A > g ^
RTU? s
>
This proves formula v!? . >
Now we come to prove formula ! x ? . Let
e } s | ^
ïA
| fH

T
T[R
eH } s e H } s
A | R | @
Z \
|! \ |! \
H \ > } h
T : s h e TU? s R } s
A R H Z@\ | Z@\
|! \
T : s h e H x } j Ræx }yh T
A R H Z@\ | Z@\
|!
j
T : s h H \
R T H0 j m
A R ~ v : h R T x
H Z@\ H Z@\ R H R j
R H Z@\ H Z@\ R HO TR
<\
>
h ~ : j h ~ ,v :RT h v H s RTU? T x
R R < <\
j H @
Z \ s H @
Z \ H @
Z \ R H T¢R \ TR
ih ½ H \ RT h > xQR « :@?
j h T h x,:Ræx,: j h{ 0
A > H > RTU?
RTU?kj
« > H s > >
: s
h RTU?]Ræx H0 j RmTU? RmTU?
R H Z@\ H0 \ > RTU? s ^
Then we have
} s ih ½
e ~ j h T h T h ¬QR x hml~ a
s
| A > > >
| fg RTU? j RTU? RTU? s R T
m g
s h
j h{ h¥l ~ a
s
A > g ^
RmTU? <

9
In this section, we shall use the above >
lemmas < > to complete the proof of the
Theorem. From the definition of 7 :@? and L :@? , we may immediately get
e < > >
L 7 :@?`?
H fg
> }yh > }h
e TU? } > E e TU? } e > E
A < D C N B
? A < C < N ?
v fg v
< C f g f
< gUC
\ \
> }h
e TU? } ~ a z
p r a h h v pzrÄ T j
A < | | v RmT
T[R
| f¡ gU!¡ v RT
h l n a è3 Zé t
> }h
a T j pzr h h v pzrÄ e TU? }
A TR a v

R T |
v RT | f¡ gU!¡ <
> }h
a pzr] e TU? } j h¥lon è3 Zé
R < | a t
v | f¡ gU¡

a T j pzr pzrÄ
A TR a h v RT h v
v RT
h { p7r j a
F ~ > j h > h l ~
m
RTU? s RTU?kj a ¢

a pzr@ ~ s h j h{ h j h{ hm l ~
7p r s a
hml n a è3
Z ét
R > >
v RTU? < RTU? s a ¢
> > s h{
a p7r a h RmUT ? s v RUT ?ÄR;:®v < h j R v h T?> p7r]
A > > a
RmTU? RTU? <
h lon a è3 Zé t¹^
References
House, 1993.
[2] Liu Hongyan and Zhang Wenpeng. On the divisor products and proper
divisor products sequences. Smarandache Notions Journal, 2002, 13: 128-133.
[4] Pan Chengdong and Pan Chengbiao. Elements of the analytic number
THE SMARANDACHE IRRATIONAL ROOT SIEVE
SEQUENCES
Zhang Xiaobeng
zxb1231@163.com
Lou Yuanbing
College of Science, Tibet University, Lhasa, Tibet, P.R.China
yblou@hotmail.com
Abstract In this paper, we use the analytic method to study the mean value properties of
the irrational root sieve sequence, and give an interesting asymptotic formula for
it.
Keywords: Smarandache irrational root sieve; Mean value; Asymptotic formula.

9
1. Introduction
According to reference [1], the definition of Smarandache irrational root
½
sieve is: from the set of ¸natural numbers (except and T ):
-take off all powers of v ¸ , bv ;
-take off all powers of x ¸ , bv ;
-take off all powers of ¸ , bv ;
«
-take off all powers of ¸ , bv ;
-take off all powers of ,¸ bv ;
½
-take off all powers of T , bv ;
« ½
¯¯¯ and so on (take off all -powers, ëb v ). For example: v5E¤x5E¤5E E ET µ E
TTETv5ETx5ET ET5ET EU?T +=ET¬[¯¯U¯ are all irrational root sieve sequence. Let
denotes the set of all the irrational root sieve. In reference [1], Professor F.
Smarandache asked us to study the properties of the irrational root sieve se-
quence. About this problem, it seems that none had studied it, at least we have
not seen such a paper before. In this paper, we study the mean value of the
irrational root sieve sequence, and give an interesting asymptotic formula for
it. That is, we shall prove the following:
>
Theorem. Let N :@? denote the divisor function. Then for any real number
ayboT , we have the asymptotic formula
e >
N :@?
H()
H fg
x G µ h µ a 3 pzr a h µ a 3 h µ G a pzr a
A a'R a pzr a h pzr
\ a 3 j a j s <
û2j
h > µ H
I G µ J 3 hml n L 3 è K Zé
I
v RTU?)a h a h a a K t E
µ µ µ
where
µ µ H denotes
I µMJ any fixed positive number, is the Euler constant, \ E j E s E
< E E are the computable constants.
9
2. Some Lemmas
To complete the proof of the theorem, we need the following lemmas:
Lemma 1. For any real number ayboT , we have the asymptotic formula:
e > >
N :@?BA³a pzr a h v RTU?)a hml£n a 3 è KK Zé tE
L
H fg
where denotes any fixed positive number and is the Euler constant.
Proof. This result may be immediately got from [2].
Lemma 2. For any real number ayboT , we have two asymptotic formulae
G
e > x a zp r j a h \ G G
a hmlon a 3
L Z é
N : j ?BA a pzr a h j t ¼

û2j v
H fON g
«@P P P
e > a 3 pzr s a h \ P h{l£n a Q 3
Z é
N : s ?#A ê a 3 zp r j a h j a 3 p7r a h s a 3 t E
v@,û < ¬ x
H0fg 3
P P P P
where \ E j E E \ E j E s are computable constants.
ê
Proof. Let >
> e N : j ?
G â?ÄA É E
H \ :Úã
>
Re â,?'Ý T . Then
> from the Euler product formula [3] and the multiplicative
property of N :@? we have

> x h h
G â,? A < T h s ã
h ¯¯¯

ç ã j(ã

T \ v h v h v h
A < [
T R T h s ã ¯¯¯
ç ã ã j(ã

T \ v T j
A ~ TR h T [ R
<
ç ã ã ã

T j T
A < TR T h
ç ã ã
s > â ?
A ä > ^
vâ?
> ä ½
where â,? is the Riemann zeta-function. By Perron formula [2] with â A ,
ä è3 s ê
ADa and A , we have
j
è Z
Êÿþ s >
e > T â,? a ã è
N : ?BA j Ê þ ä > N â hml n a 3 Zé t ^
H0fg vûFÄü è vâ? â
ä
To estimate the main term
è Z
Êÿþ s >
T â? a ã
ÿ
Ê þ ä > N5â!E
vûFÄü è vâ? â
ä

we move the integral line from âyA s F to âyA \ F . This time, the
j j
function
> s > â,? a ã
G â?#A ä >
vâ? â
ä
has a three order pole point at âAªT with residue

s > j
pzìzí T ~ > â¢RTU? s ä > â? a ã A
x
a pzr j a h pzr a h
îã \ v5K \ a j aÚE
vâ,? â û j
ä
where \ E j are the computable constants.
Note that
Êÿþ s > ,â ? a ã
~ è
h h ä > N âR2Èa 3 Zé ^
v,Fõû ü è Z Êÿþ ü è3 Z ÿÊ þ ü è3 ÿÊ þ vâ? â
ä
From above we may immediately get the asymptotic formula:
e > x,a pzr j a h è
N : j ?ÔA \a
pzr a h
j a hml n a 3 Zé t ^
H0fg û2j
That is,
G
e > x a zp r j a h \ G G
a hmlon a 3
L Z é
N : j ?BA a p7r a h j t ^

û2j v
H fON g
This proves the first formula of Lemma 2.
Similarly, we can deduce the second asymptotic formula of Lemma 2. In
fact let >
> e N : s ?
â?BA É E
H \ :Úã
>
Re â,?'Ý T . Then > from the Euler product formula [3] and the multiplicative
property of N :@? we have
½
> h h h T h
â,? A < T ¯¯¯
ç ã j(ã s ã

T \ x h x h x h
A < [
T R T h s ã ¯¯¯
ç ã ã j(ã

T \ x T j
A ~ T¢R h [
T R
<
ç ã ã ã

T j v
A < T[R T h
ç ã ã

< >
â,? T
A ä > < TR > h ^
j vâ? ç ã TU? j
ä
>
where â,? is the Riemann zeta-function. Then by Perron formula [2] and the
ä
method of proving the first asymptotic formula of Lemma 2 we may immedi-
ately get
e «
> s P P P P hml£n a è 3 Zé t^
N : ?ÔA < a pzr=s a h \ a pzr j a h j a pzr a h s a
û ê
H0fg
That is,
«@P P P
e > a 3 pzr s a h \ P
N : s ?#A ê a 3 zp r j a h j a 3 p7r a h s a 3
h{l£n a Q 3
Z é
t E
v@,û < ¬ x
H0fg 3
This proves the Lemma 2.

9
Nowµ we completes the proof of the Theorem. According to the definition of
the set and the result of Lemma 1 and Lemma 2 , we have
e >
N :@?
H
H0fg
e > e > e > e e > ¸
A N @ : ?]R N : j ?@R N : s ? hml
N : ?
H fg H f g ¸
N H fg 3 < f f è H fg 3
! #S ²
!#
e > e > e > e
A N @ : ?]R N : j ?@R N : s ? hml
a ²3
Z é

H fg ¸
H fON g H fg 3 < f f è
! #S
!#
G
~ a R x a zp r a h µ pzr h µ a 3 zp r a h µ a 3 h µ G
A \ a 3 j a j s < a pzr a
û2j
h > vRTU?)a h µIH G a h I µ J 3 hml n L 3 è K Zé
a a K t E
µ Ê «
where (F#AYTE¤v5E¯¯¯ E ) are computable constants.
References
House, 1993.
A NUMBER THEORETIC FUNCTION AND ITS MEAN
VALUE
Lv Chuan
phoenixlv@eyou.com

Abstract
be a prime, T
Let denote the largest exponent of power
which divides

. In this paper, we study the properties
e of this sequence T , and give an

interesting asymptotic formula for T - .
VU S
Keywords: Asymptotic formula; Largest exponent; Mean value.
9
1. Introduction
<>
Let be a prime, W :@? denote the largest exponent of power which di-
vides : . In problem 68 of [1], < > Professor F.Smarandach asked us to study the
properties of the sequence W :@? . This problem is closely related to the factor-
ization of :#K . In this paper, we use e elementary methods to study the asymptotic
<W >
properties of the mean value W :@? , and give an interesting asymptotic
H fg
formula for it. That is, we will prove the following:
½
Theorem. Let be a prime, Còb be an integer. Then for any real number
e <W > RT <> >
W :@?#A L C{?)a hml pÏÐ!W[Z@\ a?VE
H fg
<>
where L C{? is a computable constant.
Taking CòATE¤v5E¤x in the theorem, we may immediately obtain the follow-
ing
e <> T >
W :@?BA a hml pÏÐ j a2?V¼
H fg RT
e ïh
< > T >
W j :@?BA > a hml pÏÐ s a2?V¼
H fg RTU? j

e <s > j h ih T hml > pÏÐ <
W :@?BA > a a?V^
H fg RTU? s
9
In this section,
<> we complete the proof of the theorem. In fact, from the
definition of W :@? we have
e <W > e e } W A e } W e
W :@?ðA < < )X X T

H0fg fg X < f g | f fX < S
\ ! /0VS
! /0

\

e } W RT a h l > UT ?
A |
| f
! /0S
! /0
RT e } W e
A a hl }ÚW ^
|
| f | f
! /0VS ! /0S
! /0 ! /0
Let
<4> e : W
H E L C{?BA É
H \
< >

then L { C ? is a computable constant. Obviously we have
e } W e : W e } W
| A É H R |
| f H \ |6Y
! /0S ! /0VS
! /0 ! /0
n ¡Í`Î5<g h W
<> T e ¡Í`Î t
A³L C{? hml )\ X É
H
[Z ! /0S \
! /0
< > pÏÐ a W e TX
C{? m h l ~ a ¹ \ ~
A³L p ÏÐ2 X É
\

p
Ï Ð a W \ e
h P \ X h
W pÏÐO X É ¯ ¯¯ ¢
\
< >

A³L C{? hmlon a \ pzÏÐ WZ@\ aut (1)
and
l e }@W A l n pÏÐ WZ@\ a t ^

(2)
| f ] ^`_
! /0VS
From (1) and (2) we have

e <W > RT n
< >
W :@?ðA a L { C ? hlon a \ pÏÐ W aXt=t hml£nqpÏÐ W[Z@\ aXt
H fg
RT < > n pÏÐ W[Z@\ a t ^

A L C{?)a hl
<>
This completes the proof of the theorem. As to L C{? , it is easy to show that
< >½ e T T
L ?BA É H A E
H \ RT
and
>
<4> e : h TU? W
¯UL C{?]RT¹A É H
H \
e : W h P \ e : W \ h P W \ eÉ : h e T
A É H W É H ¯¯¯ h W H É H
H \ H \ H \ H \
<> P \ L <> CRTU? h ¯ ¯¯ h P W \ L <> TU? h L <> ½
A L {
w C ? h W W ?VE
so we have
<> T n P \
< > P W \ L
< > h <> ½
L C{?BA W L C RTU? h ¯¯¯ h W UT ? L ? h TtQ^
R T

<4>
From this formula, we can easily compute the first several L C{? :
<> <X> j {
h < >
s h j h{
L TU?BA > E(L v!?BA > s E(L ! x ?ÔA > E¯¯¯
RTU?kj RTU? RTU? <
Then use the Theorem, we can get the Corollary.
References
House, 1993.

ON THE PRIMITIVE NUMBERS OF POWER AND
ITS TRIANGLE INEQUALITY
Ding Liping
dingding 136@elong.com
Abstract The main purpose of this paper is using the elementary method to study the

properties of , and give a triangle inequality for it.
Keywords: Primitive numbers; Arithmetical property; triangle inequality.

9
1. Introduction
;X<>
Let be a prime, : be any ;I<4> fixed positive integer,
:@? denote the smallest
positive integer such that @
: V
? K is divisible by H . For example, ; > TU?Ax ,
; > « ; > ; >® ; > s
s v!?QA , s x!? A¿¬ , s ?QAå¬ , s !?QA Tv , ¯¯¯ . In problem 49 of book
[1],
;=<4> Professor F. Smarandache asks us to study the properties of the sequence
:@? . About this problem, some asymptotic properties of this sequence have
been studied by many scholar. In this ;I<paper,
> we use the elementary methods to
study the arithmetical properties of :@? , and give a triangle inequality for it.
That is, we shall prove the following:
Theorem 1. Let be an odd prime, C Ê be positive integer. Then we have
the triangle inequality
¸ ¸
;4< ~ e Á e ;=<> Ê
C Ê C ?V^
Ê \ Ê \
>
Theorem 2. There are infinite integers C Ê Ä F AªTE¤v5E¯¯¯,E¤u^ ? satisfying
¸ ¸
;4< ~ e Ê
e ;=<> Ê
C A C ?V^
Ê \ Ê \
9
In this section, we complete the
;I<proof
> of the theorems. Õ First;=4
we prove the-
orem 1. From the definition of :@? , we know that W J < > C Ê ?VK , Wba J
;=<4>
Cdc ?VK (FMA
e f ). From this we can easily obtain:
Õ Õ
W W a A
b W ZuWba J ;=<> C Ê ?VK ;4<> Cdc ?VK J >_;=<> C Ê ? h ;4<=> Cdc,?`?VK^ (1)
;<4> ;<=>
But from the definition of :@? , we know that :@?VK is the smallest positive
integer that is divisible by H . That is
Õ
IW Zug W aJ ; < > C Ê h C c ?VK^ (2)
From (1), (2) we can immediately get
;=<4> Ê h Á ;=<4> ;=<4>
C CdcU? C Ê? h Cdc ?V^
Now the theorem 1 follows from this inequality and the induction.
Next we complete
Á Á the proof of theorem
> 2. For any positive
| ¾
integers C Ê with
C Ê AD C c (T
e d F¤Ehf }
), we let A } E`:@? satisfy :#K . Then
} A } > E`:@?ÔA e :
É c Ì ^
c \Ë
Õ <
For convenient, we let Ê A -< \ . Since
\
Õ Õ
e W Õ Õ W R T

IW \]hyIW j h ¯ ¯¯ h Aw Ê ^
É i Ì A T×A
i( \ Ë RmT
So we have
; < > Õ
Ê ?BA W E F]AdTE¤v5E¯¯¯ E¤u^ (3)
On the other hand,
jk ¸ mon
k e Õ n
k
k
W n
n ¸ Õ ¸
e k Ê \ n e W R T
e
É i A A Ê^
i( \ Ê \ RT Ê \
l p
So
¸ ¸
;=< ~ e e Õ
^ Ê A XW (4)
Ê \ Ê \
Combining (3) and (4) we may immediately obtain
¸ ¸
;=< ~ e e ;=<4> Ê
Ê A ?V^
Ê \ Ê \
References
[1] Jozsef Sandor, On an generalization of the Smarandache function, Note
Numb.Th.Diser.Math. 5(1999),41-51
[2] Tom M A. Introduction to Analytic Number Theory. New York, 1976.
THE ADDITIVE ANALOGUE OF SMARANDACHE
SIMPLE FUNCTION
Zhu Minhui
1. Math and Phys Dept, XAUEST, Xi’an, Shaanxi, P.R.China
xiao-zhu123@sohu.com
rq!
Abstract The main purpose of this paper is to study the asymptotic properties of ,
and give two interesting asymptotic formulae for it.
Keywords: Smarandache-simple function; Additive Analogue; Asymptotic formula.

9
;>
For any positive : , the Smarandache function :@? is defined as the smallest
CM Z , where : J C.K . For a fixed prime , the Smarandache-simple function
;=<4> à Z
:@? is defined as the smallest C à , where H J C.K . In reference [2],
Jozsef Sandor ;4<> introduced the additive analogue of the Smarandache-simple
function a? as follows:
; < > ts g Á >
a?BA í'ìzr °Còà C.K ±!E@a{à TEu ?VE
and ;3< v > ws Á
a2?BA í&% '
°C à C.K g ±!EÄayàx TEu ?VE
;<4>
which >`> is defined on a subset of real numbers. It is clear that a?AÑC if
ayà CwRyTU?VKE`C.K for CòbDv (for CÑAdT it is not defined, as ;> 0!=1! ), therefore
this function is defined for abdT . About the properties of :@? , many;2<4people >
had studied it before (See [2], [3]). But for the asymptotic formula of a? , it
seems that no one have studied it before. ;X<=> The main purpose of this paper is to
study the asymptotic properties of a2? , and obtain an interesting asymptotic
formula for it. That is, we shall prove the following:
Theorem 1. For any real number a{bv , we have the asymptotic formula

;=<> a pzr] hml a pzrpzr a
a2?#A pzr a p7r j a ^
Obviously, we have
;{< v > > > >
;=<4> a2? h TE F)G a{à C.KE C h TU?VK ? C boTU?
a?BAzy ;{< v > > >
a2?VE )F G aA C h UT ?VK Còb£TU?
Therefore, we can easily get the following:

Theorem 2. For any real number a{bv , we have the asymptotic formula

; <v > a pzr] hml a p7rpzr a
a?BA pzr a pzr j a ^
9
2. Proof of the theorem
In this section,
;<> we complete> the proof of the Á theorem 1. In fact, from the
definition of a? , we have CÈRªTU?VK Â g C.K and taking the logistic
computation in the two sides of the inequality, we get
We \ Á eW
pzr FBÂma pzr] pzr F¤^ (1)
Ê \ Ê \
Then using the Euler’s summation formula we have

eW p7r F
W
pzr Å N Å h
W >®Å Å > Å Å Å
A R| ®? pzr ?~} pzr N
Ê \ ü \ ü \
A C pzr CR C hml > pzr C{? (2)
and
We \ W \ W \ >®Å
pzr F A pzr Å N Å h Å > Å
R| ®? pzr ?~N
Å
Ê \ ü \ ü \
A C pzr CRcC hml > zp r C{?V^ (3)
Combining (1),(2) and (3), we can easily deduce that

>
a pzr] ADC pzr CRcC hml pzr C{?V^ (4)
So
a pzr] hl > TU?V^
CÑA pzr (5)
C RT
Similarly, we continue taking logistic computation in two sides of (5), then we
also have
p7r CÑA pzr a hl > pzrpzr C{?V^ (6)
and
p7rpzr CÑA l > p7rpzr a?V^ (7)
The additive analogue of Smarandache simple function 41
Hence, by (5), (6) and (7) we have

;=<> a pzr] hml > UT ?
a2? A pzr a hml > pzrp7r C{ ?]RmT
a p7r] h l > pzrpzr C{?
A pzr a a p7r] zp r a pzr a hml > pzrpzr {
>
C ?]RmT,?
a p7r] hml a pzrpzr a
A pzr a p7r j a ^
References
House, 1993.
[2] Jozsef Sandor. On additive analogue of certain arithmetic functions,
Smaramche Notes Journal 2004, 14: 128-132.
[3] Mark Farris and Patrick Mitchell, Bounding the smarandache functoin,
Smaramche Notes Journal 2002, 13: 37-42
[4] Tom M.Apostol, Introduction to Analytic Number Theory, Springer-
Verlag, New York,1976.
¦
ON THE -POWER COMPLEMENT SEQUENCE
Yao Weili
mimi5512867@126.com
Abstract The main purpose of this paper is using analytic method to study the asymp-
totic properties of © -power complement sequence, and give several interesting
asymptotic formulae.
Keywords: © -power complement sequence; asymptotic formula; mean value.

9
1. Introdution
>
For any positive integer
> : b v , let ¸ :@? denotes -power complement
>
sequence. That is, ¸ :@? denotes the smallest integer such that : ¸ :@? be a
perfect -power. In problem 29 of reference [1], professor F.Smarandache
asked us to study the properties of this sequence. About this problem, some
people had studied it before, see references [4]and [5]. The main purpose
of this paper is using the analytic method to study the asymptotic properties
of -power complement sequence, and obtain several interesting asymptotic
formulae. That is, we
> shall prove the following :
Theorem. Let N :@? denote the Dirichlet divisor function, then for any real
number ayb£T , we have the asymptotic formula
e > ¸ ¸
N :
¸ > :@?`?BA³a >¶µ pzr a h
µ p7r \ a h ¯¯¯ h
µ ¸ hml > è3 Z
? a ?VE
ê \
H0fg
µ µ µ
where , \ , ¯¯¯ , ¸ are computable constants, is any fixed positive num-
ê
ber.
From this theorem, we > may immediately deduce the following
Corollary 1. Let L :@? be the square complement sequence, then for any
real number ayboT , we have
e > > >¶µ zp r P > è

N O : L :@?`?ÔADa j a h p7r a h ? hml a 3 Z ?VE
H0fg
µ P
where , , are computable constants.
>
Corollary 2. Let :@? be the cubic complement sequence, then for any real
number aboT , we have
e > > > pzr4s a h P pzr j a h p7r a h ? hml > a è3 Z ?VE
N : :@?`?BADa \ \ \ \
H0fg
P
where \, \ , \ and \ are computable constants.
9
In this section, we shall complete the proof of the Theorem. Let
> >
> e N : ¸ :@?`?
G â?#A É ^
H \ :Úã
>
From the definition of ¸ :@? , the properties of the divisor function and the
Euler product formula [2], we have
> ¸ > `? ? >

>
> ~ T h N h j ¸ j ?`? h
N
G â? A < ¯¯¯
ç ã j(ã
> ¸ > ¸ > ¸ > ¸
~ T h N ? h ¯¯¯ h N ¸ ? h N ¸ j ? h N j ? h
A < Z \) ã
@ ¯¯¯ h ¸ ¯ ¯¯
ç ã ã j ã

h T h
h ¯ ¯¯ h ¸ T h v ¸
h T h v h ¸ T h
A < T h Z@\) ã ¯¯¯ h ¯ ¯¯
ç ã ã j ã
< \ó
T T F TR
A < T h < \ó
F
<U²\ ó
F T h < \ ó
ç TR ã TR T[R
² ²
> h
A â? < T h > ¸
ä ç ã ã ã#RTU?
¸ ¸ ¸ ¸
Z@\ > â,? n Ê t ã
h ¸ ã ¸ e
A ä > ¸ < T > > R Ê> ¸
E
vâ?{ç ã ã h TU? ã RTU? Ê ¸ ã ã h TU?
ä j f f
>
where â? is the Riemann Zeta function. Obviously, we have
ä
¸ >@ Á >
: ?`? Á JN > :
T ¸ > :@?`? J e N :
:#E ÷ É ÷ ù E
÷ :Oø ÷ RT
÷H \ ÷
÷ ÷
ù ÷ ÷
where is the real part of â . Therefore by Perron formula [3]
> ¸ >@

e N : : ?`?
É
H \ :Úã)ú
On the -power complement sequence 45
Z Êÿþ > > h ù

A
T
G â h â ? a ã N â ¥h l ~ a
?
ê
ü ý Ê þ
vûF y ê â ý

> p
Ï Ð a > a
h l ý a \ ø ú ,v a? íìzr 0
° TE ± m h l a øú ? íì7r °0TE ¾ ¾ ± E
a

where be the nearest integer to a , ¾ a ¾ A J aR
J . Taking â A ½ , A s ,
> >ù \ , then we have ê j
ADa , aB ? A³a , ?BA
ø \
è Z
Êÿþ ¸ Z@\ >
e > ¸ > T â? > a ã h l > a è3 Z V? E
N : :@?`?BA ÿ
Ê þ ä ¸ > á ,â ? N â m

H0fg vûF ü è vâ? â
ä
where
¸ ¸ ¸
n Ê t ã
> ã e
á â?#A < T h > h ¸ > ¸ R Ê> h ¸ D
^
¸ ã
ç ã ã TU? ã#RTU? fj Ê f ã TU?

è Z
Êþ ¸ @ Z \ > â? > a ã
T ¸
ä > á â? N5â!E
vûFÄü è ÿÊ þ v â,?
â
ä

we move the integer line from âAwx v F to âAªT v F , then the function
¸
Z@\ > â? > a ã
ä > ¸ á â,?
vâ? â
ä
have one h T order pole point at âAªT with residue
> ¸
> ¸ ¸ > á â?)a ã
p7ìzí T â×RTU? @
Z \ @
Z \ â,? ¸ >
ã î \ uK ä vâ? â
¸ ¸ ¸ ä ¸ >
7
p z
ì í T n n > @
Z \ @
Z \ > á â?)a ã
A t â¢RTU? â? t ¸ >
ã î \ uK ê ä
ä vâ,? â
¸ ¸ ¸ ¸ >
hën t n > â×RTU? Z@\ Z@\ > â?kt )
\ á ¸ â,?)a ã h
\ > ¯¯¯
ä vâ,? â
> ä ¸
¸ ¸ ¸
h n ¸ t > â¹RmTU? Z@\ Z@\ > â? á ¸ > â?)a ã
ä vâ? â
>¶µ pzr ¸ µ ¸ ä µ
A a a h pzr \ a h ¯¯¯ h ¸ ?VE
ê \
µ µ µ
where E \ E¯¯¯UE ¸ are computable constants. So we can obtain
ê
Êÿþ ¸
T ~ è Z è3 Z Êÿþ è3 Ê þ è
Êÿþ Z@\ > â ?)a ã >
h h h ä ¸ > á â,?kN5â
vûF ü è ÿÊ þ ü è Z Ê þ ü è3 Z Êÿþ ü è3 ÿÊ þ vâ? â
>¶µ pzr ¸ µ zp r \ h¸ µ ¸ ä
A a a h \ a ¯ ¯¯ h V? ^
ê
Note that the estimates

¸
T è3 Z Êÿþ Z@\ > â,?)a ã >
è
÷ ä ¸ > á â?kN â ÷ 2 a 3 Z E
÷ vûFÄü è Z ÿÊ þ vâ,? â ÷
÷ ä ÷
÷ ÷
÷ ÿ
Ê þ ¸ ÷
T è Z \ > â,?)a ã >
@
÷ ä ¸ > á â ?kN â ÷ 2 a è3 Z E
÷ vûF ü è3 Êÿþ v ,
â ? â ÷
÷ ä ÷
÷ ÷
and ÷ ¸ ÷
T è3 Êÿþ Z@\ > â,?)a ã >
÷ ä ¸ > á â ?kN â ÷ 2 a è3 Z ^
÷ vûF ü è3 Z Êÿþ vâ,? â ÷
÷ ÷ ä
÷ ÷
Therefore we get ÷ ÷
e > > >¶µ pzr ¸ h µ p7r ¸ \ h µ ¸ hml > è3 Z
N : ¸ :@?`?BA³a a \ a ¯ ¯¯ h ? a ?V^
ê
H fg
This completes the proof of the Theorem .
References
[1]. F. Smarandache. Only Problems, Not solutions. Chicago: Xiquan
Publishing House, 1993.
[2]. Apostol T M. Introduction to Analytic Number Theory. New York:
Springer- Verlag, 1976.
[3]. Pan Chengdong and Pan Chengbiao. Foundation of Analytic Number
Theory. Beijing: Science press, 1997.
[4]. Zhu Weiyi. On the -power complement and -power free number
sequence. Smarandache Notions Journal, 2004, 14: 66-69.
[5]. Liu Hongyan and Lou Yuanbing. A Note on the 29-th Smarandache’s
problem. Smarandache Notions Journal, 2004, 14: 156-158.
ON THE INFERIOR AND SUPERIOR FACTORIAL
PART SEQUENCES
Li Jie
jli0815@126.com
Abstract The main purpose of this paper is using the elementary method to study the con-
vergent property of an infinite series involving the inferior and superior factorial
part sequences, and give an sufficient condition of the convergent property of the
series.
Keywords: Inferior factorial part; Superior factorial part; Infinite series.

9
1. Introduction
>
For any positive integer : , the inferior factorial part denoted by L :@? is the
« « «
largest factorial less than or equal to : . It is the sequence:

T ¤
E 5
v ¤
E 5
v ¤
E 5
v ¤
E 5
v E E E E
« « « « « « « « « « « « « « «
E E E E E E E E E E E E E E EVv E¤v E¤v > EVv EVv E¤v Eqv E¯¯¯ . On the other
hand, the superior factorial part denoted by :@? is the smallest factorial greater
« « « «
than or equal to : . It is
the sequence as follows:
T ¤
E 5
v E E E E ¤
E v q
E v E¤v E
½ ½ ½
v E¤v E¤v E¤v E¤v E¤v EVv E¤v E¤v EVv EVv E¤v Eqv EVv E E¤v ETUE v ETUv ETv Å E¯E ¯U¯!Å ^ In the
42th problem (see [1]) of his famous book l : =D
WCyâ!E

â F :Úâ ,
Professor F.Smarandache asked us to study these sequences. About this prob-
lem, it seems no one > had studied
,>
it before. In this paper, we studied two infinite
series involving L :@? and :@? as follows:
e T ; e T
A É | > E A É | > E
H \ L :@? H \ :@?
and given some sufficient conditions of the convergent property of them. That
is, we shall prove the following
}
; Theorem. Let } be any positive real} number.
Á Then the infinite series and
are convergent if ÝoT , divergent if T .
Especially, when } Awv , we have the following
Corollary. We have the identity
e T
É > AW^
H \ L j @ : ?
9
>
In this section, we will > h the proof of > the theorem. Let L :@?#ADC.K . It
Á complete
is easy to see that> if C.K :.Â C TU?VK , then L :@?BA³C.K > . So the > same number
C.K repeated C h TU?VK2R³C.K times in the sequence °UL :@?¤± :åA TE¤v5E¯¯¯z? .
Hence, we can write
> h
e T e C TU?VK!RcC.K e C¯C.K e C
A É | > A É > | A É > | A É > | \ ^
H \ L :@? W \ C.K ? W \ C.K ? W \ C.K ?
Á
It is clear that if } Ý£T then is convergent, if } T then is divergent. Using
the same method,
; we can also get the sufficient condition of the convergent
property of . Especially, when } A·v , from the knowledge of mathematical
analysis (see [2]), we have
e T e T e T
É > A É > A É AW!^
H \ L j :@? W \ CRTU?VK W ê C K
.
This completes the proof of the theorem.
References
[1] F.Smarandache. Only problems, Not solutions, XiQuan Publishing House,
Chicago, 1993, pp36.
[2] T.M.Apostol. Mathematical analysis, 2nd ed., Addison Wesley Publish-
ing Co., Reading, Mass, 1974.
A NUMBER THEORETIC FUNCTION AND ITS MEAN
VALUE
Gao Nan
School of Sciences, Department of Mathematics, Xi’an Shiyou University, Xi’an, Shaanxi, P.R.China
gaonan 0 0 ren@yahoo.com.cn

Abstract Let and

are primes, T8 denotes the largest exponent of power which
A
divides . In this paper, we study the properties
Ò of this sequence @ B , and
A
give an interesting asymptotic formula for B .
VU S
Keywords: Asymptotic formula; Largest exponent; Mean value.
9
1. Introduction
>
Let and are two primes, W :@? denotes the ¸ largest exponent ¸ of power
which divides : . It is obvious that W AY if divides : but Z@\) does not.
In problem 68 of [1],> Professor F.Smarandache asked us to study the properties
of the sequence W :@? . In this paper, we use elementary methods to study the
Ò O H
asymptotic properties of the mean value , where is a prime such
H0fg
that b , and give an interesting asymptotic formula for it. That is, we will
prove the following :
Theorem. Let and are primes with yb . Then for any real number
e
H
H fg
<\ a m h l£n a è3
Z éº if
< < t E < Ý ¼
A < \ < zp r ·
h n < \< > h Z@< \ t[a hml£n a è3
Z é¹
¡ a a ¡ RTU? t E if A ¼
j
where is any fixed positive number, is the Euler constant.
9
In this section, we will complete the proof of the theorem. Let

> e O H
G â,?#A É ^
H \ :Úã
>
H
For any positive integer : , it is clear that W :@? is a addtive function.
> So
is a multiplicative function. Then from the definition of WD :@? and the Euler
product formula (See Theorem 11.6 of [3]), we can write
<
> e O H e O -
G â?ðA É A ~ É 3
< W ã
H \ :Úã ç \
< 3 W ê < è

~ T h 3 h 3 h ¯ ¯¯
A <
ç ã\ j(\ ã
3
~ T h h j h ¯¯¯ T T
A <ç T h h h ¯¯¯
ã j(ã ã\ j(\ ã
3
> ã RT
A â,? ^
ä ã#R

½
By Perron formula (See reference [2]), let â A , AYv , Awa s j . Then we
ê
have ÿ
Ê þ
e
H T j Z > > a ã > \ Zé
A ÿ
Ê þ â,?ká â? N â hml a j ?VE
H0fg
v
û F ü j ä â
ó
> ó <
where á â?#A \ and is any fixed positive number.
Now we estimate the main term
Êÿþ
T j Z > > a ã
ÿ
Ê þ â,?ká â? N â0E
vûF ü j ä â

we move the integral line from v F to T v F .
If Ý , then function
> > a ã
â,?ká â?
ä â
have a simple pole point at âºAYT , so we have
Êÿþ \ j Z Êþ \ j Êÿþ Êÿþ
T ~ j Z h h h j > > a ã >
Ê þ ÿ
Ê þ ÿ
Ê þ ÿ
Ê þ â?ká â? N5âAwá TU?)aÚ^
vûF ü j ü j Z ü \j Z ü \j ä â
ADa è , we have

Taking
T ~ è3 Z ÿÊ þ j
Êÿþ
> > a ã
÷ h â?ká â,? N5â ÷
÷ vûF ü Z ÿ
Ê þ ü è3 Ê þ ä â ÷
÷ j ÷
÷ ÷
÷ j >ù h > a j ù ÷
2 ÷ F ?ká â,? d÷ N
ü è3 ÷÷ ä ÷
÷
÷ ÷
a j Z÷ é è 3
Z é ÷
2 ADa ¼
And we can easy get the estimate

T è3 Ê þ > > a ã
þ
> T h Å > a è3 Å è
÷ ÿ
Ê þ ,
â k
? á
â ?
N â ÷ 2 ÷ F k
? á â? Å ÷ N 2Èa 3 Zé ¼
÷ vûF ü è3 Z ä â ÷ ü ÷ä v ÷
÷ ÷ ê ÷÷ ÷
÷ ÷ ÷
Note that ÷ ÷ ÷ ÷
> ¹ R T
á TU?BA E
¹R
we may immediately obtain the asymptotic formula
e
H ºRT > è
A a hml a 3 Zé ?VE
ºR
H fg
if Ý .
If A , then the function
> > a ã
â,?ká â?
ä â ó
n > > g
have a second order pole point at âÞAÈT . Let Res â,?ká â? t denotes its
ä ã
residue, so we have
> > a ã
á WUâ
â?ká â?
ä â
pzì7í ã RT > > a ã
A â? âRTU? j
îã \
ã R ä â
pzì7í ~ ã RT > a ã > >
A â¢RTU? â,? â×RTU?
îã \
B
ã R â ä
h ã RT > a ã > > >
â×RTU? â,? â×RTU?`?
ãBR â ä
Noting that
ã R T >
ih T
pzìzí â RTU? A
¢ E
ãî \ ãÄR
> >
v
pzìzí â,? ×â RTU?BAªT
ãî \ ä
and
pzìzí > > â,? > â×RTU?`?~IA|@E
ãî \ ä
we may immediately get

> > a ã R T pzr
R T >
h T
á WUâ
â?ká â? A ¹pzr# a a h ¹pzr] RTU?
h
aÚ^
ä â v
So we have the asymptotic formula
>
e RT > ih
H
A

R U
T ? pzr a h h T hl > a è3 Zé ?VE
¹p7r] a ¹pzr] RTU?
v a
H fg
if A . This completes the proof of Theorem.
References
House, 1993.
Theory. Beijing: Science Press, 1991, pp 98.
ON THE GENERALIZED CONSTRUCTIVE SET
Gou su
Department of Mathematics and Physics, Xi’an Institute of Posts and Telecoms, Xi’an, Shaanxi,
P.R.China
Gs1013@xiyou.edu.cn
Abstract In this paper, we use the elementary methods to study the convergent properties
of the series
e 1( &

3

where is a generalized constructive number, and is any positive number.

Keywords: Generalized constructive set; Series; Convergent properties.
9
1. Introduction
;
The generalized constructive set is defined as: numbers Á formed
Á by digits
Ê
N \ E(N j E¯¯¯UE(N W only, all N being different each other, T C ¬ . That is to
say, ;
(1) N \ E(N j E¯¯¯UE(N W belong
; to
; ;
(2) If LXE belong to , then L belongs to too;
(3) Only elements ; obtained by rules (1) and (2) applied a finite number of
times belong to .
For example, the constructive set (of digits 1, 2) is : TE¤v5ETTETv5E¤v=TE¤v!v5ET!TTE
TTv5ETv=TETvv5E¤v=TTEVv=TUv5EVvv4TE¤v0vv=ET!TTTET!TT v5EUTTv4TE¯¯¯0^ And the constructive
set (of digits 1, 2, 3) is : TE¤v5E¤x5ETTETv5ETx5E¤vTE¤v!v5EVvx=E¤x=TE¤x!v5Eqxx=ETT!TEUTTUv5ET0Tx=E
Tv=TETvv5ETvx5E¤v=TTEVv=TUv5EVv=TUx5E¤v0v=TE¤v!vv5EVvv!x5EU¯¯¯0^ In problem 6, 7 and 8 of ref-
erence [1], Professor F.Smarandache asked us to study the properties of this
sequence. About this problem, it seems that no one had studied it before. For
convenience, we denote this sequence by °UL H ± . In this paper, we shall use the
elementary methods to study the convergent properties of the series
Ze
T
É | E
H \ L H
where } is any positive number. That is , we shall prove the following conclu-
sion:
Ze
T } pÏÐ C , and divergent
Theorem 1. The series É | is convergent if Ý
Á H \ L H
if } pÏÐ C .
Especially, let
; h T h T h T h T h T h
j AªT v TT Tv v=T vv
¯¯¯E
and
; h T h T h T h T h T h T h T h T h T h T h T h
s AªT ¯¯¯^
v x TT Tv Tx v=T vv vx x=T xv xx
Then we have the following; ;
Theorem 2. The series j and s are convergent, and the estimate
½ « « « ½
T v ; + @ v x T +xx@
= ; T xv=T
Â j Â « ½
L O
: N
½ ½ Â s Â

½
D
@ v T @5T¬v ¬=Tv
hold.
9
2. Proof of the Theorems
In this section, we shall complete the proof of the Theorems. ¸ First we prove
Theorem 1. Note that for ATE¤v5E¤x5E¯¯¯,E there are C numbers of digits in
the generalized constructive sequence, so we have
Ze Ze ¸
T C¸
É | Â É > ½ \ |
¸
H \ L H \ T ?
Ze ¸
C \
A C É ½ ¸
¸ T \) |
\
C
A
T¢R \ W
ê½ |
C¯0T
A ½ | E
T RcC
where we have used the fact that the series
Ze ¸
C \
É ¸
¸ T ½ \) |
\

is convergent only if its common proportion \ W ÂYTE that is } Ý pÏÐ C . This
completes the proof of the Theorem 1. ê
Now we come to prove Theorem 2.
; T h T h T h T h T h
j A T h ¯¯¯
v TT Tv v=T vv
On the generalized constructive set 55
Ze ¸
T h T h T h T h T h v¸
Â T h É ½ \
v T T
T v v T
= v v
¸ T
s
Ze ¸
T h T h T h T h T h v s v ¸ s
A T h ½ É ½
v T T
T v v T
= v v
T j ¸ T j
s
T h T h T h T h T h v F T
A T h
TR \
H
v TT Tv v=T vv v
«
+ @ v
A « ½ ^
v
On the other hand, we have
Ze ¸
; T h T h T h T h T h v ¸
j Ý T h É ½
v T T
T v v T
= v v
¸ T
s
Ze ¸
T h T h T h T h T h v s v ¸ s
A T h ½ É ½
v T T
T v v T
= v v
T s ¸
s T s
T h T h T h T h T h T T
T h
F
A H\
v T T
T v v T
= v v
Tv T[R
½ «
T v
A ^
@D
This proves the first part of Theorem 2.
Similarly, we can prove the second part of Theorem 2. This completes the
proof of the Theorems.
References
House, 1993.
ON THE INFERIOR AND SUPERIOR PRIME PART
Lou Yuanbing
yblou@hotmail.com

Abstract For any positive integer , inferior prime part function is defined as the

largest prime number less than or equal to , and superior prime part function
,

4 is denoted as the smallest prime number greater than or equal to . The

main purpose of this paper is using the important works of D.R.Heath Brown

5

to study the mean value of and 4 , and give two sharp asymptotic
formulae.
Keywords: Inferior prime part; Superior prime part; Mean value.

9
1. Introduction
<4>
For any positive integer : , inferior prime part function :@? is defined as
the largest
<> prime number less than or equal to : , and superior prime part func-
tion 7 :@? is denoted as the smallest prime number greater than or equal to : .
In problem 39 of [1], F.Smarandache asked us to study these >
sequences.
For each integer : , the prime additive complement >
:@? is defined as the
smallest nonnegative integer such that : h :@? is a prime. In problem 44 of
[1], F.Smarandache also advised us to study this sequence. <=> <>
It is interesting that there exist some relationships among :@? , 7 :@? and
,>
:@? . In this paper, we use the<=important
> works
< > of D.R.Heath Brown to study
the mean value properties of :@? and 7 :@? , and give two sharp asymptotic
formulae. That is, we shall prove the following:
Theorem 1. For any real number ayb£T , we have
e <> a j h¥l£n è
:@?#A a 3 Z é
t E
H fg v $
where is any fixed positive number.

Theorem 2. For any real number ayb£T , we have
e < > a j m è
h l n a Z é
7 :@?#A
v 3$ t ^
H0fg
9
To complete the proof
>
of the theorems, we need the following:
Lemma 1. Let :@? be the prime additive complement, then we have the
estimate: e ,> è
? 2Èa 3 Zé ^
:@
$
H fg
>
Proof. Denote H as the : -th prime, then from the definition of :@? we
have
e > e e >
:@?ðA < < Õ :@?
Ê Õ
H0fg \f f g H f 143
Á e e > Ê
< Õ < Õ Z@\ R Ê ?
Ê
\f f g H f 143
Á e > Ê
Z@\ R Ê ? j ^ (1)
Ê
\f f g
By [2] we can get
e > Ê è
Z@\ R Ê?j 2 a 3 Z é E (2)

\f Ê
$
f g
so by (1) and (2) we immediately have
e ,>
è
:@?2Èa 3 Z é ^
$
H fg
< > we prove the theorems. For any real number y
Now a boT , from the definition
of :@? we have
e <> e > Ê
:@?#A Z@\ R Ê ? Ê ^ (3)
H fg Ê
\f f g
On the other hand,
e > h > e e > >
: :@?`? A < Õ < Õ : h :@?`?

H fg \f Ê f g H f 4 1 3
e > Ê
A Z \ R
@ Ê? Ê@
Z \
Ê
\f f g
e > Ê h e > Ê
A Z@\ R Ê ? j Z@\ R Ê ? Ê ^ (4)

\f Ê f g \f Ê f g
Then from Lemma 1, (2), (3) and (4) we have
e < > e > h > e > Ê
:@?#A : :@?`?]R Z@\ R Ê ? j
H0fg H0fg Ê
\ f f g
e e > e > Ê a j m è
A : h :@?@R Z@\ R Ê ? j A
h l£n a Z ét ^
3$ ¹
H fg H0fg Ê v
\f f g
On the inferior and superior prime part 59
This proves Theorem 1. <>

Similarly, from the definition of 7 :@? , (4) and Lemma 1 we can get
e <> « h e > Ê
7 :@? A Z@\ R Ê ? Ê Z@\
H0fg Ê
\ f f g
« h e > h > a j h¥l n è Zé
A : :@?`?BA a 3 t ^
H0fg v $
References
House, 1993.
[2] Heath Brown D R. Ibid. III. Journal of the London Mathematical Soci-
ety, 1979, 20: 177-178.
¦
IDENTITIES ON THE -POWER COMPLEMENTS
Zhang Wenpeng
Research Center for Basic Science, Xi’an Jiaotong University Xi’an, Shaanxi, P.R.China
wpzhang@nwu.edu.cn
Abstract The main purpose of this paper is to calculate the value of the series
e 1( &

!
8 ó
3 ²

where is the © -power complement number of any positive integer , and

²
is a complex &
number with Re . Several interesting identities are given.
Keywords: © -power complement number; Identities; Riemann-zeta function.

9
1. Introduction
¸ >For any given natural number £b v and ¸ > any positive integer : , we call
L @ : ? a -power
> complement number, if L :@? denotes the> smallest > integer
>
such that :×¯®L ¸ :@? is a perfect -power. Especially, we call L j :@?VE(L s :@?VE(L < :@?
a square complement number, cubic complement number, and quartic comple-
ment number, respectively. In reference [1], Professor F. Smarandache asked
us to study the properties of the -power complement number sequence. Yet
we still know very little about it. In this paper, we shall use the analytic method
to calculate the value of the series
Ze
T
É > ¸ > E
ã
H \ :OL :@?`?
>
where â is a complex number with Re â,? bST , and obtain several interesting
identities. That is, we shall prove the following several >theorems:
Theorem 1. For any complex number â with á W â?Þb T , we have the
identity
Ze >
T j vâ?
É > > A ä >® E
ã
H \ :OL j :@?`? ä
â?
>
where â,? is the Riemann-zeta function. >
ä
Theorem 2. For any complex number â with á W â,? b£T , we have
>
Ze j xâ,?
T T
É > > Aä > « < T h E
H \ :OL s :@?`?
ã â,?ç s ã h T
ä
where < denotes the product over all primes.

ç
>
Theorem 3. For any complex number â with áW ,â ? b£T , we have
>®
Ze j â,?
T T T
É > > ASä > < T h < ã h T T h < ã h v ^
ã
H \ :OL < :@?`? ä
+â?ç
Taking â¹AªTE¤v in the theorems, and note that the fact

J
<
> û j >® û >« û > û ,
v!?BA « E ?BA ½ E ?#A E +!?BA
½ E
ä ä ¬ ä ¬ ä J ¬
« «
> ¬=Tû \ j > « x TV,û \
Tv!?ÔA « E T ?ÔA « «« ½ ^
ä xD+=TvD+@ ä xv T v
We may immediately obtain the following two corollaries
Corollary 1.
Ze
T
É > A ¼
H \ O
: L j @
: ? v
>
Ze j x!?
T T
É > Aä > « < T h s h T ¼
H \ O
: L s @
: ? ? ç
ä
Ze
T T T
É > A « < T h < h T h < h v ^
H \ :OL < :@? ç T
Corollary 2.
Ze
T
É > > A « ¼
:OL j :@?`? j
H \

Ze
T T
5 T
É > > A « < T h J
h ¼
H \ :OL s :@?`? j =
¬ T ç T

Ze
T v¬x T T
É > > A < T h h T T h h ^
H \ :OL < :@?`? j vx ç , , v
9
In this section, we shall complete theE proof of the Theorems. For any pos-
itive integer : , we can write it as :æA j C , where C is a square-free > number
(that is, iP C implies j P C ). Then from the definition of L j :@? we have
Ze
T
Ze Ze J > C{? J Ze Ze J > C{? J
É > > A C É É > E A C É É E
H \ :OL j :@?`?
ã \ W \ j C¯UC{? ã \ W \ j(ã C j(ã
>
> h T j vâ?
A vâ? < T Aåä >® E
ä ç j(ã â?
ä
Identities on the -power complements 63
>
where :@? denotes the M ¡ bius function. This completes the proof of Theorem
1.
Now weE come to prove> Theorem 2. For any positive integer : , we can write
it as :³A s C j , where > C.E ? AMTE and C is a square-free number. Then
from the definition of L s :@? , we have
Ze
T
Ze Ze Ze J >{ C ? J J ? J
>
É > > A C É É É >E
\ W \ i` \ s Cj ¯C j? ã
ã
H \ :OL s :@?`? i
W \
> Ze J > C{? J Z e J > ? J
A xâ? É É
ä s s ã
W \ C ã i( i \
W \
>
Z e J J
> C{? T
A xâ? É T h
ä W \ C ã ç W
s < V ¢ s ã
> J > C{? J
j xâ? Ze T
A ä « > É
â? W \ C s ã < ç W n T h < \ó t
ä
>
j xâ? h T
A ä >« < T s ã T h < \ó t
n

â? ç
ä
>
j xâ? T
A ä >« < T h s ã h T ^
â? ç
ä

Now weE come to prove Theorem 3. For
> any positive integerÅ : , we can write
< s j Å > Å
it as :A C , where C.E ? AòTE > C E ?A T and C is a square-free

number. Then from the definition of L < :@? , we have
Ze
T
É > >
ã
H \ :OL < :@?`?
Ze Ze Ze Ze J >{ >
C ? J J ? J J
®> Å J
?
A É É É É >E < s Å Å
C
\ W \ i( \ \ C j ¯ C j s ? ã
i
W i \
W \
Z Ze J > > Ze J ®> Å ? J
>® e C{? J J ? J
A â? É É É Å
ä W \ i( \
C < ã < ã \ < ã
i i
W \ W \
>® > >
j â? Z e Ze J C{? JJ ? J T
A ä > É É C < ã < ã < ç < L\ ó
+â? n h
ä W \ i` \ W i T t
W i \
>® Z Ze J >{ >
j â ? e
C ? J J ? J T T
A ä > É É < < < \L ó ç < i n < \L ó
+â? C ã ã <
ç W n h T h
ä W \
i` \ T t t
W i \
>®
j â? Z e J > C{? J T T
A ä > É T h < ã h
+â?
W \
C < ã < ç n T h < \L ó t <Vç ¢
W W T
ä
T
< T h
>®
j â? e Z J >
C{? J T ç
< ã h T
A ä > É <
< n T h < \L ó t T
ä
+â?
W \ C ã ç W T h < ã h
<ç
W T
>®
j â? T T
A ä > < T h h T h ^
+â? ç < ã T < ã h v
ä
Using our method, we can also obtain the identities for the series
Ze
T
É > ¸ > E
H \ :OL @ : ?`? ã
where b .
References
House, 1993.
ON THE ASYMPTOTIC PROPERTY OF DIVISOR
FUNCTION FOR ADDITIVE COMPLEMENTS
Yi Yuan
Research Center for Basic Science, Xi’an Jiaotong University Xi’an, Shaanxi, P.R.China
yiyuan74@163.com
Liang Fangchi
School of Science, Air Force Engineering University Xi’an, Shaanxi, P.R.China
fc-liang@163.com

!

Abstract For any positive integer , let is the additive square complements of .
!

¤£ !

That is, is the smallest non-negative integer such that is a perfect
!

square number. In this paper, we study the mean value properties of

with

£
the divisor function , and give an interesting mean value formula for
!
8
.
Keywords: Additive square complements; Divisor function; Asymptotic formula.

9
>
For any positive integer : , the square complements L j :@? is defined as the
smallest>
positive> integer such >
that :Ú >®is a perfect square.
>
For > example,
« «
L j > TU?cA T , L > j v!?.A v , L j x!?.A x , L j ?cA T , L j !?.A , L j ?.A ,
L j ?Ô; A , L j +!?BAwv , ¯¯¯ . In problem
> 27 of [1], Professor F. Smarandache ask
us to study the properties of °UL j :@?¤± . About this problem, some authors had
studied it, and obtained some interesting results. For example, the authors > [2]
used the elementary method to study the mean value properties of L
> >j @
: ? and
\
è H . Zhang H.L. and Wang Y. in [3] studied the mean value of ¥ L j :@?`? , and
ß
obtained an asymptotic formula by the analytic method.
Similarly, we will define the additive square complements as follows: for
any positive integer : , the smallest non-negative integer is called the additive
square complements of : if : h is a perfect square number. Let
> ½ Z
L :@?BA íìzr ° J : h ADC j E¤b E`C à ±!E
> ½ > > >® ½ >
then L TU?QA , L v!?QAåv , L x!?QA T , L ? A , L !? A , ¯¯¯ . In this paper,
we will use the analytic methods to study the asymptotic
e properties of divisor
> h >
function for this sequence in the following form: N : L :@?`?VE where abv
H0fg
>
be a real number, N :@? be the divisor function, and give an sharper asymptotic
formula for it. That is, we shall prove the following:
Theorem. For any real number aybv , we have the asymptotic formula
e > > x µ pzr a h µ a hml > a L Zé ?VE
N : h L :@?`?ÔA a pzr j a h \a j
H0fg û2j
µ µ
where \ and j are computable constants, is any fixed positive number.
9
following:
Lemma. For any real number a{ÝoT , we have
e > x h lon a è3 Zé tºE
N : j ?BA ¯a pzr j a h \ a
pzr a h
j a

H fg 2
û j
where \ and j are computable constants, is any fixed positive number. è

Å > Ò Hó
Proof. Let âA ù h F be a complex number and G â?ÞA É .
> > H \ H
Note that N : j ?¦2 : é , so it is clear that G â? is a Dirichlet series absolutely
convergent
> for Re( â ) ÝåT , by the Euler Product formula [4] and the definition
of N :@? we get
> > >
> ~ h N j ? h N < ? h h N jH ? h
G â,? A < T ¯¯¯ H ã ¯¯¯
ç ã j(ã

x h h v,: h T h
A < T h ¯¯¯ h H ã ¯¯¯
ç ã j(ã

> T
A j â,? < T h
ä ç ã
s > â?
A ä > E (1)
vâ?
> ä
where â,? is the Riemann zeta-function and § < denotes the product over all
ä
primes.
From (1) and Perron’s formula [5], we have
è Z
Êÿþ s > è Zé
e > T â? a ã hml~ a
N : j ?#A ä > ¯
N â ^ (2)
H fg vûF#ü è Êÿþ vâ,? â
ä

Now we move the integral ó line in (2) from âºA s F to âºA \ F . This
j j

time, the function ¨ ã ¯ g have a third order pole point at âAªT with residue
¨ j(ã ã
x
¯a p7r j a h \ a
pzr a h
j aÚE (3)
û j
On the asymptotic property of divisor function for additive complements 67
where \ and j are computable constants. Hence, we have

è
Êÿþ è Z
Êÿþ è3 Z Êÿþ è3 ÿÊ þ s > â,? a ã
T ~ h h h ä > ¯ N â
vûF ü è3 Êÿþ ü è Êÿþ ü è Z Êÿþ ü è3 Z Êÿþ vâ? â
ä
x z
p r h z
p r h
A ¯a j a \ a a (4)
û2j j a@^
We can easily get the estimate
T ~ è3 Z Êÿþ è
Êÿþ s >â ? a ã a è Zé
÷ h ä > ¯ N5â ÷ 2 (5)
÷ vûF ü è Z ÿÊ þ ü è3 ÿÊ þ vâ,? â ÷
÷ ä ÷
÷ ÷
÷ ÷
and
T è3 Êÿþ s > â,? a ã
è
÷ ä > ¯ N â ÷ 2 a 3 Zé ^ (6)
÷ vûF ü è3 Z Ê þ v
â ? â ÷
÷ ä ÷
÷ ÷
Taking
÷
A a , combining (2), (4), (5) and (6) we
D ÷ deduce that
e > x n a è3
N : j ?#A ¯a zp r j a h \a
p7r a h
j a
hl Z ét ^
H fg û j
2

Now we use above Lemma to complete the proof of Theorem. For any real
number aybDv , let À be a fixed positive number such that
Á >
À j ayÂ À h TU? j ^ (7)
>
Then from the definition of L @ : ? , we have
e > >
N : h L @ : ?`?
H fg
e e > > e > >
A N : h L @ : ?`? h N : h L @ : ?`?
è è è
\f W f \ W fH [ W Z@\) fH fg
Ã Ã
e e > > hl > a è3 Zé ?
A N : h L @ : ?`?)
è è
\f W f W fH [ W Z@\)
Ã
e e >`> h hml > a è3
Z é?
A N C TU? j ?
\f W f è è
fH [ W
W Z@\)
e Ã >`> > è Z é
A v,CN C h TU? j ? hl a 3 ?
\f W f
eÃ > > è
A v¯ CN C j ? hml a 3 Zé ?V^ (8)
\f W f
Ã
µi> Ò >
Let a?A N : j ? , then by Able’s identity and Lemma, we can easily
H fg
deduce that
e >
CN C j ?
\f W f
µi> Ã µi>®Å >®Å >
A À Àª?#R Ã ?kN ? hml À \)Zé ?
ü \
x pzr j À h pzr À h
A À ¯À \ À j À
û2j
x Å zp r Å h Å pzr Å h Å Å hmlon è Zé t
R ¯ j
ü \
Ã
û2j
\ j N À
T x pzr j À h P P è Zé tºE
A ¯ ¯UÀ j \ À j pzr À h j hmh l£n À (9)
v û2j j À
P P
where \ and Á j are computable constants.
½ G zp r h l > a è3 Zé ? , then from
Note that a R{À j 2 a and pzr j aA j À
(8) and (9) we get
e > > x µ µ hml > a
N : h L @ : ?`?ÔA a zp r j a h \a
pzr a h
j a
L Zé ?V^
H0fg û j
2
References
House, 1993.
[2] Liu H.Y. and Gou S. On a problem of F. Smaradache, Journal of Yanan
University (Natrual Science Edition) 2001, 20: 5-6.
[3] Zhang H.L. and Wang Y. On the mean value of divisor function for
square complemnets, Basic Science Journal of Textle University 2002,15: 44-
46.
[5] Pan Chengdong and Pan Chengbiao, Foundation of Analytic Number
Theory, Science Press, Beijing, 1997.
MEAN VALUE ON TWO SMARANDACHE-TYPE
MULTIPLICATIVE FUNCTIONS
Liu Huaning
hnliu@etang.com
Gao Jing
School of Science, Xi’an Jiaotong University, Xi’an, Shaanxi, P.R.China
jgao@china.com.cn
Abstract In this paper, we study the mean value of two Smarandache-type multiplicative
functions, and give a few asymptotic formulae.
Keywords: Smarandache-type multiplicative functions; Mean value; Asymptotic formula.

9
1. Introduction
In [1], Henry Bottomley considered eleven particular families of interrelated
multiplicative functions, which are listed in Smarandache’s problems.
In this paper we study the> mean value of two Smarandache-type multiplica-
P
tive functions. One is W :@? , which is defined C
> as the -th root of largest
C -th power dividing : . The other function © W :@? is denoted as C -th root of
smallest C -th power divisible by : . We will give a few asymptotic formulae
on these two functions. That is, we shall prove the following:
Theorem 1. For any integer Còbx and real number a{boT , we have
>
e P > CRTU? hlon è3
W :@?#A ä > a a Z ét ^
H fg C{?
ä
Theorem 2. For any integer CòboT and real number a{boT , we have
j m
< è\ h <\ < è \ < è \ è
e > a j R R hl£n a è
Z é
© W :@?ÔA > < l T h -
<\
-21=3
< \è n
- 1

< è \ ô
p t ^
v v!? ç n T h t n TR t T¢R t
H0fg ä - 3
9
Now we prove the theorems. Let
e P >
> W :@?
G â,?#A É ^
H \ : ã
Noting that ¸ Á
P > | } >
W ?ÔA E if Cy ÂmC h TU?V^
Then from the Euler product formula [2] we have
e P > |
> W ?
G â? A < ñ É | ö
ç |! ã
j ê m
We \ P > W ¸ Z ª
e W ¸ ª ?
A < l¸É ª W Z ã
p
ç
j ê ê ¸ m
e W e \
A < l¸É ª ¸ ª p
ç W Z ã
j ê ê m
< \ ó > >
TR â? C â¢RTU?
y
-
A < l n <U\ ó n < \ó)ô
p A ä ä > ^
ç TR t TR t Cyâ,?
- 3 ä
So by Perron formula [3] we can get
e P >
W :@? T Z Êÿþ > h a ã a
> h ù
?
A G â â ? dâ h m l ~ ê
Ê þ ê ý
H0fg :Úã)ú vûF üyý

â

>
p
Ï Ð a > a
ý
h l a \ øú v,a2? íìzr TE B
hml a øú ? í'zì r TE J J JJ B E
a
J ½
where is the nearest integer to a , and JJ a JJ A J a R . Taking â A , A s
ê j
and Ýv in above, then we have
è Z
Êÿþ è
e | > T > a ã hml ~ a
ÛÜ :@?#A G
â ? d â ^
H fg vûF ü è Êÿþ â

Now we move the integral line from s F to \
R F . This time, the function
j j
> a ã
G â,?
â
have a simple pole point at âºAYT with residue
>
CRTU?
ä > a
C{?
ä
Mean value on two Smarandache-type multiplicative functions 71

Now taking ADa , then we have
e >
>
CRTU? h T è3 Z Êg > a ã
P
@
: #
?
A ä > a hml n a è3
Z ét
W
C{? v ûF#ü è3
Ê g G â? â d â
H0fg ä
>
CRTU? hml~ g T h ]h a è3 Zé Å n a è3
Aä > a ÷ G Fõa ÷ > ë h J Å J d hml Z ét
C{? ü g ÷ v ÷ T ?
> ä ÷ ÷
CRTU? hml£n | Z è3 ÷ Zé ÷
A ä > a a tº^
C{?
ä
For any integer C boT and real number ayb£T , let
e >
> © W :@?
â?BA É ^
H \ : ã
Noting that > | ¸ Á >
?BA Z@\ E if Cy Â } C h TU?V^
© W
Then from the Euler product formula [2] we have
> |
> h e © W ?
â? A < ñT É |
ç |! \ ã ö
j m
W > W ¸ Z ª
h É e e © W ?
A < l T ¸ ª p
ç ¸ ª W Z ã
ê \
j ¸ m
e e W Z@\
h ¸ ª p
A < l T ¸ ª
É W Z ã
ç \
j ê m
< \ ó
h TR
-
A < l T < ó
p
ç ã \ n TR \ t n T[R < \ ó)ô t
j
- 3 m
< \ ó)ô è h < è óõ\ ô R < \ ó)ô R < \ è óõô è
h T h A
-21=3 B 3 A
-21=3 B 3 A
- 1 B

A < l T p
ç ã \ n TR <U\ ó t n TR < \ ó)ô t
j
- 3 m
> < \ óõô è h < è ó)\ ô R < \ ó)ô R < \ è ó)ô è
â×RTU? l T h
A
-143 B 3 A
-21=3 B 3 A
- 1 B
2 p
A ä> < ^
vâ×Ræv!?#ç n T h <Uóõ\ ô t n TR < \ ó t n T[R < \ ó)ô t
ä 3 - 3
So by Perron formula [3] and the methods of proving Theorem 1 we can easily
get Theorem 2.
References
[1] Henry Bottomley. Some Smarandache-Type Multiplicative Functions.
Smarandache Notions Journal, 2002, 13: 134-135.

[3] Chengdong Pan and Chengbiao Pan. Foundation of Analytic Number
ON THE SMARANDACHE CEIL FUNCTION AND
THE NUMBER OF PRIME FACTORS
Xu Zhefeng
zfxu@eyou.com
mean value properties of the compound function involving « and Smarandache
ceil function, and give an interesting asymptotic formula.
Keywords: Smarandache ceil function; Asymptotic formula; Mean value

9
1. Introduction
For a fixed; positive
> integer and any positive integer : , the Smarandache
ceil function ¸ :@? is defined as follows:
; ¸ > ts ¸
:@?#A íìzr °Còà : J C ±!^
This was introduced by Professor F.Smarandache. About this function, many

scholar studied its properties, see [1] and [2]. In [1], Ibstedt presented the
following properties:
>¬ > ; ¸ > ; ¸ > ; >
LIE à ? LXE ?ÔAªTI® L ¯ B ? A L ?]¯ ¸ V? E
4

; ¸ > | ¤¯
and ?.A ²D° , where
; ¸ > is a prime and ±aO² denotes the least integer
greater
| | è than a
|D³
. That is, @
: ? is a multiplicative function. Therefore, if :mA
\ 3 j
¯
¯ ¯ i is the prime decomposition of : , then the following identity is
obviously:
è ³
; ¸ > ; ¸ > | | è | ³
D ¯ 3 ¯ ¯
:@?#A \ 3 j ¯¯¯ i ?#A \ ² ° j ² ° ¯¯¯ i ² ° ^ (1)
The arithmetic function is defined as follows:

> >´ | | è | ³
D } h } h
:@?#A \ 3 j ¯¯¯ i ?#A
^ \ j ¯¯¯ h } i
´
´
In this paper, we use the elementary method to ; study
> the mean value proper-
ties of the compound function involving and ¸ :@? , and give an interesting
´ the following:
asymptotic formula. That is, we shall prove
Theorem. Let be a given positive integer. Then for any real number
aybx , we have the asymptotic formula:

e >_; ¸ > z
p
r z
p r h µ m
h l a
:@?`?BADa a a pzr a E
H0fgO´

µ h e z
p r T h T , is the Euler constant and e
where ´ A < TR < de-
notes the sum over all the primes.
9
2. Some simple lemma
Before the proof of> the theorem,
> | | aè simple | ³
lemma will be useful.
Lemma 1. Let µ :@? A¶µ \ 3 j ¯¯¯ i ?A . Then for any real number
aybx , we have the asymptotic formula:

e > pzrp7r a h µ a
µ :@?#ADa a h¥l pzr a E
H fg

µ e pzr TR T h T , is the Euler constant.
where A| h <
Lemma 2. For any real number aybx , we have the asymptotic formula:
e > Zé
:@?32Èa ² 1=3 3 E
H fg ´
H( ·
where ¸ denotes the set of h T -full numbers,> is any fixed positive integer.
Proof. First we define arithmetic function L :@? as follows:
> TE if : is a h T -full number ;

L @ : ?#A» ½
E otherwise .
Now from Euler product formula, we have

>
e L :@? T T
É A < T h ¸
@
Z )
\
h ¸
Z ã
h ¯¯¯
H \ Ú
: ã ç ã j
~ T h T T
A < ¸
ç Z@\) ã TR < \ ó
¸
T Z@\) ã ã
A T h ¸ ~ ¸ h > ¸ @ >
< Z \) ã Z@\) ã h T Z \) ã h
ç @ TU? ã RTU?
>`>
h UT ? â? T
A ä> > h < T h > ¸ @ > E
v UT ? â,?Bç Z \) ã h TU? ã RmTU?
ä
On the Smarandache ceil function and the number of prime factors 75
>
where â ? is the Riemann-zeta function. By Perron formula (see [4]), we can
ä
obtain
e > e
L :@?#A T
H fg H fg
H·
« > h
TU?)a ² 1=3 3 ~ h T m
h l è Zé
A < T > ïh > 3 a A ² 3 1=3 B ^
û2j ç TU? ² 1=3 RTU?
So we have e > Zé
:@?{2Èa ² 143 3 ^
H fg ´
H( ·
9
| | è |D³
:{A \ 3 j ¯¯¯ i ^
From (1) and the completely additive property of function , we can write
è ³ i ´ }
>_; ¸ > ¯ 3 ¯ ¯ e Ê
:@?`?BA \ ² ° ² °
¯
¯ ¯ i ² ° A ^ (2)
j Ê \º¹ d»
´ ´
| Õ
It is clear that ¼ ¸¾½ boT , so we get
i i
e } Ê e >
b T¹A¿µ :@?V^ (3)
Ê \ ¹
» Ê \
¸ | Õ
On the other hand, if there> have some prime Ê such that Ê Z@\ J : , then ¼ ¸¾½ b
v . Let : A£: \ : ¸ j , where : \ E`: j ?A¿T and : \ is a h T -full number. That is,
if ÞJ : \ then Z@\ J : \ . Now we can easily get the following inequality:
i
e } Ê Á > >
µ :@?
h : \ ?V^ (4)
Ê À\ ¹ »
´
From (3) and (4), we can write
i
> Á e } Ê Á > >
µ :@? µ :@? h : \ ?V^
Ê \ ¹
»
´
So we have
i
e > Á e >_; ¸ > e e } Ê Á e > e >
µ :@? : ?`?BA
@ µ :@? h :@?VE (5)
H0fg H0fg ´ H fg Ê \ ¹
»
H0fg H fg ´
H·
where ¸ denotes the set of h T -full numbers. Now combining Lemma 1,

Lemma 2 and (5), we have

e >_; ¸ > µ a
: ?`?BADa pzrpzr a h
@ a hml pzr a ^
H0fg ´
References
[1] Ibstedt. Surfinig On the Ocean of Numbers- A Few Smarandache No-
tions and Similar Topics, Erhus University Press, New Mexico,USA.
[2] Sabin Tabirca and Tatiana Tabirca. Some New results Concerning the
Smaradache Ceil Function.Smarandache Notions Journal,13(2002), No.1-2-3,
30-36.
[3] G.H.Hardy and S.Ramanujan. The normal number of prime factors of a
number : , Quartly Journal of Mathematics, 48(1917), 76-92.
[4] Pan Chengdong and Pan Chengbiao. Foundation of Analytic Number
Theory, Science Press, Beijing, 1997, pp98.
ON THE MEAN VALUE OF AN ARITHMETICAL
FUNCTION
Wang Xiaoying
1. Research Center for Basic Science, Xi’an Jiaotong University, Xi’an, Shaanxi, P.R.China
2. Department of Mathematics, Northwest University Xi’an, Shaanxi, P.R.China
xdwxy@163.com

Abstract Let be a prime, T denote the largest exponent

e of power which divides .
8
£&` $

In this paper, we study the mean value of - - T , and
give an asymptotic formula for it.

ÁbU S
Keywords: Asymptotic formula; Mean Value; Largest exponent.

9
1. Introduction
<>
Let be a prime, W :@? denote the largest exponent of power which divides
: . In problem 68 of [1],
<> Professor F.Smarandach asked us to study the proper-
ties of the sequence W :@? . In this paper, we e use elementary methods to study
>`> h <>
the asymptotic properties of the mean value : TU? W Rc: W Â? W :@? , and
H - fg
give an asymptotic formula for it. That is, we will prove the following:
Theorem. Let be a prime, Còb£T be an integer, then for any real number
ayÝoT , we have the asymptotic formula
e >(> h < > T C hml£n a \ 3 t
: TU? W Rc: W Â
? W :@?#A h T a -
H - fg
R T C
9
In this section,
<> we complete the proof of the theorem. In fact, from the
definition of W :@? we have
e >`> < >

: h TU? W Rc: W Ã
? W @ : ?
H - f g
e e >`> | h > |
A TU? W h ?W ? }
< < X
f g - 3 X < fg - 3

\

e } e n P \ | W \) W \ h P | W W h
A W Wj j j ¯¯¯ t
| f 3 X
3
X f < S -
- ! /0S
! /0
\
e } e n P \ | W \) W \ h P | W W h
A W Wj j j ¯¯¯ t R
| f 3 X
- ! /0S f S -3
! /0
e e P | W \) > P | W >
} n
W
\ ?W \ h Wj j ?W j h ¯¯¯ÿt
| f 3 X
- ! /0S f S - 3
! /0 1=3
| W \) > g < 3 W n < ô
e C - ? T R \ t

A } h l£n a - 3 O | t
m

| f 3 C h T -
- ! /0S
e ! /0
A } Ca T
TR
T h l£n a \ 3 | t
m
h | -
| f 3 C T
- ! /0S
! /0
Ca T e } e }
hml a \ 3
A T¢R | |
C h T
| f 3
-
| f 3
- ! /0VS - ! /0VS
! /0 ! /0
and
e } e : e }
| A É H R |
| f 3 H \ |6Y 3
- ! /0VS - ! /0S
! /0 ! /0
e \ ¡Í`Î0<g h :
T W ¡ Í`Î
A >
RTU?kj
R
[Z 3 ! /0VS
D\ É H
- ! /0 H \
T l ~ T pzÏÐ a j
A > R
RTU? j a C pÏÐ2
A > hml£n a \ pÏÐ j aut^
RTU?kj
So we have
e < >
>(>
Rc: W ?ÂW @ : ? : h TU? W
H - fg
Ca T hml n a \pÏÐ j a t
A h T[R >
C T RTU?kj
h lon a \ 3 t > hml£n a \ p ÏÐ j aut
- RTU?kj
T C n a \ 3 t ^
A a hml
RT C h T -
References
House, 1993.
TWO ASYMPTOTIC FORMULAE ON THE DIVISOR
PRODUCT SEQUENCES
Zhang Tianping
tianpzhang@eyou.com
Abstract In this paper, we study the asymptotic property of the divisor product sequences,
and obtain two interesting asymptotic formulae.
Keywords: Divisor products; Proper divisor products; Asymptotic formula.

9
1. Introduction
A natural number : is called a divisor > product of : if it is the > product> of all
positive> divisors >® of : , we>
denote it by L @
: ? . For example, L TU?QAÑTE(L v!? A
v5E(L x!?ïA x5E(L ?AÄ+5E(L !?ïA 5E¯¯¯ ; Similarly, : is called a proper divisor
product of ,: > if it is the product of > all positive
>
divisors
>
of : except
>®
: , we
> de-
note ,> «
it by :@? . For example, TU? A v!? A x!?A TE ?AMv5E !?A
«
TE ?×A E¯¯¯ . In reference [1], Professor F. Smarandache asked us to study
the properties of these two sequences. About these problems, it seems that
none had studied them before. In this paper, we shall use the analytic methods
to study the asymptotic properties of these sequences, and give two interesting
asymptotic formulae. That is, we shall prove the following two theorems.
Theorem 1. For any real number a{boT , we have the asymptotic formula
e pzr L > :@?#A T > P > P > è
a zp r j a h RTU?5a pzr a'R RTU?5a hml a 3 pzr a?V^
H0fg v
P
e pzr > :@?BADa p7r j a h > P R%v!?5a pzr a R > P R%v!?5a hml > a è3 pzr a2?V^
H fg
9
2. Some lemmas
To complete the proof of the theorems, we need the following simple lem-
mas.
Lemma 1. For any natural number : , we have the following identities

ô
> 5A
è B > 5A
è B 3

L :@?#AD: E :@?BAD: E
>
where N :@? is the divisor function.>
Proof. From the definition of L :@? we know that
> :
L :@?BA NiA ^
ç H ç H N
So from this formula we have

> F : H
L j :@?BA N A :yAD: ^ (1)
ç H ç H N ç H
> e > 5A
è B and
where N @ : ?ÔA T . From (1) we may immediately obtain L @ : ?#AD:
U H
N
>
ç H 5A
:@?#A N A AD: è B \ ^
H ç H :

e > > > è
N :@?ÔADa pzr a h v RTU?5a hl a 3 ?VE
H0fg
Proof. (See reference [2]).
e > > > >
N :@? pzr :{Aa pzr j a h v RTU?=a pzr a Ræv RmTU?5a h¥l a è3 pzr a2?V^
H fg
µi> e >
Proof. Let a?QA N :@?VE then by Abel’s identity (see Theorem 4.2 of
H fg
[2]) and Lemma 2 we have
e >
N :@? pzr :
H0fg
µ > µ > p7r g µ ®> Å ? Å
A a2? pzr a R TU? TR Å N
ü \
pzr a n a zp r > h l > a è3 ? t
A a h v RTU?=a m

g Å pzr Å h > Å
v RTU? hml
>®Å è3
? Å
R Å N
ü \
> >¶Å pzr Å Å h > Å >
A a r j a h
z
p R TU?5a zp r a R
v R R TU? ? J g \ hml a è3 pzr a2?
v
> > h l > a è3 pzr a?V^
A a pzr j a h v RTU? a zp r a'Ræv RUT ?5a m
Two asymptotic formulae on the divisor product sequences 83
9
In this section, we shall complete the proof of the Theorems. First we come
to prove Theorem 1. From Lemma 1 and Lemma 3, we have
e pzr L > :@? e pzr : 5A
è B T e >
A A N @ : ? pzr :
H fg H0fg v H fg
T zp r > > hl > a è3 pzr a2?V^
A a j a h RTU?5a pzr a R RTU?5a
v
Similarly, we can also prove Theorem 2. From Lemma 1, we have
ô
e pzr > :@?ðA e pzr : 58A è B 3 A T e > T e
N :@? p7r :R p7r :
H fg H fg v H fg v H fg
T e > T
A N :@? p7r :R pzr a=_K^
v H fg v
Note that
p7r >
a _K5ADa pzr a'R a hml pzr a? (2)
(see reference [2]). Then by Lemma 3 and (2), we can easily obtain
e p7r ,> :@?ÔADa pzr j a h > R%v!?5a pzr a R > Ræv!?5a hl > a è3 pzr a2?V^
H fg
References
House, 1993.
ON THE SMARANDACHE PSEUDO-EVEN NUMBER
SEQUENCE
Zhang Xiaobeng
zxb1231@sina.com
Lou Yuanbing
yblou@hotmail.com
Abstract The main purpose of this paper is to study the mean value properties of the
Smarandache pseudo-even number sequence and pseudo-odd sequence, and give
some interesting asymptotic formulae for them.
Keywords: Pseudo-odd numbers; Pseudo-even numbers; Asymptotic formula.

9
1. Introduction
A number is called pseudo-even number if some permutation of its digits «
is
½
a even number,
« including the identity permutation. For example: µ E¤v5E E E+5E
½ ½
T ETv5ET ET E?T +5E¤v EVv=TE¯¯¯ are pseudo-even numbers. Let denotes the set
of all the pseudo-even numbers. Similarly, we can define the pseudo-odd num-
ber. That is, a number is called pseudo-odd number if some permutation of its
½
digits is an odd number, such as TE¤x5E¤5E E¤¬5ET ETTEUTv5EUTx=E¯U¯¯ are pseudo-odd
numbers. Let denote the set of all the pseudo-odd numbers.
In reference [1], Professor F. Smarandache asked us to study the properties
of the pseudo-even number sequence and pseudo-odd number sequence. About
these problems, it seems that none had studied them before. In this paper, we
use the elementary method to study the mean value properties of these two
sequences, and obtain some asymptotic formulae for them. That is, we shall
prove the following:
e > e >
G :@?]A G :@? hml n Àoa ! #)3 Å ú t E
!#
H
H0fg
H fg
>
where À A í&% ' ° J G :@? J ± .
\ fH0fg
Theorem 2. For any real number a{boT , we have

e > e >
G :@?ÄA G :@? hmlon À£a ! # 3 Å ú t^
!#
H DÆ
( H fg
H0fg
Corollary. For any real number ayboT , let d(n) denote the divisor function,
then we have the asymptotic formulae
e > >
N :@?BADa p7r a h v RTU?)a hml n a"! #)3 Å ú Zé t
!#
H )
(
H fg
and e > >
: ?#ADa pzr a h v RTU?)a h¥l n a1! #DÅ
Z é
N @
!#3ú t E
H)Æ
H fg
9
Now¸ we Á completes the proof of the Theorems.
Á First we prove Theorem 1.
½ ½ ¸ Z@\ > z
p
Ï Ð
Let T aÂ T µ Yb TU? , then a·Â h T . According
Á to
the definitionµ of set¸ , we know that the largest number of digits ( a ) not
attribute set is Z@\ . In fact, in these numbers, there are one digit,¸ they
½ «
are E¤v5E E E + ; There are j two Á digits; The numberµ of the digits are .¸ So
the
H
> ¸ largest Á number
¸ of digits ( a ) not attribute set is h j h ¯¯¯ h A
< RTU? Z@\ . Since
¸ Á 3 ú >
¡Í`Î g A n ¡ Í`Î g t 3 A a? 3 ú ADa1! #DÅ ^
3 ú
Å ! /0 Å ! /0 Å !# 3
So we have, ¸
lon a1! #DÅ t^
A
ú
!# 3
J > J > Á
Next, let À denotes the upper bounds of G :@? : a? , then
e >
G :@?#A l n À£* a ! #D3 Å ú t ^
!#
Hu
H0fg
Finally, we have
e > e > e >
G :@?ðA G @ : ?@R G :@?
H H fg HX
H fg H fg
e > m
h lon £
A G :@? À a ! #DÅ ú t^
!# 3
H fg
This proves the Theorem 1.
On the Smarandache pseudo-even number Sequence 87
Use the same method, we may immediately get:

e > e >
G :@?#A G :@? hmlon À£a ! #)Å ú t^
!# 3
H DÆ
( H fg
H fg
This completes the proof of the Theorems.
Now the corollary follows from Theorem 1 and 2, the asymptotic formula
e > > è
N :@?BADa p7r a h v RTU?)a hml n a 3 t
H0fg
> Á Á
(see [2]), and the estimate N :@3 ? 2 a é (for all T : a ).
References
House, 1993.
ON THE MEAN VALUE OF AN ARITHMETICAL
FUNCTION
Lv Chuan
phoenixlv@eyou.com

Abstract Let be a prime, T denote the largest exponent of power which divides .
In this paper, Ò we use elementary and analytic methods to study the asymptotic

5Ç4

properties of T , and give an interesting asymptotic formula for
it.
V U S
Keywords: Asymptotic formula; Largest exponent; Perron formula.

9
1. Introduction
<>
Let be a prime, W :@? denote the largest exponent of power which di-
vides : . In problem 68 of [1],<> Professor F.Smarandache asked us to study the
properties of the sequence W :@? . About this problem, it seems that none had
studied it, at least we have not seen related papers before. In this paper, we
use elementary
Ò and < analytic
> > methods
> to study the asymptotic properties of the
mean value H0fg W :@? È :@? ( È :@? is the Euler totient function), and give an
interesting asymptotic formula for it. > That is, we will prove the following:
Theorem. Let be a prime, È :@? is the Euler totient function. Then for
any real number a{boT , we have the asymptotic formula
e <> > x n a è
W :@?È @ : ?BA > a j hml Z ét ^
H0fg jRTU?kû2j
9
2. Some lemmas
To complete the proof of the theorem, we need the following:
Lemma 1. Let be a given prime. Then for any real number ambST , we
have the asymptotic formula
e > x è Z é
È :@?BA > ïh a j hml£n a t ^

TU?kû2j

H < fg
H \
Proof. Let >

> e È : ?
@
G â,?#A É E
:Úã
X H < \
\
>
á W â?ïÝ T . Then

> from the Euler product formula [3] and the multiplicative
property of È :@? , we have
e > e > W
È : ?
@ È ?
É A < É
:Úã ç W ã
H < \
W ê
H \
ºRT j x R h
s RÉ j
A ~ T h h h ¯¯¯
ç < ã j(ã s ã
\

~ T h T¢R T T
A T h h h ¯¯¯
ç < ã \ ã \ j ã \)

T R \
~ T h ¢ ã
\
A <
ç ã \ ã \ R T
>
âRTU? ã R
A ä > E
â? ã#
R T
ä
> ½
where â,? is theH Riemann zeta-function. By Perron formula [2] with â A ,
ä ê
ADa and A , we have
j
e
>
È :@? T è Z Êÿþ >
â¢RTU? ã R a ã è
A
Å
> 5
N â hml ~ a Å
:Úã vûF ü è Êÿþ
ä
â? ã#RmT â ^

H
<
f g Å ä
H \
T è Z Êÿþ >
â RTU?
ã R a ã
Å
Ê ÿ þ ä > N5â!E
vûFÄü è ,â ? ã RT â
Å ä H
s
we move the integral line from { â A F to â{A F . This time, the
j j
function >
> â RmTU? ã R
× a ã
G â?#A ä >
â? ãBRT â
ä < è
has a simple pole point at âAwv , and the residue is < s g è . So we have
Z@\)
T è Z ÿÊ þ è Z
Êÿþ è
Êÿþ è ÿÊ þ >
â¢RTU? ã R a ã x a j
~ Å h h h Å
ä > A > ïh ^
v,Fõû ü è Êÿþ ü è Z Êÿþ ü è Z Êÿþ ü è Êÿþ â,? ã RT â TU?kû j
Å Å ä
Note that
T Z ÿÊ þ
è è
Êþ è Êÿþ >
âRTU? ã R a ã
~ è
h h a Zé ^
Å
ä > 2 È
v,Fõû ü è Z Êÿþ ü è Z ÿÊ þ ü è ÿÊ þ â? ã RT â
#
Å ä
e > x a j hlon a è Zé t^
È :@?#A > ïh
U
T k
? 2
û j
H0 < fg
H \
This completes the proof of the Lemma 1.
Lemma 2. Let } is an any fixed integer, and is a prime. Then for any real
number ayb£T , we have the asymptotic formula
e }
hml£n a \p ÏÐ autº¼
| A >
| f RTU? j
! /0VS
! /0
e } è3
hml£n a è3 pÏÐ aXt^
è A n_ è3 j
| f R Tt
! /0VS
! /0
Proof. From the properties of geometrical series, we have
} Å }
e e e
| A É R |
| f \ | Y
6
! /0VS ! /0VS
! /0
e
Å ! /0
e ¡Í`Î5<g h Å
T ¡Í`Î
A É R \ É
D
\ Z ! /0?S
\
! /0
e Å ¡Í`Î5<g Å
A É hml a \ ¡Í`Î

h eÉ
\ RT \
A hml n a \IpÏÐ a t E

>
RmTU? j
and
e } e Å e }
Æ
è A É è R è
| f \ |6Y
! /0VS ! /0S
! /0
e
Å ! /0
e ¡Í`Î5<g h Å
Æ T ¡Í`Î Æ
A É è R D\ É è
\ è3 Z ! /0VS \
! /0
Å ¡Í`Î <g Å
e ¡Í`Î h e
A É hl a è3 É Æ
\ è3 è3 RT \ è
è3
A hlon a è3 pÏÐ aXt^
nõ è3 j
R Tt

9
In this section, we complete the proof of the theorem.
e < > >
W :@? È :@?
H fg
e e } > | e } > | e >
A < < X È ?BA < È ? X È ?

fg X < fg fg fX < S
\
\

è
Z é
RT e }I | ~ > x a j hml ~ a
A ïh TU?kû2j | |
¢
| f
! /0S
! /0
> } }
x RTU? e hml a è Zé e
A > ih a j | è
TU?kû2j | f | f
! /0S ! /0VS
> ! /0 ! /0
x RTU? hlon a \pÏÐ aXt
A > ih a j ~ >
TU?kû2j R TU? j

è3
h l a è Zé hml n a è3 pÏÐ a t

nõ è 3 RTt j
x è Z é
A > a j hmlon a t ^

j[RTU?kû2j
References
House, 1993.
AN ARITHMETICAL FUNCTION AND ITS CUBIC
COMPLEMENTS
Ding Liping
dingding 136@elong.com
Abstract The main purpose of this

paper
0
8is using the elementary method to study the mean
value properties of the è , and give an interesting asymptotic formula.
Keywords: Cubic complements; Mean value; Asymptotic formula.

9
1. Introduction
> >
Let : be an positive integer, if > L :@? is the smallest integer such that :OL :@?
is a cubic number, then we call L :@? is the cubic complements of : . For any
positive integer
; ¸ > : and any fixed positive integer , we define the arithmetical
function :@? as follows:
; ¸ > ¸
:@?BA í&% ' °a{à J a J :Ä±!^
; >
Obviously, that ¸ :@? is a multiplicative function. In this; paper, > > we use the
elementary method to study the mean value properties of j L :@?`? , and give
a sharp asymptotic formula for it. That is, we shall prove the following:
Theorem. For any real number aybDx5E we have the asymptotic formula

e ; > > a j û < T hmlon a è Zé tºE
j L :@?`?ÔA x=T ç < T h < h s
H0fg
>
where â,? is the Riemann zeta-function, < denotes the product over all prime
ä ç

, and be any fixed positive integer.
9
2. A Lemma
To complete the proof of the theorem, we need the following famous Perron
formula [1]:
> e > Å
Lemma. Suppose that the Dirichlet series G â?#A É L :@?): ã , âºA ù h F ,
H \
converge absolutely for ù Ë
Ý Ê , and that there exist a positive Ì and a positive
µi>
increasing function â? such that
e J L > :@? J : ø >ù ½
É 2 RÍÊ]? \ E ùÏÎ Ê
h
H \
and > µi>
L @ : ?32 :@?VE`:AªTE¤v5E¯¯¯,^
½
Then for any Ý , h ù ÝÐÊ , and a not to be an integer, we have
e > T Z Êÿþ > a Ñ

= a
L @ : ?): ã)ú A Ê þ G â h µ? dµ hml ~ > h ù
H fg vûFÄü ý ê µ ý RÉÊ]?ÓÒ
µi>
h l ~ ý v,a?)a \ ø pÏÐ a
JJ
a JJ E
where J J a J J is the nearest integer to a .

9
In this section, we complete the proof of the theorem. Let
; > >
> e
G â,?#A É j L :@?`? E
H \ : ã
>
Re â,? Ý/T .; Then > by the Euler product formula [2] and the multiplicative
property of j :@? we have
; > > ; > > ; > > s
> ~ h j L ?`? h j L j ?`? h j L ?`? h
G â? A < T s ¯¯¯
ç ã j(ã ã
; > ; > ; > ; >
~ h j ? h ? h TU? h j ? h
A < T j j j j ¯¯¯
ç ã j(ã s ã < ã

T h T h
A < T h h
s ã < ã
h ¯¯¯

ç ã j(ã
<\ ó < \è ó < \ó
A ~ T {
h h h
< < ó < ó < ó
ç TR \ TR \ TR \

> T T
A xâ? < T h h
ä ç ã \ j(ã
>
xâ? > T
A >ä â¢RmTU? < T h E
vâ×Ræv!? ä ç j(ã h{ ã Z@\
ä
> ½
where â,? is the Riemann zeta-function. So by Perron formula, with â A ,
Å è ä
ê
ADa , Aëx , we have
e ; > T s Z Êÿþ >
â¢RTU? xâ,? > a ã
>
> è Z
j :@?#A v,F)û ü s Êÿþ ä > vâ¢Ræ ä á â,? N â hml a ?VE
H0fg v!? â
ä
An arithmetical function and its cubic complements 95
where
> T
á â,?ÔA < T h {
h ^
ç j(ã ã Z@\
T s Z Êÿþ > >
x â? â×RTU? > a ã

ä > ä á â? N5â
v,Fõû ü s ÿÊ þ v â×Ræv!?
â
ä

we move the integral line from âÞA x F to âA s F . This time, the
j
function > >
> xâ? â×RTU?)a ã >
G â?#Aä > ä á â?
vâ×Ræv!? â
ä è >« >
has a simple pole point at âAwv with residue g ?ká v!? . So we have
¨ j ä
ÿ
Ê þ è ÿ
Ê þ è ÿ
Ê þ s ÿ
Ê þ > >
T ~ s Z h
Z
h h xâ,? â¢RmTU?)a ã >
ä > ä á â?kN â
v,Fõû ü s Êÿþ ü s Z Êþ ü è Z Êÿþ ü è Êÿþ vâ×Ræv!? â
ä
a j >« h T
A > ? < T < h s
v v!?ä ç
ä
Noting that
T èZ ÿÊ þ è
Êÿþ s Êÿþ > >
xâ? â×RTU?)a ã >
~ h h è Zé E
ä > ä á â,?kN5âI2 a
v,Fõû ü s Z Êÿþ ü è Z ÿÊ þ ü è ÿÊ þ vâ¢R%v!? â
ä
and J
û > û j >«
v!?BA ?ÔA E « E
ä ä ¬
we may immediately get the asymptotic formula:

e ; > > a j û < T h lon a è
j L :@?`?ÔA x=TYç < T h < h s
m Z éº
t ^
H0fg
References
[1] Jozsef Sandor, On an generalization of the Smarandache function, Note
Numb.Th.Diser.Math. 5(1999),41-51
ON THE SYMMETRIC SEQUENCE AND ITS SOME
PROPERTIES
Zhu Minhui
1. Math and Phys Dept, XAUEST, Xi’an, Shaanxi, P.R.China
xiao-zhu123@sohu.com

Abstract For any positive integer , let Ô denotes the symmetric sequence. In this pa-
DÕ
per, we study the asymptotic properties of Ô , and give an interesting identity
Õ
for it.
Keywords: Symmetric sequence; Series ; Identity.

9
1. Introduction
For any positive integer : , we define the symmetric H
sequenceJ °UL H ± as fol-
lows: L \ AÈTE(L j AÈ>TTE(L s AÈ> Tv=TE(L < AÈTvv=TE(L AÈTvxv=TE(> L AÈTvx> xv=TE
¯¯¯E(L j ¸ \ A Tvx¯¯¯ RëTU? RoTU?X¯¯¯qxv=TE(L j ¸ AòTvx¯¯¯ RëTU? 4 R
TU?X¯¯¯qxv=TE¯¯¯,^ In problem 17 of [1], Professor F.Smarandache asks us to study
the properties of the sequence °UL H ± . About this problem, Professor Zhang
Wenpeng µi> [2] gave an interesting µi> asymptotic
µi> formula
µ > for it. In this µi> paper, we
define L H ? as follows: L \ ?BAªTE L j ?ÔAwv5E L s ?BA E¯¯¯UE L j ¸ \ ?#A
µ > ¸ > h
T h v h ¯¯¯ h ×R.T h h ×R.T h ¯¯¯ h TE L j ?#A T ¯¯¯ h ×R.T h h h
h h
¯¯¯ µ >TU?VE¯¯¯ ^ We shall use elementary method to study the
RT µi> properties
of sequence L H ? , and obtain an interesting identity involving L H ? . That
is, we shall prove the µi> following:
Theorem. Let L H ? as the definition of the above. Then we have
e T û j h
É µi> A « T^
H \ L H ?
9
In
µi>
this section, we complete the proof of the theorem. From the definition
of L H ? , we know that
µ > ¸ µ > ¸ RT h

L #? A L \ ? h Ì T^
Ë v
So by this formula we have
eH µi> ¸
H0e \
µ > ¸
i e H RT h
L B? A L \ ? h Ì :#^ (1)
¸ ¸ ¸ v
\ \ \ Ë
From (1) we may immediately get
e H >
µi> RT h :RTU? j h
L H ?#A Ì :{A ñ ö :#^ (2)
¸ v
\ Ë
In the following, we separate the summation in the Theorem into two parts.
For the first part, if :yAwv h T , we have
> h TU?]RT j
µi> v h v h T×A > h TU? j ^
L H ?BA ñ ö (3)
For the second part, if :yAwv , we have

>
µi> viRTU? j h
L H ?BA ñ ö v'Aë j h u^ (4)
> è
J
Combining (2), (3), (4) and note that v!?BA we have
ä
e T T h e T T h e
É µi> A µi> É > É >
H \ L H ? L \ ? ¸
\ T U ? h j ¸ h
\ TU?
e T h e T
A É É > h
¸ j ¸ UT ?
\ \
> h e T T
A v!? É R h
ä ¸ \ T
û j h
A « T^
References
House, 1993.
[2] Zhang Wenpeng: On the symmetric sequence and its some properties.
THE ADDITIVE ANALOGUE OF SMARANDACHE
FUNCTION
Yao Weili
mimi5512867@126.com
Abstract In this paper, we use the elementary method to study the mean value properties
of the additive analogue Smarandache function acting on the integral part of the
© -th root sequence, and give two interesting asymptotic formulae.
Keywords: Smarandche function; Additive analogue; Divisor function; Mean value.

9
1. Introduction
>
Let :ëbv be a positive integer, L :@? denotes the integral part of the -th
>
root sequence, we can express it as L :@? A : ² 3 Ö . In paper [2], Jozsef Sandor
Ó
defined the following analogue of the Smarandache function:
; > Á >
íìzr °C à Ös a
\ a?ÔA C.K ±!E`aà TE×?VE
which is defined on a subset of real numbers. In this paper, we study the mean
value properties of the additive analogue Smarandache function acting on the
floor of the -th root sequence, and obtain two interesting asymptotic formulae.
That is, we shall prove the following:
Theorem 1. For any real number ambv and integer %bdv , we have the
asymptotic formula
> >
e ; > > a pzÏÐ a ¥
h l ~ a pzÏÐ a? pzÏÐ pÏÐpÏÐ a ² 3 ?
\ L :@?`?BA > pÏÐpÏÐ 3 ^
H0fg pÏÐpÏÐ a ² 3 a ² ?j
Theorem 2. For any real number a{bv , we have the estimate

e > ; > a pÏÐ j a pÏÐÔpÏÐpÏÐ a
N :@? \ :@?BA pÏÐ pÏÐ T hml pÏÐpÏÐ a B E
H0fg a
>
where N :@? be the divisor function.
9
In this section, we shall complete the proof of the Theorems. Firstly, we
need following:
Lemma 1. For any real number a{bv , we have the mean value formula
> >
e ; > a pzÏÐ a hml a pÏÐ a? pÏÐpÏÐ pÏÐ a?
\ @
: #
? A pzÏÐ pÏÐ a > pÏÐ pÏÐ a?kj ^
H0fg
; > Á
; >
Proof. From the>
definition ofÁ \ , we know that if
C %
R U
T V
?
K
Â : C.K , then
\ :@?BADC . For C£R.TU?VKIÂ: C.K , by taking the logistic computation in the
two sides, we have
We \ Á eW
pÏÐ FÔÂ pÏÐ : pÏÐ F(^
Ê \ Ê \
Using the Euler’s summation formula, we get
eW We \
pÏÐ FÄAC pÏÐ CRcC hml > pÏÐ C{?#A pÏÐ F¤^
Ê \ Ê \
So
pÏÐ :{ADC pzÏÐ CR.C hml > pÏÐ C{?VE
then we can obtain pzÏÐ :

C A h¥l > TU?VE
pÏÐ CRT
we continue taking the logistic computation in two sides, then

>
pÏÐ : pÏÐ :@? > pÏÐ pzÏÐ pÏÐ :@?
CÑA pÏÐÔpÏÐ
h l > pzÏÐ pÏÐ
: :@? j ^
Using the Euler’s formula, we have the estimate
e ; > e e
\ @ : ?ðA C
H fg H fg W \)¶Ç H f W¢Ç >
e zp ÏÐ : pÏÐ :@? > pÏÐÔpÏÐpÏÐ :@?
A hml > pÏÐpÏÐ
pÏÐ pÏÐ : :@?kj B
H fg
pÏÐ : > >
e h¥l a p ÏÐ a ? p ÏÐ[pÏÐÔpÏÐ a?
A pÏÐÔpzÏÐ : > pÏÐ zp ÏÐ
H fg a?kj
> >
a pzÏÐ a hml a p ÏÐ a ? pÏÐ[pÏÐÔpÏÐ a?
A pzÏÐ pÏÐ a > pÏÐÔpÏÐ ^
a?kj
Lemma 2. For any real number a{bv , we have the estimate
e > > >G
N :@?BA³a pÏÐ a h vRmTU?)a hl a2?VE
H fg
where is the Euler’s constant.
The additive analogue of Smarandache function 101

Now we use the above Lemmas to complete> the proof of the Theorems. First
we prove Theorem 1, from the definition of L :@? , we have
e ; > > e ; n : 3 Ö t
\ L :@?`?ÔA \
H fg H0fg Ó ²
e ; > h e ; > h
A \ TU? ¯¯¯ h
\ v!?
\² f Ê j ² Ê
j ² f s ²
h e ; > > ¸ \)Z
\ ? hl ?

Ø
f² Ê fg) Ø Z@\) ²
e ¸ ¸ ;> ¸
A n > f h TU? Ï R f t f5?
hml > )\ Z ?
\f c f Ø
Let
> >
µi> e a pÏÐ a hml
; > a p ÏÐ a ? p ÏÐpÏÐ pzÏÐ a?
a?ÔA \ :@?BA pÏÐÔpÏÐ > pÏÐ zp ÏÐ E
H0fg a a?kj
> > h ¸ ¸ ¸cÁ > ¸
and G f ?A f TU? Ù R f , suppose a£Â h TU? , then by Abel’s
identity we can get
e ; > >
\ L :@?`?
H fg
Ø
µi> > µi> > µ >®Å >®Å Å > ¸ \)Z
A ?G ?]R v!? G ! v ?ÄR ? G} ?kN hml ?
ü j
pzÏÐ %> zp ÏÐ >
m
h l ? p ÏÐ pÏÐpÏÐ ? ¸
n > h TU? R t
¸
A pzÏÐÔpÏÐ > pÏÐpÏÐ B

?kj
Ø Å pÏÐ Å Å>
pÏÐ Å ? > pÏÐ pzÏÐ pÏÐ Å ? ¸ ¸
R Å hml > Å n >®Å h TU? R Å t } N Å
ü j pÏÐ pÏÐ pÏÐpÏÐ ?kj B
¸ pÏÐ ¸ > pÏÐ > pzÏÐ pÏÐpÏÐ
hl ~ ? ?
A pÏÐÔpzÏÐ > pÏÐ pÏÐ
?kj
> >
a pzÏÐ a m
h
l ~ a pzÏÐ a? pzÏÐ pÏÐpÏÐ a ² 3 ?
A > pÏÐpÏÐ 3 ^
pÏÐ pÏÐ a ² 3 a ² ?j
This completes the proof of the Theorem 1.
Now we prove Theorem 2. From the process of proof Lemma 1 and apply-
ing Lemma 2 we have
e > ; >
N :@? \ :@?
H0fg
e e >
A N :@?)C

H0fg W \)¶Ç H f W¢Ç
>
e > zp ÏÐ : pÏÐ :@? > pzÏÐ pÏÐpÏÐ :@?
A N :@? hml > pÏÐpÏÐ
pÏÐpÏÐ : :@? j B
H0fg
p ÏÐ : > pÏÐ >
e > hml e > :@? pÏÐ pÏÐ pÏÐ :@?
A N :@? pÏÐ pzÏÐ N :@? > pÏÐpÏÐ
H0fg : H fg :@?kj
Let µi> e > > > G

a?BA N @ : ?ÔADa pÏÐ a h vRTU?)a hml a2?VE
H fg
and zp ÏÐ Å > pÏÐ Å > pzÏÐ pÏÐpÏÐ Å
>®Å >®Å ? ?
G \ ?#A pÏÐpÏÐ Å E G j ?BA > pÏÐpÏÐ Å
?j
^
From Abel’s identity, we can obtain
e > ; >
N @: ? \ :@?
H fg
µi> > µ > > g µi>®Å >®Å Å
A a? G \ a?ÄR v!? G \ v!?]R ? G\ } ?kN h
ü j
i
µ > > µ > > g µi>®Å ®> Å Å
h l a? G j a ?]R v!? G j v!?#R ? G} k? N
ü j j
a
p
Ï Ð j a hml ~ a
p
Ï Ð j a
p
Ï Ô
Ð
p
Ï
Ð
p
Ï Ð a
A pÏÐ pÏÐ a > pÏÐpÏÐ a2?kj

a pÏÐ j a pÏÐÔpÏÐpÏÐ a
A pÏÐ pÏÐ a T hml pÏÐpÏÐ a B ^
References
[1]. F. Smarandache. Only Problems, Not solutions. Xiquan Publishing
House, Chicago, 1993.
[2]. Jozef Sandor. On an additive analogue of the function S, Smarandache
Notions Journal, 2002,13, pp266-270.
[3]. Apostol T M. Introduction to Analytic Number Theory, New York,
AN ASYMPTOTIC FORMULA ON SMARANDACHE
CEIL FUNCTION
Li Jie
Department of Mthematics, Northwest University, Xi’an, Shaanxi, P.R.China
jli0815@126.com
asymptotic properties of the Smarandache ceil function acting on factorial num-
ber, and give an interesting asymptotic formula.
Keywords: Smarandache ceil function; Factorial number; Asymptotic formula.

9
1. Introduction
For a fixed; positive
> integer and any positive integer : , the Smarandache
ceil function ¸ :@? is defined as follows:
; ¸ > ts ¸
:@?#A íìzr °Còà : J C ±!^
This
; ¸ > was introduced by Professor F.Smarandache. In [1], Ibstedt presented that
:@? is a multiplicative function. That is,
> ¬ > ; ¸ > ; ¸ > ; >
LIE à ? LXE ?ÔAªI T ® L ¯ ?BA L4?]¯ ¸ ?V^

; > |
It is easily to show ¸ ?#A ¯ ²@° , where
| | è is a prime | ³
and ±aO² denotes the least
integer greater than a . So, if :A \ 3 j ¯¯¯ i is the prime decomposition
of : , then the followinig identity is obviously:
è ³
; ¸ > ; ¸ > | | è | ³
D ¯ 3 ¯ ¯
:@?#A \ 3 j ¯¯¯ i ?#A \ ² ° j ² ° ¯¯¯ i ² ° ^ (1)
In this paper, ; we> used the elementary method to study the value distribution
properties of ¸ :#K ? , and given an interesting asymptotic formula. That is, we
shall prove the following
Theorem. Let be a given positive integer. Then for any integer :.bx , we
have the asymptotic formula:

>_; ¸ > : > pzrpzr h P m
h l :
:#K ?`?ÔA : ? pzr : E
´
P
9
2. Some simple lemmas
Before the proof of the theorem, some simple lemmas will be useful.
Lemma 1. Let : be any positive integer, we have the asymptotic formula:

e T : ¥
h l :
< pzr] A pzr j z
p r s : E (2)
fH :
where denotes primes.

Proof. From Abel’s identity (see [2]), we have
e T > T h H >®Å T Å
< pzr] A³û :@? p7r û ? Å zp r Å N E
fH : ü j j
>
where û @ : ? denotes the number of the primes up to : . Noting that

> : h¥l :
û :@?BA pzr E
: z
p r j :
we can get
e T : h¥l :
< pzr] A pzr j : pzr s : ^
fH
Lemma 2. Let C be any positive integer, we have the asymptotic formula:

e T µ T
< A pzrpzr : h hml
pzr : E (3)
f W
µ
9
| | è |D³
:#K A \ 3 j ¯¯¯ i ^
From (1) and the completely additive property of function , we can write
è ³ i ´ }
>_; ¸ > ¯ 3 ¯ ¯ e Ê
:#K ?`?BA ² ° j ² °
¯
¯ ¯ i ² ° A ^ (4)
\
Ê \ ¹ »
´ ´
It is clear that
} Ê A e :
É ñ cÊ ö E FÄAªTE¤v5E¯¯¯,E ^
c \
An asymptotic formula on Smarandache ceil function 105
Ö ½
Ým: then < H a A
c
Noting that if , from Lemma 1 we can write
Ó
jk mn
k n
>_; ¸ > e k
k T e : n
n
: K ?`?
# A < ñ cÊ ö

´ fH c f !#
jk ! @
# Û mn
k n
e k
T e !! # # : pzr : n
A
k hml n
< c pzrÄ
fH xÚ c \
Û
e e !# p7r :
T !# : h¥l hml

:
A < c pzr] pzr :
fH Ù Úc
\

: e T e T hl :
A < R < pzr :
R T
Û >
fH f H
!# RTU?
!#
: e T hml Ú :
A < pzr :
fH R T

: e T h e T hl :
A < < > pzr : ^ (5)
fH fH RTU?
Noting that

e T e T e T hl T
< > A < > R < > A E (6)
fH RTU? RTU? Y H RTU? :
e T
where A < > is a constant. Combining (5), (6) and Lemma 2, we
RTU?
can get
>_; ¸ > : > zp rpzr P :
: K ?`?ÔA
# : h ? hml pzr : ^
´
References
[1] Ibstedt. Surfinig On the Ocean of Numbers- A Few Smarandache No-
tions and Similar Topics, Erhus University Press, New Mexico,USA.
[2] T.M.Apostol. Introduction to Analytic Number Theory, Springer-verlag,
New York, 1976, p77.
[3] F.Mertens. Ein Beitrag Zur Analytischen Zahlentheorie, Crelle’s Jour-
nal, 78(1874), 46-62.
A HYBRID NUMBER THEORETIC FUNCTION AND
ITS MEAN VALUE
Gao Nan
School of Sciences, Department of Mathematics, Xi’an Shiyou University, Xi’an, Shaanxi, 710065,
P.R.China
gaonan 0 0 ren@yahoo.com.cn

Abstract Let and are two primes, T8 denotes the largest exponent of power which

divides . And Ü is the cubic complements. In this paper, we study the
properties of this sequence
Ò AÞÝA BßB , and give an interesting asymptotic formula
for the mean value ) AÞÝA BßB .
?U S
Keywords: Asymptotic formula; Largest exponent; Cubic Complements.
9
1. Introduction
>
Let and are two primes, W :@? denotes the largest ¸ exponent of ¸ power
>
which divides : . It is obvious that W :@?×A if divides ,>
: but Z@\) does
not. For any positive integer >
: , the cubic complements :@? is the smallest
positive integer such that : :@? is a perfect cubic. In problem > 28 and >
68 of
[1], Professor F.Smarandache let us to study the sequences W :@? and :@? . In
thisÒ paper, we use the elementary methods to study the mean value properties
of O H , and give an interesting asymptotic formula for it. That is, we
H0fg
ý
will prove the following :
Theorem. Let and are two primes, then for any real number a{boT , we
have the asymptotic formula
e j h j h >
a hml a è3 Zé ?VE
H 7 A
j
h
h T
H fg ý

From this Theorem we may immediately deduce the following
Corollary. Let be a prime, then for any real number acbdT , we have the
asymptotic formula
e > è

H 7 à
A ,a hl a 3 Zé ?VE
H0fg ý
9

In this section, we will complete the proof of the theorem. Let positive
integer :A sá jâ , where á E â are square free numbers and > á E â ?ÔAdT . Then
,> >
from the definition of :@? , we can get :@?[A á â j . For any prime and any
nonnegative integer C , we have
Å
TE F)G CÑAwx
> IW Å
?#ã
A j E F)G CÑAwx Å h T (1)
E F)G CÑAwx h v
For any complex â , we define the function

> e H 7
G â?#A É ^
H \ :Úý ã
> >
It is clear that for any positive integer : , W :@? is an additive function and :@?
is a multiplicative function. So we can prove that [ H is also a multiplica-
tive function. > > ý >
If Re â? ÝoT , then from the definition of W :@? and the formula TU? , applying
the Euler product formula (See Theorem 11.6 of [3]), we can get:
<
> e O H 7 e O -
G â?#A É A < ~ É W ã
3

H \ Ú
: ý ã ç W ê ý \ <
3 <
è
e O \) e O e O
~ h 3 h 3
A < É s ã É
s Z@\) ã É
s Z j ã
ç \
3 ê ê \ ê \
~ É e T e j e T h T h
A s h É
s @
Z )
\
h É
s Z < T h ¯¯¯
ã ã j ã ç ã\ j(\ ã
ê ê ê 3

ã
s h{ j j(ã h{ ã T T
A <ç T h h h ¯¯¯

s ã RT ã\ j(\ ã
3

> j(ã
h{ j ã h{
A â,? ~ h ã h T ^
ä j(ã
½
By Perron formula (See [2]), takinig â A , Awv , ADa s j , then we have
ê
Êÿþ
e
H 7 A T j Z > > a ã >
N â hml a \ j Zé ?VE

ÿ
Ê þ â?ká â,?
H fg vûF ü j ä â
ý
óè < è ó <
> óZ ó Z
where á â?#A è
Z Z@\ and is any fixed positive number.
Now we estimate the main term
Êÿþ
T j Z > > a ã
ÿ
Ê þ â,?ká â? N â0E
vûF ü j ä â
A hybrid number theoretic function and its mean value 109

we move the integral line from v F to T v F , this time, the function
> > a ã
â,?ká â?
ä â
>
have a simple pole point at âAªT with the residue á TU?)a , so we have
Êÿþ \ j Z Êþ \ Êÿþ Êÿþ
T ~ j Z h h j h j > > a ã >
â ?ká
â ? N5âºA³á TU?)a@^
vûF ü j Ê þ ü j Z Êÿþ ü \j Z ÿ
Ê þ ü \j ÿ
Ê þ ä â
ADa è , we have

Taking
T ~ è3 Z ÿÊ þ j
ÿÊ þ
> > a ã
÷ h â?ká â,? N5â ÷
÷ vûF ü
÷ j Z Êÿþ ü è3 Ê þ ä â ÷
÷
÷ ÷
÷ j >ù h > a j ÷
2 ÷ F ?ká â,? ÷ N ù
ü è3 ÷÷ ä ÷
÷
÷ ÷
a j Z÷ é è ÷
2 ADa 3 Zé ¼
And we can easy get the estimate
T è3 Ê þ > > a ã
þ
> T h Å > a è3 Å è
÷ ÿ
Ê þ â,?ká â? N â ÷ 2 ÷ F k? á â? Å ÷ N 2Èa 3 Zé ^
÷ vûF#ü è3 Z ä â ÷ ü ÷ä v ÷
÷ ÷ ê ÷ ÷
÷ ÷ ÷ ÷
÷ ÷ ÷ ÷
Noting that
> j h j h
á TU?BA h h E
j T
so we have the asymptotic formula
e
H 7 A j h j h > è
a hml a 3 Zé ?V^

j
h
h T
H fg ý
References
House, 1993.
Theory. Beijing: Science Press, 1991, pp 98.
Springer-Verlag, 1976, pp230.
ON THE SMARANDACHE PSEUDO-NUMBER
Lou Yuanbing
yblou@hotmail.com
Abstract In this paper, we study the counting problems of the Smarandache pseudo-
number sequences, and give some interesting asymptotic formulae for them.
Keywords: Pseudo-odd numbers; Pseudo-even numbers; Pseudo-multiples of Sequence;

Asymptotic formula.
9
1. Introduction
According to reference [1], a number is called pseudo-even number if some
permutation of its digits « is ½a even number,
« including the identity permutation.
½ ½
For example: E¤v5E E E +5ET ETv5ET ET E?T +5E¤v E¤v=TE¯¯¯ are pseudo-even num-
bers. Similarly, a pseudo-odd number is defined that if some permutation of
½
its digits is an oddµ number, such as TE¤x5E¤5E E¤¬5ET ETTEUTv=ETUx5E¯¯¯ are pseudo-
odd numbers. Let and denote the set of all the pseudo-even numbers and
the pseudo-odd numbers respectively. In addition, a number is called pseudo-
multiple of if some permutation of the digits is a multiple of , including the
½ ½ ½ ½ ½ ½
identity permutation. For example: E¤5ET ET5E¤v E¤v5E¤x Eqx=E E¤ EV=T!E¯¯¯
P
are pseudo-multiple of numbers. Let denotes µi> the
> set ofP all > the pseudo-
multiple of numbers. For convenience, let a? , a? and a2? denote the
number of pseudo-even numbers, pseudo-odd numbers, and pseudo-multiple
of numbers that not exceeding a . That is,
µ > e > e P > e
a2?BA T¼ a?#A T¼ a?#A T^
H
H )Æ
H )ä

H fg H fg H fg
In reference [1], Professor F. Smarandache asked us to study the properties of
the pseudo-number sequence. In this paper, we use the elementary method to
study the counting problem of these three sequences, and obtain three interest-
ing asymptotic formulae for them. That is, we shall prove the following:
pzr
p7r > a'R µi> a?`? A pzr a hml > TU?V^
pzr T ½
pzr
pzr > a R > >
a?`?BA p7r ½ zp r a h¥l TU?V^
T
pzr +
pzr > a R P > a2?`?BA 7p r a h¥l > TU?V^
pzr T ½
9
2. A Lemma
To complete the proof of the theorems, we need the following lemma:
Lemma. For any real number a{boT , we have the inequalities
¸ Á µi> > ¸
a R a?Â RTU?V¼
¸ Á > > ¸
a'R a2?Â RmTU?V¼
¸ Á P > + > ¸
+ a'R a?[Â + RmTU?VE

½ ¸ Á ½ ¸ Z@\
where is a positive integer such that T {
a o
Â T .
½ ¸ïÁ ½ ¸ > Á
pÏÐ aÞÂw h T . According
Proof. Let T aÞµ ÂªT Z@\ ybªTU? , then Á
to the definition µ of ¸ set , we know that the largest number of digits ( a ) not
attribute set is @
Z \ . That is, in these numbers, there are one digit,¸ they
½ «
are E¤v5E E E + ; There are j two Á digits; The numberµ of the digits are .¸ So
the
H
> ¸ largest Á number
¸ of digits ( a ) not attribute set is h j h ¯¯¯ h A
@
Z \ . Then we get
< RTU?
¸ Á µi> > ¸
a R a?Â RTU?V^
Use the same method, we may immediately get:

¸ Á > > ¸
a'R a2?Â RmTU?V¼
and ¸ Á P > + > ¸
+ a'R a?[Â + RmTU?V^

This proves the Lemma.
9
Á
Now
Á we prove the Theorems. In fact from the Lemma and note that
zp r a h T we have
¸ Á 3 >
¡Í`Î=g A n ¡Í`Î Å g t ! /0 Å 3 ú A a2? ! /0 3 3 ú ADa*! #D3 Å ú
Å !#
On the Smarandache pseudo-number 113
and
¸ 3 ú >
@ Z \ b ¡Í`Î g A n ¡ Í`Î g t 3 A a? 3 ú ADa1! #DÅ ^
3 ú
Å ! /0 Å ! /0 Å !# 3
Therefore
T Á T ¸ Á µ > Á ¸ Á
@ Z \ @ Z \
F F F
a*! #D3 Å ú a R a2? a1! #D3 Å ú ^
!# !#
Now taking logarithm on both sides of above, we get

pzr
p7r > a'R µi> a?`? A pzr a hml > TU?V¼
pzr T ½
Use the same method, the following formula will be immediately got.
pzr
pzr > a R > >
a?`?#A pzr ½ pzr a hml TU?V¼
T
pzr +
pzr > a R P > a2?`?#A p7r a hml > TU?V^
pzr T ½
This completes the proof of the Theorems.
References
House, 1993, 62-65.
SEVERAL ASYMPTOTIC FORMULAE ON A NEW
ARITHMETICAL FUNCTION
Guo Jinbao and He Yanfeng

College of Mathematics and Computer Science, Yanan University, Yanan, Shaanxi, P.R.China
yadxyzb2391@sohu.com
Abstract A new arithmetical function is introduced, and several interesting asymptotic

formulae on its mean value are given.
Keywords: Arithmetical function; Mean value; Asymptotic formulae.

9
1. Introduction
For any fixed positive integer : , the famous Smarandache ceil function of
order is defined as following:
; ¸ > ¸
:@?BA íìzr °a{à
J : J a ± >¬ :Þà v ?u^
; > ; > ; > ; >® ; >
For
; > « example, ; > j TU?A T ; , > j v!?AM

v ; , > j x!?AÈx , j ?A v , j !?AÈ ,
«
j ? A , j ?iå A , j +!? A , j ¬!? A x , ¯¯¯ . This function was first
introduced by Professor Smarandache [1], and many scholars showed great
interest in it (see references [2], [3], [4]). Similarly, for any positive integer ; > :
and any fixed positive integer , we define an arithmetical function ¸ :@? as
following: ; ¸ > ¸
í % ' °a{à J a J :Ä±!^
:@?BA &
Because >¬ æv >
LXE à ? IL E Ô
? AdTE
so we have
; ¸ > ¸ ¸
L ? A íd% ' °a{à J a J L±¥¯ í&% '
°a{à
J a J ±
; ¸ > ; >
A L ?]¯ ¸ V? E
4
and
; ¸ > | ç
?ÔA ²)è E
where | éaOê | è denotes |D³
the greatest integer less than or equal to a . Therefore, if
:{A 3
\ j
¯
¯ ¯ i is the prime powers decomposition of : , then we have
³
; ¸ > | | è | ³ ç 3 ç ; | ; | ³
\ 3 j
¯
¯ ¯ i Ô
? A ²è
¯
¯ ¯ ²è A \ 3 ?X¯¯¯ i ?V^
; >
So ¸ :@? is a multiplicative function. There are close relations between this
function and the Smarandache ceil function [4]. In this paper, > ; ¸ > we shall use
analytic methods to study the mean value properties of ù | :@?`? , and give
several asymptotic formulae for> it. That Ò is,|
we shall prove the followings:
½ ù
Theorem 1. Let } b , | :@?[A N . Then for any real number acb·T
H
and any fixed positive integer bv , we have the asymptotic formula
¸ >
=
1 3 ?
e ù | n ; ¸ > :@?kt'ë
¨ | ²
Z@\ a ²
4
1 3 m
h o
l n a è 1=² 3 Zé tE rì ì } ÝiRmTE
A > Á
H fg R } ?)a hml n a è3 Zé t E rì ì } iRmT^
ä
>
where â,? is the Riemann > zeta-function, and be any fixed positive number.
ä
Theorem 2. Let N :@? denotes the divisor function. Then for any real num-
ber ayb£T and any fixed positive integer bDv , we have
e ; > >
N n ¸ :@? t A ?)a hml n a è3 Zé t ^
H fg ä
Taking Awv5E¤x in Theorem 2, we may immediately deduce the following:

Corollary. For any real number ayboT , we have
e ; > û j hmlon è3
N n j :@?kt'A « a a Z ét ¼
H fg
e <
; > û è Z é
N n s :@?kt'A ½ a hmlon a 3 t ^

H fg ¬
9
In this section, we shall complete the proof of the Theorems. First we prove
Theorem 1. Let
ù | n ; ¸ > :@?kt
> e
G â,?#A É ^
H \ :Úã
; >
From the Euler product formula [5] and the multiplicative property of ù | n ¸ :@? t
we have
¸
ù | n ; ¸ > ?kt ù | n ; ¸ > ?kt
> h h ¯¯¯ h h ¯¯¯*
G â? A < T ¸
ç ã ã

ù | > TU? ù | > TU?
A T h h ¯¯¯ h ¸
< \) ã
ç ã
ù > ù | > ? ù | : j >
h | ¸ ? h ¯¯¯ h ¸ h ¸ h ¯¯¯
ã j \) ã j ã
Several asymptotic formulae on a new arithmetical function 117
< \ó < \ó h { | | h |
TR h TR ~ T ¸ h T h ¸ { j h
A < < ²\ ó ²<
ó ¯¯¯
ç TR TR \ ã ã

>
A â? < T h ¸ T | h ¸
T
|
h ¸
T
|
h ¯¯¯
ä ç ã j ã s ã
> >
A 4â×R } ?VE
â?
> ä ä
where â? is the Riemann zeta-function. Obviously, we have inequality
ä
Á ù | n ; ¸ > :@?kt
J ù | n ; ¸ > :@?kt J e T
:#E ÷ É ÷ Â
÷
÷H \ O
: ø ÷
÷
ù RT[R ¸ \ E
| Z@
÷ ÷
| Z@ ÷ ÷
where ù ÝoT h ¸ \ is the real part÷ of â . So by Perron ÷ formula [5], we have
ù | n ; ¸ >@
: ?t
e
H fg :Úã ú
T Z Êÿþ > a ã
> h ù
A h N â m h l ~ a ?
ê
v,Fõû
ü ý Êÿþ G â â ?
ê â ý

> >
p
Ï Ð a > > a
h l ý a \ øú v,a? íì7r TE ? hml a øú ? í'ìzr TE J J JJ ? E
a
¾ a ¾ A J a R J . Taking
where is the nearest integer to a ,
}h T
½ h T è 1=3 > >ù T
â A E A p7r a E ADa ² E a ?BADa@E
?BA ù Z¸ \ E
| @
ê R TR
m
we have
e Z Êÿþ > a ã

ù | n ; ¸ > :@?kt'A T
â? 4â×R
> } ? N â m
h o
l n è
a 1=² 3 Zé t^
,
v õ
F û
ü ý ÿ
Ê þ ä ä â
H fg
| Z@¸ \ h \ ý
Taking LiA ¡ 4g , to estimate the main term
j
T Z Êÿþ > > a ã
ÿ
Ê þ â? 4â×R } ? N â0E
v,Fõû ü ý ä ä â

we move the integral line from ý â A F to â'A¿L F . This time, when
} ÝïRT the function
> > > a ã
G â,?#A â? 4âR } ?
ä ä â
¸ >
| Z@ \ 1=3 ?
has a simple pole point at âA ¸ with residue | Z@² \ a 1= ¨ 3
² . So we have
T ~ Z Êÿþ ß Z
Êÿþ
ß
Êþ Êÿþ > > a ã
h h h â,? 4â¢R } ? N â
v,F)û ü ý ÿ
Ê þ ü Z ÿ
Ê þ ü Z ÿ
Ê þ üý ÿ
Ê þ ä ä â
ß ß
| ¸ \
n ý Z@ t ý
A ä 143
}h T a ² ^
Note that
ÿÊ þ Êÿþ Êþ
T ß Z
~ ß > > a ã è
h h â? 4âR } ? N5âI2Èa 1=² 3 Zé ^
ü Z Êÿþ
v,Fõû ü Z ÿÊ þ üyý Ê þ ä ä â
ß ß
ý we can immediately get the asymptotic formula:
From the above
e n | Z@
¸ \ t
ù | n ; ¸ >@
: ?kt'A ä 1 = 3 m
h £
l n a =
è1 3
Z éº
}h T a ² ² t ^
H fg
This proves the first part of Theorem 1.
½ Á } Á
If iRT , then the function
> > a ã >
G â,?#A 4â×R } ? â?
ä ä â
>
has a simple pole point at âAªT with residue R } )? a . Similarly, we can get
ä
the asymptotic formula:
e ù | n ; ¸ > :@?kt'A >
R } ?)a hmlon a è3
Z é
t ^
H fg ä
This proves the second part of Theorem 1.

½
Taking } A in Theorem 1, we can easily get the result of Theorem 2. This
completes the proof of the Theorems.
References
House, 1993.
[2] Ibstedt. Surfing on the Ocean of Numbers-a few Smarandache Notions
and Similar TOPICS. USA New Mexico: Erhus University press, 1997.
[3] Ibstedt. Computational Aspects of Number Sequences. USA Lupton :
American Research Press, 1999.
[4] S. Tabirca and T. Tabirca. Smarandache Notions Journal, 2002, 13: 30-
36.
ON
¦
THE SMARANDACHE FUNCTION AND THE
-TH ROOTS OF A POSITIVE INTEGER í
Li Hailong and Zhao Xiaopeng

Department of Mathematics, Weinan Teacher’s College, Weinan, Shaanxi, P.R.China
lihailong0914@163.com
Abstract The main purpose of this paper is using the elementary method to study the mean
value properties of the Smarandache function acting on © -th roots sequences, and
give an interesting asymptotic formula.
Keywords: Smarandache function; © -th roots; Mean value

9
1. Introduction
>
Let : be an positive integer, L ¸ :@? denotes the integer part of -th root of : ,
>
that is L ¸ :@?¹A : ² 3 Ö , where a= is the greatest integer that less than or equal
Ó
to real number a . In problem 80, 81, 82 of [1], professor F.Smarandache let
us to study the properties of the sequences L ¸ > :@? . The famous Smarandache
;>
function :@? is defined as following:
;> s
:@?BA í'ìzr °C Còà E`: J C.K ±!^
It seems no one know the relation between this sequence and the Smaradache
function before. In this paper, we study the mean value properties of the
Smarandache function acting on the -th roots sequences, and give an inter-
esting asymptotic formula. That is , we shall prove the following conclusion:
Theorem. For any real number aybDx , we have the asymptotic formula:
e ;> ¸ > û j a )\ Z ² 3 hml ~ a

)\ Z 3
²
L @ : ?`?BA « > pzr j a ^
H fg h UT ? pzr a
9
2. Some Lemmas
To complete the proof of the theorem, we need some simple> Lemmas. For
convenience, we denotes the greatest prime divisor of : by :@? .
î
This work is supported by the Education Department Foundation of Shannxi Province (03JK213).
> G ;> >
Lemma 1. If :@| ? Ý | è : , then :@?#A
| ³ >
:@? .
Proof. Let :{A \ 3 j ¯
¯ ¯ i : @ ? , so we have
| | è | ³ G
\ 3 j ¯ ¯¯ i Â :
then | Õ >
Ê J :@?VKE F AdTE¤v5E¯¯¯ E ^
Ä
> > > > ;> >
So : J :@?VK , but :@? P :@?@RTU?VK , so :@?BA :@? .
Lemma 2. Let aob T be any real number, then we have the asymptotic
formula:
e ;> û j a j hml ~ a j
:@?#A pzr j a ^
H fg Tv p7r a
Proof. It is clear that

e ;> e ;> e ;>
:@?#A :@? h :@?V^ (1)
H0fg < 0H fg < H fg
H Y N H H f N H
From the Euler summation > formula we can easily get the estimate of the second
term in the right side of TU? :
e ;¢> e G
:@3
? 2 : pzr :
< H0fg H fg
H f N H
g G Å g >®Å
A pzr Å N Å h Å > G Å pzr Å
R ®?
Ë
Å
? N h
G >
a pzr a a'|
R =
a ®?
ü \ ü \
è
2 a pzr a@^ (2)
Now we calculate the first term. From Lemma 1, we can write
e ;> e ;> e
:@?ðA < :@?#A
< H fg < H fg <
Y N H
H f < N g
H Y N H N ) g f S
e e
A < ^ (3)
H0O f N g N ) g f S

>
Let û a? denotes the number of the primes up to a . Noting that

> a hl a
û a?ÔA pzr pzr j a E
a
from the Abel’s identity [2], we have

e >
a a S û ®> Å k? N Å
G G
< A û R û a? a R
: : ü N g
g f S
N )

On the Smarandache function and the -th roots of a positive integer 1 121
a j T a j hml ~ a j
A R
:Oj pzr a v :Oj p7r a : j p7r j a
a j hl~ a j
A ^ (4)
v,:Oj pzr a : j pzr j a
Because
T e > hml T
A (5)
v!? E
:Oj ä a
H fON g
> > > >® >
Combining TU?VE v!?VE x!?VE ? and !? , we can get the result of Lemma 2.
Lemma 3. For any positive integer and nonnegative integer F , we have
the asymptotic formula:
Õ è Õ è
e ÊÅ ;>®Å û j a ² 1 1
?#A « > h hml ~ a ² ^
F v!? z
p r a z
p r j a
fg 3 \
²
Proof. Applying Abel’s identity, combining Lemma 2, we have
e Å Ê ;¢>®Å > Ê e ;¢>®Å g ²3 \ e ;¢>E ÅÊ \ Å
? A a ²3
R TU? ?]R F C ? N
fg 3 \ fg 3 \ ü \ f
² Õ è ² Õ è
Ê
j
û a ² 1 Fõû j g ² 3 \ Å Z@\ Å 1
hml ~ a ²
A
Tv pzr a
R
Tv ü \ pzr Å N zp r j a
Õ è Õ è
û j a 1² hml ~ a 1
²
A « > h z
p r z
p r ^
F v!? a j a
9
In this section, we will complete the proof of the theorem. For any real
number ayb£T , let À be a fixed positive integer such that
¸ Á > ¸
À ayÂ À h TU? ^
Then we can write
e ;> ¸ > e \ e ;> ¸ > e ;¢> ¸ >
L @ : ?`? A Ã L @ : ?`? h L @ : ?`?
\
H fg ² f H @ Z \) ² ² fH(g
e \ >®Å h ¸ Ã
Å¸ ¢ ; >®Å h e ;>
A Ã TU? R ? Àª?
\
f² Hg
¸
e \ F e ÅÊ
Ã
; >®Å hmlon 3
A ? a ² t
Ê ô
ê 3
fg ² 3
Now from Lemma 3 we have

¸ Õ è Õ è
e ;> ¸ > e \ F j
~ « > û a ²
1
h¥l~ a ²
1
hml n a 3 t
L :@?`? A h p z r z
p r ²
H0fg Ê F v!? a j a ¢

ê
û j a \)Z ²
3
hml ~ a
)\ Z 3
²
A « > h p7r a pzr j a ^
TU?
References
Chicago, 1993.
Verlag, New York, 1976, pp77.
[3] Pan Chengdong and Pan Chengbiao. Foundation of the Analytic Number
Theory, Science Press, Beijing, 1991.
ON A DUAL OF THE PSEUDO SMARANDACHE
FUNCTION AND ITS ASYMPTOTIC FORMULA
Liu Duansen and Yang Cundian

Institute of Mathematics, Shangluo Teacher’s College, Shangluo, Shaanxi, P.R.China
Abstract In this paper, we study the mean value of the Pseudo Smarandache function and
give an asymptotic formula.
Keywords: Simple numbers; Pseudo Smarandache function; Asymptotic formula.

9
1. Introduction
According to [1], a number : is called simple number if the product of its
proper divisors is less than or equal to : . For example: 2,µ 3, 4, 5, 6, 7, 8, 9,
10, 11, 13, 14, 15, 17, 19, 21, ¯¯¯ are simple numbers. Let denote the set of
all the simple numbers. In [2], Jozsef Sandor denoted the dual of the Pseudo
Smarandache function by analogy by Û v as following:
> h
> í % ' °C à v s C C TU? J
Û v :@?BA & :Ä±!E
v
Remark: >
Û v TU?ÔAªT¼
and ïì ì
> v5E A x
w
Û v ?#A» ìrìI Aw
TE e 5x ^
where is an arbitrary prime. >
In this paper, we study the mean value of Û v :@? and give an asymptotic
formula. That is, we shall prove the following:
Theorem. For any real number ayb£T , we have
e > P a j h P a j hl ~ a j
Û v :@?BA \ pzr z
p r
j j a pzr s a ^
H a
H0fg
P P
where \, j are computable constants.
9
2. Some lemmas
To complete the proof, we need the following lemmas:
Lemma 1. Let â boT be an integer and a prime. Then:

> v5E ìrìI wA x
Û v ã ?BA » ìrì Aë
TE e 5x ^
Proof. This formula can be immediately got from Proposition 1 of [2].

Lemma 2. Let be a prime such that Awv)RT is a prime, too. Then:
>
Û v ?ÔA ^
Proof. This formulaµ can be immediately got from Proposition 2 of [2].

Lemma 3. Let :.à , then : has the form:
:{A E or j E or Xs E or 5
E
where and are distinct primes.

> >
Proof. First we define : :@?A N , and @ : ? A N . According to
ç H H ç
H
>
the definition of @ : ? , we have
> > H
: ?`? j A
@ :{AD: E
ç H
> > e
where N @ : ? is the divisor function. That is: N @ : ?#A T , then
H
> :@?BA³:
58A
è B
¼
and
>@
> :@?BA : ? 58A
A: è B \ (1)
^
:
> Á
Because : is a simple number, then we have @ : ? : , so from (1) we have
58A
è B \ Á
: :#^
That is, Á
>
N @ : ? ^
>
Then Lemma 3 can be immediately proved from the definition of N @ : ?.
½
Lemma 4. Let b and aybx , denotes a prime. Then:
¸ ¸ ¸
e ¸ T a Z@\ h T a Z@\ hml ~ a Z@\
A > h pzr s a ^
<
fg h T pzr a TU? j pzr j a
>
Proof. Noting that û a2?ºA ¡ 4g g h ¡ g è g h³l£n ¡ g g t , then by Abel identity
we have
e ¸ > ¸ g >®Å Å ¸ Å
< A û a?)a R
w û ? \ N (2)
fg ü \
¸ ¸ ¸ ¸
a Z@\ h a Z@\ hml ~ a Z@\ g Å Å
A pzr a pzr j a pzr s a Ræ ü p7r Å N
¸ j
g Å Å¸
Å hml ~ g Å
R¹ Å N Å N
ü j pzr j ü j pzr s
¸ ¸ ¸
a Z@\ h a Z@\ hml~ a Z@\
A pzr a pzr j a pzr s a
¸ ¸ Å¸
a Z@\ j h v a Z@\ hml~ g Å
R h 7
p r R > h z
p r z
p r s Å N
T a TU?kj j a ü
¸ ¸ ¸ j
T a Z@\ h T a Z@\ hml~ a Z@\
A h z
p r > h p7r s a ^ (3)
T a TU?kj pzr j a
Lemma 5. Let and are primes, Then:
e P a j h P a j hml~ a j
< A \ pzr j 7p r j a pzr s a E (4)
fg a
P P
where \ , j are computable constants.
Proof. Noting that when a Â·T , we have \ \ g A¿T h a h a j h a s h ¯¯¯ h
a W h ¯¯¯ , then
e e
< < T
f N g
f U
g
e <g <g <g
A ~ > pzr h > pzr hl ~ > pzr (5)
< a'R pzr] ? a'R pzr] ? j a R pzr] ? s
f N g
O
a e pzr] pzr j pzr W

A ~ T h h h ¯¯¯ h h ¯¯¯
pzr a < pzr a p7r j a p7r W a
f N g
O
a e pzr] p7r W \
h ~ T h v h ¯¯¯ h C h ¯¯¯
pzr j a < z
p r a pzr W \ a
f N g
O
h l e a a è h a è hml ~ a è
pzr s <g A \ pzr j a j p7r s a pzr E (6)
< a
<
f N g
O
where \, j are e computable constants. And then,

e
T <
f N
O g fgU
> g > g
> g
e ~ ? j h m
h
l ~ ? j
? j
A > > pzr
I > pzr (7)
v zp r a R pzr !
? a'R z
p r !?kj a R zp r !? s ¢
f N
O g
a j e T ~ h zp r 7p r j 7p r W
A T h h ¯¯¯ h h ¯¯¯
v p7r a , j pzr a pzr j a pzr W a
f N
O g
e pzr pzr W \
h a j T ~ T h v pzr h ¯¯¯ h C h ¯¯¯
pzr j a j a pzr W \ a
f N
O g
h l e a j
pzr s g
f N
O g j
a j e pzr
A
T h a j ~ T e h
T e T hml ~ a j
(8)
v p7r a j
pzr j a v j j
pzr s a ^

So from (6) and (8) we get,

e e e h e e > e > e
< A < < T T < R < ? TU?
fg f N g fgU f N g fgU f N g f N g
P a j h P a j hml ~ a j
A \ pzr j zp r j a p7r s a E (9)
a
P P
where \, j are computable constants. This proves Lemma 5.
9
Now we prove the Theorem. From Lemmas 1, 2, 3, 4 and 5 we immediately
get
e > e > e > e > s h e >
Û v :@? A < Û v ? h < è Û v j ? h < Û v ? < Û v !?
H
fg fg fg < f g
H0fg
e e e e
A x h < T h < è T h <
T h <
fg fg fg < f g

e e e e e
A x h < T h < T h < T h < R <
f g
è fg è
fg fg fg
P a j h P a j hl ~ a j
A \ p7r j zp r j a pzr s a ^
a
References
House, 1993.
[2] Jozsef Sandor. On a dual of the Pseudo-Smarandache function. Smaran-

dache Notions, 2002, 13: 18-23.

THE PRIMITIVE NUMBERS OF POWER AND
ITS ASYMPTOTIC PROPERTY
Liang Fangchi
fc-liang@163.com
Yi Yuan
yiyuan74@163.com

5
Abstract Let be a prime, be any positive integer, denotes the smallest integer
§¨
1 , where . In this paper, we study the mean value properties of

5
, and give an interesting asymptotic formula for it.
Keywords: Smarandache function; Primitive numbers; Asymptotic formula.

9
;I<4>
Let be a prime, ; < > : be any positive H integer,
:@? denotes
; >
the ; smallest
>
integer
; > such that
; ®
> @
: V
? K is divisible by . For example, s U
T ¢
? ª
A x , s v!?A
«
, s x!?AMx , s ?AM¬ , ¯¯¯U¯¯¯ . In problem 49 of book [1], ;<=> Professor F.
Smarandache ask us to study the properties of the sequence ° :@?¤± . About
this problem, Professor Zhang and Liu in [2] have studied it and obtained an
interesting asymptotic formula. That is, for any fixed prime and any positive
integer : ,

; < > >
:@?#A RTU?): hml pzr
p7r] ¯ : ^
In this paper,
;4<4> we will use the elementary method to study the asymptotic prop-
erties of :@? in the following form:
e
TE
H fg
ð
H Z@\) ð H
where a be a positive real number, and give an interesting asymptotic formula

for it. In fact, we shall prove the following result:
Theorem. For any real number a·bMv , let be a prime and : be any
positive integer. Then we have the asymptotic formula
e a hl pzr a
T¹A pzr] ^
ð

H
f g
H Z@\) ð H
9
following:
Lemma. Let be a prime and : be any positive integer, then we have
Hy¾ C.K¼
J ;=<> : h TU?ÄR ;=<4> :@? J A» ½ E if
E otherwise E
;4<> J
where :@?#ADC , H ¾ C.K denotes that H C.K and H Z@\ P C.K .
Proof.
> Now
;4<> we will discuss it in two cases.
Fk? Let :;4@<?#> ADC , if H ¾ C.K , then we have H J C.K and H Z@\ P C.K . From the
> > >
definition of :@? we have H ;Z@< \ P > C h TU?VK , H Z@\ P C h v!?VK , ¯¯¯ , H Z@\ P C h
>
RTU?VK and H Z@\ J C h{ ?VK , so : h TU?BADC h{ , then we get
J ; < > : h TU?]R ; < > :@? J A ^ (1)
> ;=<> H J H @
Z \ J ;<=> h
F_Fk? Let :@?[AoC , if C.K and C.K , then we have : TU?[A£C ,
so
J ;4<> : h TU?]R ;=<4> :@? J A ½ ^ (2)
Combining (1) and (2), we can easily get
H¾ C.K¼
J ;=<4> : h TU?]R ;=<> :@? J A¿» ½ E if
E otherwise ^
Now we use above Lemma to complete ; < >
the proof of Theorem. For any real
number abv , by the definition of :@? and Lemma we have
e e e
T¹A T¹ADa'R TE (3)
ð

H
f g <
H <
f g <
H
f g
H Z@\) ð H W¢Ç 143 W×Ç W×Ç
;4<=> £
H ¾
where :@? A C . Note that if C.K , then we have (see reference [3],
Theorem 1.7.2)
e C e C
: A É ÊÌ A Ê+Ì
Ê \Ë Ê
f ¡Í`Î W Ë
e T hmlonVpÏÐ <
A C¯ Ê Ct
Ê f¡Í`Î W

C zp r C
A hml (4)
RT 7p r] ^
The primitive numbers of power and its asymptotic property 131
From (4), we can deduce that

> ºpzr :
CÑA RTU?): hml p7r]o ^ (5)
So that

Á Á > ºpzr a Á Á
T C RTU?]¯a hml pzr]w E if T : a@^
Note that for > any fixed positive > integer : , if there > has one C such that H ¾ C.K ,
then Hy¾ C h TU?VK , H{¾ C h v!?VK , ¯¯¯ , H{¾ C h RDTU?VK . Hence there have
Ò Á Á >
times of C such that :A Ê É <W Õ Ö in the interval T C RëTU?¯a h
< \ Ó
lon ¡ 4< g t . Then we have
¡

e T > ¹p7r a
T A RmTU?]¯a hl pzr] B
< H0f g
¡ W×
Ç
T pzr a
A a'¯ TR h¥l (6)
pzr] ^
Combining (3) and (6), we can easily deduce that

e e
T A a'R T
ð
0
H
f g < 0
H
f ¡ Çg
H Z@\) ð H W¢
T pzr a
A a'Rca ¯ TR hml
pzr]

a hml pzr a
A pzr] ^
References
House, 1993.
[2] Zhang Wenpeng and Liu Duansen. primitive numbers of power and its
asymptotic property, Smaramche Notes Journal 2002, 13: 173-175.
[3] Pan Chengdong and Pan Chengbiao, The Elementary number Theory,
Beijing University, Press Beijing, 2003.
SOME ASYMPTOTIC PROPERTIES INVOLVING
THE SMARANDACHE CEIL FUNCTION
He Xiaolin and Guo Jinbao

Abstract For any fixed

¨ îòpositive
ñ ¨
integer , the Smarandache ceil function of order © is
denoted by and has the following definition:

IôóöõÞ÷
q §¨
q ùø
§¨ î !6
Ô ²
² Õ
In this paper, we study the mean value properties of a new arithmetical function
ú 7
8 concerning with the Smarandache ceil function, and give several
²
asymptotic formulae for it.
Keywords: Smarandache ceil function; Mean value; Asymptotic formulae.

9
1. Introduction
For any fixed positive integer : , the famous Smarandache ceil function of
order is defined as folloing:
; ¸ > ¸
:@?BA íìzr °a{à
J : J a ± >¬ :Þà v ?u^
; > ; > ; > ; >® ; >

For
; > « example, TU?A T ; , > j v!?AM
v ; , > j x!?AÈx , j ?A v , j !?AÈ ,
« ; >j
j ? A , j ?iAå , j +!? A , j ¬!? A x , ¯¯¯ . This function was first
introduced by Professor Smarandache (see reference [1]), and many scholars
showed great interest in it. For example, Ibstedt [2] and [3] studied this func-
tion both theoretically and computationally, and got the following conclusions:
>¬ v > ; ¸ > ; ¸ > ; ¸ >
LXE à ? XL E Ô
? AªTM® L ?BA L ?
= V? E
; ¸ > | | è |D³ ;> | ;> |D³
\ 3 j ¯¯¯ i ?#A \ 3 ?X¯¯¯ i ?V^
While
J Professor Tabirca established the asymptotic density of fixed point is
è , and found the average function of the Smarandache ceil function behaves

linearly.
In this paper, we shall use the analytic methods
>_; ¸ > to study the mean value
properties of a new arithmetical function ù | :@?`? , and give two asymptotic
formulae for it. That is, we shall prove the following:
½ > Ò |
Theorem 1. Let } Ý ,ù | @ : ?A H N . Then for any real number a.bwv ,
and any fixed positive integer bv , we have the asymptotic formula
« | Z@\ > }h > >
e ù | >_; ¸ > :@?`?BA a TU? }yh TU?]R } ? > }Qh | è
ä > }h ä á TU? hl n a Z 3 Zé t E
H0fg TU?kû2j
>
where â,? is the Riemann zeta-function, be any fixed positive number, and
ä
> }h T
á TU?ÔA < TR ¸ | ¸
ç Z@\) | R \) | Z@\) ^
>
Theorem 2. Let N :@? denotes the Dirichlet divisor function. Then for
any real number a£bÈT , and any fixed positive integer ³bòv , we have the
asymptotic formula
« >
e >õ; ¸ > ?)a pzr a ¸ h{T ¸ h P a h¥lYn a è3 Zé tE
N :@?`?ÔA ä < TR \
H0fg 2
û j ç
P
Taking Awv in Theorem 2, we may immediately deduce the following:
Corollary. For any real number aybv , we have the asymptotic formula:

e >õ; > pzr a T h P a h¥lon a è3 Zé t^
N j :@?`?BADa < TR {
h
H0fg ç j
9
In this section, we shall complete the proof of the Theorems. First we prove
Theorem 1. Let
> e ù | >_; ¸ > :@?`?
G â?#A É ^
H \ : ã
>_; ¸ >
From the Euler product formula [5] and the multiplicative property of ù | :@?`?
we have
¸
ù | >õ; ¸ > ?`? ù | : ; ¸ > j ? > ù | n ; ¸ > ?kt
> h h h ¯¯¯ h h ¯¯¯
G â,?ðA < T ¸
ç ã j(ã ã
ù | > ? ù | > ? ù | : j >
A ~ T h h ¯¯¯ h ¸ h ¸ h ¯¯¯
< Z@\) ã
ç ã ã
ù ù | : s >
h | :¸ j > h ¸ h ¯¯¯
j ã j Z@\) ã
< \ó h { | | h |
T[R
²<ó ~ T T h{ y j h
A < T h \
h ¸ ¯¯¯
ç T[R ã Z@\) ã

> T
A â,? < T h | T h ¸ T | h ¸
T
|
h ¸
T
|
h ¯¯¯ B
ä ç ã ã j ã s ã

> >
A â,? 4â¢R } ? < T R
¸ T | h T
|
ä ä ç ã ã
> > >
,â ? â¢R } ? 4â¹R } ? T
A ä ä > > ä T R
¸ ¸
v â×R } ?`? ç
< |
ã R )\ ã E
ä
>
where â? is the Riemann zeta-function. Obviously, we have inequality
ä
Á e ù | >_; ¸ > :@?`?
J ù | >); ¸ > :@?`? J :#E ÷ É ÷ Â ù
T
÷ : ø ÷ RT¢R ¸ \ E
| Z@
÷H \ ÷
÷ ÷
ù h | Z@ \ ÷ ÷
where ÝdT ¸ is the real part of â . So by Perron formula (see reference
[5]),
e ù | >õ; ¸ > :@?`?
H fg : ã)ú
Z Êÿþ > > h ù
A
T
G â h â ? a ã N â hml ~ a
?
ê
v,Fõûü ý ÿ
Ê þ ê â ý

> > pÏÐ a > > a
h l ý a \ ø ú v,a? íì7r TE ? hml a ø ú ? í'ìzr TE JJ JJ ? E
a
J ½
where is the nearest integer to a , ¾ a ¾ A J aºR . Taking â A , A } h s ,
| Z è3 > >ù ê j
ADa , a?BA³a , ?BA \ | , we have
ø \
e ù | _
> ; >
¸ :@?`?
H0fg
|
Z è Z Êÿþ > >
â? â×R } ? 4â¹R } ? > a ã
>
A
T
ä ä > > ä á ,
â ?
N â hml£n a | Z è3 Zé tE
v,Fõû ü |
Ê þ v â¢R } ?`? â
Z è
ä
where
> T
á â?#A < T[R ¸ | ¸
ç ã R \) ã ^

| Z
è Z Êÿþ > > } ? >4
T â ? ×
â R â×R } ? > a ã
| Ê þ ä ä > > ä } á â,? N â0E
v,Fõû ü
Z è v â¢R `? ? â
ä

we move the integral line from âA }'h s F to âºA }'h \ F . This time,
½ j j
when } Ý E the function
> > >
> â? âR } ? 4â×R } ? > a ã
â,?BA ä ä > > ä á â?
v â¹R } `? ? â
ä
has a simple pole point at âA } h T with residue

> }h > >} h
TU? y TU?]R } ? > }h |
ä > }ä h > á TU?)a Z@\ ^
TU? v!?
ä
So we have
| Z è Z Êÿþ | Z è3 Z Êÿþ | Z è3 Êÿþ | Z è Êÿþ
T ~ h h h
v,Fõû ü |
Z è Êÿþ ü | Z
è Z Êÿþ ü | Z è3 Z Êÿþ ü | Z è3 Ê þ
> > >
â? â×R } ? 4â×R } ?)a ã >
ä ä > > ä } á â?kN â
v â¹R ?`? â
> }h >ä >
TU? }yh TU?ÄR } ? > }h |
A ä > }ä h > á TU?)a Z@\ ^
TU? v!?
ä
Note that
| Z è3 Z Ê þ | Z è3 Êÿþ | Z è Êÿþ
T ~ h h
v,F)û ü | Z è Z Êÿþ ü | Z è3 Z Êÿþ ü | Z è3 Ê þ
> > >
â? â×R } ? 4â¢R } ?)a ã >
ä ä > > ä } á â?kN â
v â×R ?`? â
| ä
2 a Z è3 Zé
> è
J
and v!?ÔA ^
ä
From the above we can immediately get the asymptotic formula:
« | Z@\ > }h > >
e ù | >_; ¸ > :@?`?BA a TU? }yh TU?]R } ? > }Qh | è Z é
ä > }h ä á TU? hl n a Z 3 t ^
H0fg TU?kû2j

½
If } A , then the function
> >
> a ã j â? 4â? T
â?ÔA ä > ä < TR ¸ ¸
â vâ,? ç ã R )\ ã
ä
has a second order pole point at âºAªT with residue
pzìzí > â¹RTU? j > â,h?
ãî \
û pzìzí > > a ã
â×RTU? Vj ü â,? Ì
ãî \ Ë â
pzìzí » > â¢RTU? j?ü > â? Ö a ã h > â¹m > âUa ã zp r 'a Rca ã
A R TU? jVü â,? ^
ãî \ Ó â â j ý
Note that >

pzì7í > ¢
â RTU? j
>
â?BAåä >
?
TR ¸ h{T ¸
ü < \ ^
ãî \ ä
v!?ç
From the above we have

« >
e >_; ¸ > ?)a zp r a ¸ h{T ¸ a hmlon a è3
h P Z é
N :@?`?ÔA ä < TR \ t E
H0fg û j ç
P
References
House, 1993.
[2] Ibstedt. Surfing on the Ocean of Numbers-a few Smarandache Notions
and Similar TOPICS. USA New Mexico: Erhus University press, 1997.
[3] Ibstedt. Computational Aspects of Number Sequences. USA Lupton :
American Research Press, 1999.
[4] S. Tabirca and T. Tabirca. Smarandache Notions Journal, 2002, 13: 30-
36.
ASYMPTOTIC FORMULAE OF SMARANDACHE-
TYPE MULTIPLICATIVE FUNCTIONS
Yang Cundian and Li Chao

Abstract In this paper, Analytic method is used to study the mean value properties of

Smarandache-Type multiplicative function þ and ÿ , and give their
- -
asymptotic formula respectively.
Keywords: Smarandache-Type multiplicative function; Mean value; Asymptotic formula.

9
1. Introduction
According
>
to [1], the definition
of Smarandache-Type multiplicative func-
tion W :@? is the largest C power-free
> number dividing : . Another Smaran-
dache
type multiplicative function W :@? is defined as: : divided by largest
C power-free number dividing : . That| is,| for
è any|¸ positive> integer : , if> : has
the prime power decomposition :ëA \ 3 j ¯¯¯ ² , W :@? and W :@? are
presented in the following
> ª ª è ª > è
¸ ¸
W @ : ?BA \ 3 j ¯ ¯¯ ² E W :@?BA \ 3 j ¯¯¯ ² E
> >½
where Ê Ê A íìzr } Ê E`CRTU?VE > Ê A í&% ' E > } Ê R.C h TU?V^
It is obvious to show that W :@? and W :@? are multiplicative functions. In
this paper, we study the mean value properties of these two functions, and give
their asymptotic formulae respectively. That is, we shall prove the following
Theorem 1. Let C b³v is a given integer, then for any real number a{bYT ,
we have

e > a j T hml n a è Zé t ^
W :@?#A > < T h > W > ïh
H fg v {
C ? ç
R U
T ? U
T ?
ä
Theorem 2. Let C b³v is a given integer, then for any real number a{bYT ,
we have

e T a T hml£n a è3
Z é
> A > < T h > W > t E
H0fg W :@? C{? ç RTU? ïh TU?
ä
>
where â,? is the Riemann zeta-function.
ä
9
Now we prove the Theorem 1. Let
>
> e W :@?
G â?#A É E
H \ :Úã
>
Re ,â ?Ýë > T . From the Euler product formula [3] and the multiplicative property
of W :@? we have
> >
> ~ T h W ? h W j ? h
G â,? A < ¯¯¯
ç ã j(ã
j h W \ W \ W \
A ~ T h h
¯
¯ ¯ h h h h ¯¯¯
< W \) ã W ã WZ@\) ã
ç ã j(ã

T[R < A \ó)ô W \ T h T h
- 3B h T h
A < < )
ó \ ô W ¯¯¯
ç T¢R ã ã j(ã
3
T[R < A \ó)ô T T
A - 3B h
<
< )
ó \ ô < ó
ç T¢R W ã )
\
@
Z \ TR \
3
>
â¢RTU? ~ T h ã \ RmT
A >ä > < >
C â¢RTU?`?Bç : W ã \) R? T > ã#RTU?
ä
> ½
where â? isH the Riemann zeta-function. By Perron formula [2], with â A ,
ä ê
ADa , A , we have
j
e > T è Z Êÿþ >
âRTU? > a ã è
@
: B
? A
Å
> > á ,
â ?
N â hml ~ a Å
W
vûF#ü è Êÿþ
ä
C â¢RTU?`? â E
H0fg Å ä
where
> ã \ RT
á â?#A < ~ T h > ^
ç : W ã \) RT > ã RmTU?
T è Z Êÿþ >
âRTU? > a ã
Å
>ä > á â? N â0E
vûF#ü è ÿÊ þ C â×RTU?`? â
ä H Å

we move the integral line from { â A F to â{A s F . This time, the
j j
function >
> â×RTU? > a ã
G â,?#A >ä > á â?
C â×RmTU?`? â
ä è >
has a simple pole point at âAwv , and the residue is g W[ á v!? . So we have
j¨
T ~ è Z Êÿþ è Z
Êÿþ è
Êþ è Êÿþ >
âRTU? > a ã
Å h h h Å
> ä > á â,? N â
v,Fõû ü è ÿ
Ê þ ü è Z Ê þ ü è Z ÿ
Ê þ ü è ÿ
Ê þ C â¢RTU?`? â
Å Å ä
Asymptotic formulae of Smarandache-type multiplicative Functions 141

a j T
A > < T h > W > ^
v C{? ç RTU? ïh TU?
ä
Note that
T Z ÿÊ þ
è è
Êþ èÅ Êÿþ >
âRTU? > a ã
~ h h è Z é
>ä > á â,? N âR2Èa
v,Fõû ü è Z Êþ ü è Z ÿÊ þ ü è ÿÊ þ C â¢RTU?`? â
Å ä

e > a j T hml£n a è
W :@?#A > < T h > W > ïh
Z é¹
t ^
H fg v {
C Ô
? ç
R U
T ? U
T ?
ä
Now we give the proof of Theorem 2. Let
> e T
â,?ÔA É > E
H \ W :@?): ã
>
Re ,â ? > o
Ý T . From the Euler product formula [3] and the multiplicative property
of W @ : ? we have

> T T
â,? A < T h > h > h ¯¯¯

ç W ? ã W j? j(ã

T h T h T
A < T h ¯¯¯ h
W \) ã
ç ã j(ã
h T h T h ¯¯¯

¯ W ã j¯ WZ@\) ã
< \ ó
A ~ T¢R - h T
T h
T h
T h ¯¯¯
< < \ó W @
Z \ @
Z \ Z @ )
\
ç TR ã ã j ã
< \ ó
A ~ T¢R - h T T
< < \ ó W @
Z \ <ó \
ç TR ã TR
> 1=3
â? ã m
R T
A ä> < T h > W >
Cyâ?#ç ã RTU? ã Z@\ RTU?
ä
> ½
where â ? is the Riemann zeta-function. By Perron formula [2], with â A ,
ä ê
ADa , A s , we have
j
è Z
Êÿþ > è
e T T â? > a ã hl ~ a
> A > ä
â ? 5
N â E
H fg W :@? vûFÄü è Ê þ Cyâ0Rº? â
ä
where
> ã RT
â,?ÔA < T h > W > ^
ç ãBRTU? ã Z@\ RTU?

è Z
Êþ >
T âRTU? > a ã
>ä > â? N5â!E
vûFÄü è ÿÊ þ C â¢RTU?`? â
ä

we move the integral line from { â A s F to â{A \ F . This time, the
j j
function >
> â? > a ã
â,? A ä> â?
Cyâ? â
ä >
has a simple pole point at âAªT with residue g W[ TU? . So we have
¨
è Z
Êÿþ è3 Z Êÿþ è3 Êÿþ è
Êÿþ >
T ~ h h h â,? > a ã
ä > â,? N â
v,Fõû ü è Êÿþ ü è Z ÿÊ þ ü è3 Z ÿÊ þ ü è3 Êÿþ Cyâ,? â
ä
a T
A > < T h > W > ^
C{?#ç RTU? ïh UT ?
ä
Note that
Êÿþ >
â ?
> a ã
a è3 Zé E
~ h h
ä> â? N5âI2
v,F)û ü è Z Êÿþ ü è Z ÿÊ þ ü è Êþ Cyâ? â
Å ä Å
from above we may immediately get the asymptotic formula:

e T a T hml£n a è 3
> A > < T h > W > ïh
Z é
t ^
H0fg W @
: ? {
C ? ç
R U
T ? U
T ?
ä
References
Smarandache Notions, 2002, 13: 134-135.
¦
ON THE INTEGER PART OF THE -TH ROOT
OF A POSITIVE INTEGER í
Yang Mingshun and Li Hailong

Department of Mathematics, Weinan Teacther’s College, Weinan, Shaanxi, P.R.China
lihailong0914@163.com
!Q
Abstract For
any positive integer
!QI , let denotes the integer part of the © -th root of
Û
. That is,
! 3 ² . In this paper, we study the asymptotic properties
of the sequences Ô , and give two interesting asymptotic formulae.
Õ
Ú
Keywords: Integer part sequence; © -th root; Mean value; Asymptotic formulas.
9
1. Introduction
>
For any positive integer C ,¸ let L C{? denotes the integer part of the -th root
> > >
of C . That is, L C{?¢A C \ Ö . For example, let Adx then L TU?×AYL v!?¢A
> > Ó > > «
>
>
¯¯¯ A L ?
,> >
AÈT , L > +!?A L ¬!?ïAÈ > «
¯¯¯ A L v ?A + , TU?A v!?A ¯¯¯ A
A + , +!?QA
?Qz ¬!?QAÑ¯¯¯@A v ? A¿v@ , ¯¯¯ . In problem 80 of reference
[1], Professor> F.Smarandach asked us to study the asymptotic properties of the
sequence °UL C{?¤± . About this problem, it seems that none had studied it, at
least we have not seen related paper before. In this paper, we shall use the
elementary method to study the asymptotic properties of this sequence, and >
give two > interesting asymptotic > formulas. For convenience,> we define :@?
and | µ | è :@? as| ³ following: :@?yA } \ hY} j h ^^^ hY} i , µ :@?yA , if ´ :¿A
\ 3 j ¯¯¯ i be the factorization ´ of : into prime powers. Then we have the
following:
Theorem. For any real number ayÝ£T , we have the asymptotic formula

e > > pzrp7r a h 8
> µ a
µ L :@?`?ÔADa R pzr ?=a hml pzr a E
H fg

e > > > a
L :@?`?BADa p7rpzr a h R p7r ? a hml pzr a E
H fg ´
î
where

µ h e pzr T h T µ h e T
A| < T[R E A < >
RTU?
are two constants.

Taking Awx on the above, we can immediately obtain the following
Corollary. For any real number ayÝoT , we have the asymptotic formula

e > > z
p
r z
p r h >¶µ z
p r m
h l a
µ L :@?`?BADa a R x!?5a p7r a E
H0fg

e > > > a
L :@?`?BADa pzrpzr a h R pzr x!?5a hml p7r a ^
H0fg ´
9
In this section, we shall complete the proof of the Theorem. First we come
to prove the first part of the Theorem. For any real number a.b·T , let À be a
fixed positive integer such that
¸ Á > ¸
À aÂ À h TU? ^
>
Then from the definition of L :@? we have
e > > e e > > e > >

µ L :@?`? A Ã µ L :@?`? h µ L :@?`?
H fg W \
W )\ ² fH W ² ² fH0fg
e \ e Ãe
> >
A Ã µ Àd? C{? h µ
W \
W ² fH( W Z@\) ² f² H fg
e \ ¸ ¸ Ã
A Ã n P ¸ \ C \ h P ¸ j C j h ¯ ¯¯ h Tt¾µ > {
C ?
W \
h l e >
Àd?) µ

fH0f Z@\) ²
Ã ¸ Ã
e \ > > ¸ \ p7r
A Ã C µ { C ? hml À Àª?VE
W \
> pzr : .
where we have used the estimate µ :@?{2
Note that (see reference [2])

e > µ a
µ :@?#ADa pzrp7r a h a h¥l pzr a E
H fg
On the integer part of the -th root of a positive integer1 145
µ > e >
where is a constant. Let ?#A µ C{? , by Abel’s identity (see Theorem
W f
4.2 of [3]) we have
e ¸ > ¸ > >
Ã C \ C{?BA³À \ Àd?@R ?kN
µ Ã
W \ ü j
¸ ¸ µº ¸ \
A À \ >À p7rpzr À h µ
Àd?]R n \pzrpzr h t N

Ã
¸ ü j
h l ~ À
pzr À
¸
¸ µ ¸ RT n ¸ µ ¸
A À pzrpzr À h À R À pzrp7r À h À t hml ~ À
pzr À
¸
T ¸ T µ ¸
A À pzrpzr À h À hml ~ À
p7r À ^
Therefore, we can obtain the asymptotic formula

¸
e > > ¸ µ ¸
L :@?`?ÔA³À pzrpzr À h À hml~ À
µ zp r À E
H fg
µ
where is a constant.
On the other hand, note that the estimates
¸ ¸ ¸ ¸ ¸ ô
½ Á > P ¸\ \Úh P j h
a R À Â À h TU? RæÀ A À ¸j À ¯ ¯¯ h Tº2 a ² ² 3
and
Á Á ¸
pzr h pzr[pzr À pzrp7r ayÂ pzr h pzr[pzr > À h TU? p7r h pzr[pzr À hlën a \ t ^
Now combining the above, we may immediately obtain the asymptotic for-
mula
e > > pzrp7r a h 8
> µ a
µ L :@?`?ÔADa R pzr ?=a hml pzr a ^
H fg
This proves the first part of the Theorem.
Similarly, we can prove the second part of the Theorem. This completes the
proof of the Theorem.
References
House, 1993.
[2] G.H.Hardy and S.Ramanujan. The normal number of prime factors of a
number : , Quart. J. Math. 1917, 48: 76-92.
ON THE ADDITIVE CUBIC COMPLEMENTS
Liang Fangchi
fc-liang@163.com
Yi Yuan
yiyuan74@163.com

Abstract For any positive integer , let Ü denotes the additive cubic complements of

[£

. That is, Ü denotes the smallest non-negative integer such that Ü
is
a
perfect cubic number. In this paper, we study the mean value properties of Ü

and the function « , here « denotes the numbers of all prime divisors of

À£
8
, and give a sharper asymptotic formula for the mean value of « Ü .
Keywords: Additive cubic complements; Function of prime divisors; Asymptotic formula.

9
>
For any positive integer : , the cubic complements s :@? is defined as > the
smallest integer such that Ú
: is a perfect cubic number. For example, TU?B
A
> > >® > > « « > s
T , v!?iA , s x!?iA ¬ , s ?AÑv , s !?AÑv , s ?iAÑx , s ? A ¬ ,
> s
s +!?[AT , ¯¯¯ . In problem >
28 of [1], Professor F. Smaradache ask us to study
the properties of ° s :@?¤± . About this problem, there have some authors to
study and proved some interesting Ò results. ForÒ example, Wang Y. [2] stud-
ied the asymptotic properties of \ and H , and obtained several
H H
H fg H0fg
asymptotic formulae. ý ý
Similarly, we will define the additive cubic complements as follows: for
any positive integer : , the smallest non-negtive integer is called the additive
cubic complements of : if : h is a perfect cubic number. Let
> ½ Z
:@?#A íìzr ° J : h 'ADC s E¤b E`C à ±!E
,> ½ > « > >® > > « >
then
,>
TU?ºA , v!?×A , x!?×A· , ?ºA , !?×Ax , ?ºA·v , ?×AST ,
½ >
+!?A , ¬!?[A·?T + , ¯¯¯ . About this sequence, it seems that none had studied
it before, at least we have not seen any results at present.
In this paper, we will use the analytic methods e to study the asymptotic prop-
> h >
erty of this sequence in the following form: : :@?`?VE where awbv
H fgÚ´
>
be> a real number, :@? denotes the| numbers
| è of| ³
all prime divisors of : , i.e.,
:@?#A } \ h} j h ´ ¯¯¯ hy} i if :{A 3
\ j
¯
¯ ¯ i be the factorization of : into
´prime powers, and give a sharper asymptotic formula for it. That is, we shall
prove the following:
Theorem. For any real number aybDv , we have the asymptotic formula
e > > >¶µ > a
: h :@?`?BAwx,a pzr¢pzr a h x R pzr x!?)a hml pzr ?VE
H fg ´ a
µ Ò nqpzr > TR <\ Ò <\ Ò

where A- h < < < < \ \) , <
? h t h denotes the summation
over all primes, and be the Euler constant.
9
following:
Lemma. For any real number a{ÝoT , we have

e > z
p
r z
p r h µ m
h l a
:@?#ADa a a pzr a E
H fg ´
µ Ò nVpzr > TR <\ <\ Ò
where A| h < ? h t h < < < \ \) , be the Euler constant.
Proof. (See reference [3]).
Now we use above Lemma to complete the proof of Theorem. For any real
number abv , let À be a fixed positive such that
Á >
À s aÂ À h TU? s ^ (1)
For any prime and positive intger } , note that > | ?×A } . Then from the
>
definition of :@? , we have ´
e > >
: h :@?`? (2)
H fgÚ´
e e > > e > >
A : h :@?`?) h : h :@?`?
\f f \
f H Z@\) ´ fH fg ´
Ã Ã è
e e > > hml > a Zé ?
A : h :@?`?)
\f f
f H( Z@\) ´
Ã è
e e >`>®Å h hml > a Zé ?
A TU? s ?
\f f
f H( Z \) ´
@
e Ã > Å h Å h >`>®Å h > è Z é
A x j x TU? TU? s ? hl a ?
\f f ´
Ã
On the additive cubic complements 149
e > Å h Å h >®Å h > è
A ¬ j x x!? TU? hl a Zé ?
\f f ´
Ãe >®Å h >®Å h > è
A ¬¯ TU? j TU? hml a Zé ?
\f f ´
e Ã Å >®Å è
A ¬ ¯
j h l >a
? m Z é V? E (3)

\f f ´
Ã >
where we
µi> have used
Ò > estimate :@3
the ? 2È: é .
Let a?A :@? , then by´ Able’s identity (see reference [4], Theorem
H fg ´
4.2) and Lemma, we can easily deduce that
e Å >®Å µi> µi>®Å >®Å >®Å >
j ?ðA À j Àª?]R Ã ?@¯ j ? N ? hml TU?
\f f ´
ü \

Ã pzrpzr À h µ hl À
A À j À À pzr À B
Å
Å pzrpzr Å h µ¹Å hl Å Å
R
ü \
Ã pzr Å B ¯Uv N
µ s
A À s pzrpzr À h À s hl~ À
pzr À
R n v Å j pzrpzr Å h v
µ×Å
j tN
Å
Ã
ü \
T T µ s
A À s2pzrp7r À h À sÔhml ~ À (4)
x x p7r À ^
Note that
½ Á > > x h T è
aBR À s Â À h TU? s R À s AwxÀ j h xÀ h TºADÀ j x h ?{2Èa E
À À j
Y
(5)
and
pzrpzr aA pzrpzr À h pzr x hl > TU?V^ (6)
From (3), (4) and (5), we have
e Å >®Å T T >¶µ > a
j ?BA a pzrpzr a h R pzr x!?)a hml p7r ?V^ (7)
\f f ´ x x a
Ã
Combining (2) and (6), we may immediately get
e > > >¶µ > a
: h :@?`?BAwx,a pzrpzr a h x R pzr x!?)a hl pzr ?V^
H fg ´ a

References
House, 1993.
[2] Wang Y. On the mean value for reciprocal cubic complements,mathematics
in Practice and Theory 2004,34: 137-141.
[3] Hardy G.H. and Ramanujan S. The normal number of primefactors of a
number : , Quarterly Journal Mathematics 1917, 48: 76-92.
AN ARITHMETICAL FUNCTION AND ITS HYBRID
MEAN VALUE
Li Chao and Li Junzhuang


Abstract For any positive integer , let © è be the smallest integer such that © è
is the double factorial number. The main purpose of this paper is to study the

hybrid mean value of © è and the Mangoldt function, and give a sharp asymp-
totic formula.
Keywords: Double factorial; hybrid Mean; Asymptotic formula.

9
1. Introduction
> >
For any positive integer : , let j :@? be the smallest
> integer> such that >
Ú
: j :@?
is the
>®
double factorial
>
number. >«
For example,
>
j U
T Ô
? d
A T , j !
v Ô
? ª
A T , j !
x Ô
? ª
A
> T ,
j ?A v ,> j !?A x , j ?yA + , j ?{A T , ¯¯¯ . It seems > that j :@?
relates to :@? , which denotes the smallest integer such that :Ú :@? is a> facto-
rial number [1]. In this paper, we study the hybrid mean value of j :@? and
the Mangoldt function, and give a sharp formula. That is, we shall prove the
following:
Theorem. If a{bv5E then we have the asymptotic formula
e > > > T >

:@? pÏÐ j :@?`?BA a j pÏÐ a hml a j V? ^

H fg v
9
2. A Lemma
To complete the proof of the theorem, we need the following:
Lemma. Let aybv , then we have
pÏÐ >
a _K5ADa pÏÐ a Rca hml pÏÐ a2?VE

where denotes the largest integer not exceeding .
Proof. This is Theorem 3.15 of [2].
9
In > this section, we complete the proof of the theorem. From the definition
of j :@? we have
> | > | > | |
j ?BA R v!?VKKIÂ RUT ?VKÂ K
So from the Lemma, we obtain

e
> >
:@? pzÏÐ j :@?
H fg
e pzÏÐ2¹pÏÐ > | R v!?VKK
A <
fg
e e | pÏÐÚ¹pÏÐ2 |

A ºpÏÐ j ihml
< < ^
fg fg
fj |
Let
> TE if : is a prime,
L @ : ?#A» ½
E otherwise.
then
e > > a hml a
L :@?#A³û a2?BA pÏÐ a pÏÐ j a ^
H fg
By Abel’s identity we have
e ¹pÏÐ j e >
< A L :@?): pÏÐ j :
fg H0fg
> g >®Å Å Å Å
A û a?]¯a pÏÐ j a R û ? nqpÏÐ j h v pÏÐ tN
ü j
> g ¶> Å
A a j pÏÐ a hml a j ?@R zp ÏÐ Å hl ®> Å `? ?=N Å
ü j
We can easily get
g Å
pÏÐ Å N Å A T >
a j pÏÐ a hml a j ?VE
ü j v
Therefore
e ºpÏÐ j T >
< A a j pÏÐ a hml a j ?V^
fg v
Similarly we can get

e } pÏÐ j
< 2 a j ^
fg
An arithmetical function and its hybrid mean value 153
But
e }I | pÏÐ j
<
fg
Á e e
a } pzÏÐ j
| <
j f
! /0S
è fg 3
e ! /0
} a è3 pÏÐ
2 a a 3
|
j f ! /0Sè
! /0
è
2 a pÏÐ a
So we have
e > > T >
:@? pÏÐ j :@?#A a j pzÏÐ a hl a j ?V^

H0fg v
This completes the proof of theorem.
References
House, 1993.
¦
ON THE -TH POWER FREE SIEVE SEQUENCE
Guo Jinbao and Zhao Xiqing

Abstract In this paper, we use the elementary method to study the arithmetical properties
of the © -th power free sieve sequence, and give some interesting identities.
Keywords: © -th power free sieve sequence; Infinite series; Divisor function
9
1. Introduction
For any positive integer bv , one can obtains the -th power free sieve se-
½
quence as follows:
¸ from the set of natural numbers
¸ (except and T ), take off all
multiples of v , afterwards all multiples of x , ¯¯¯ , and so on (take off all multi-
ples of all -th power primes). In problem x=T of [1], Professor F.Smarandache
let us to study this sequence. Let ¸ denotes the set of all numbers in the -th
power free sieve sequence. In this paper, we study the convergent property of
some infinite series invovling this sequence, and give some interesting identi-
ties. That is, we shall prove the following conclusions:
Theorem 1. Let bDv be any positive integer. For any real number } Ý£T ,
we have the identity:
>}
e T ?
É | A ä> } E
H \ : ä
?
H( ·
>
where â,? denotes the Riemann-zeta function.
ä
From this Theorem we may immediately deduce the following:

Corollary. Let be the set of all numbers in the square free sieve sequence,
be the set of all numbers in the cubic free sieve sequence. Then we have the
identities:
e T T e T x T
=
É A L :ON É A
H \ O
: j û2j H \ O: j vû <
H H(
Theorem 2. Let b v be any positive integer. For any real number } ÝoT ,
we have the identity:
> > > |
e N :@? j } ? RTU?
É | A ä > } < TR ¸ | | ^
@
Z )
\
H \ : ä
Ô ? ç R
H·
9
In this section, we will complete the proof of the theorems. First, we prove
½
Theorem 1. For any real number } Ý , it is clear that
e T e T
É | Â É | E
H \ : H \ :
H·
e T }
and É | is convergent if Ý T . So from the Euler product formula (See
H \ :
Theorem 11.6 of [2]) and the definition of the -th power free sieve sequence,
we have

e T T h T h T
É | A < T h | | ¯¯¯ h ¸
\) |
H \ : ç j
H·
TR < \
A < < ²
ç T¢R \
>}
?
A ä> } ^
?
ä
Now we prove Theorem 2. Similarly, from the Euler product formula and
the definition of the -th power free sieve sequence, we have
>
e N :@? v h x h
É | A < T h | | ¯¯¯ h ¸
\) |
H \ : ç j
H ·
(

~ T T h T h T ¸
A <
< \ T h | | ¯¯¯ h ¸
)
\ | R |
ç T[R j
>} TR < \ ¸

A ? < < ² R |
ä ç TR \
> > |
j } ? RTU?
A ä > } < TR ¸ | | ^
?Bç @
Z )
\ R
ä
This completes the proof of the theorems.
On the -th power free sieve sequence 157
References
Chicago, 1993.
Verlag, New York, 1976.
ON A NEW SMARANDACHE SEQUENCE í
Zhao Xiaopeng and Yang Mingshun

Department of Mathematics, Weinan Teacther’s College, Weinan, Shaanxi, P.R.China
Abstract In this paper, we study the mean value of a new Smarandache sequence and give
an asymptotic formula.
Keywords: Simple numbers; Smarandache sequence ; Asymptotic formula.

9
1. Introduction
According to [1], a number : is called simple number if the product of
its proper divisors is less than or equal to : . For example: 2, 3, 4,µ 5, 6, 7,
8, 9, 10, 11, 13, 14, 15, 17, 19, 21, ¯¯¯ are simple numbers. Let denote
the set of all the simple numbers. Generally speaking, : has the form: :³A
E or j E or s > E or 5E where and are distinct primes. In [2], Jason Earls
>
defined â V G :@? as a new Smarandache sequence as following: Let â V G :@?
denote the sum of primes dividing : (with repetition). That is,
> e
â V G
:@?]A < ^
H
For example:
« ½ «
: > T v½ x + ¬ T TTYTv Tx T T/T TV T?+ T¬
« «
â V G :@? v x ´ TT Tx ¬ + + TV +/T¬
>
In this paper, we study the mean value properties of â V G :@? , and give an
interesting asymptotic formula. That is, we shall prove the following:
Theorem. For any real number ayb£T , we have
e > µ a j h µ a j h¥l ~ a j
â V G
:@?]A \ pzr j 7p r j a pzr s a E
H() a
H fg
µ µ
where \, j are computable constants.
î
9
2. Some lemmas
To complete the proof of the theorem, we need the following lemmas:
½
Lemma 1. Let b and aybx , denotes a prime. Then:
¸ ¸ ¸
e ¸ T a Z@\ h T a Z@\ hml~ a Z@\
A > h pzr s a ^
<
fg h T pzr a TU?kj pzr j a
> g h g è hmlon g t , then by Abel’s identity

Proof. Noting that û a?BA ¡ 4g ¡ g ¡ g
we have
e ¸ > ¸ g >®Å Å¸ \ Å
< A³û a?)a R û ? N (1)
fg ü \
¸ ¸ ¸
a Z@\ h a Z@\
hml ~ a
Z@\
A pzr a pzr j a pzr s a
g Å¸ g Å
¸
g Å
¸
Å Å h l ~ Å
R¹
ü p7r Å N Ræ
ü pzr j Å N ü j z
p r s Å N
¸ j ¸ j ¸
a @
Z \ a Z@\ @
Z \
A h hml ~ a
pzr a pzr j a pzr s a
¸ ¸ ¸
a Z@\ j h v a Z@\ g Å Å
R R > h¥l ~
Å N
h T p7r a h TU? j pzr j
a ü z
p r s
¸ ¸ ¸ j
T a Z@\ h T a @
Z \
hml ~ a
Z@\
A > p7r s a ^ (2)
h T pzr a h TU?kj pzr j a

Lemma 2. Let and are primes, Then:
e P a j h P a j hml ~ a j
< A \ pzr 7
p r
j j a pzr s a E (3)
fg a
P P
Proof. Noting that when a Â·T , we have \ \ g A¿T h a h a j h a s h ¯¯¯ h
a W h ¯¯¯ , then
e e
< < T
f N g
O fgU
e <g <g <g
A Þ~ > pzr h > p7r ¥
h
l ~ > zp r (4)
< a R pzr@ ? a'R pzr] ?kj a R zp r] ? s ×
f N g
O
a e pzr] pzr j pzr W

A ~ T h h h ¯¯¯ h h ¯¯¯
pzr a < pzr a p7r j a p7r W a
f N g
O
On a new Smarandache sequence1 161
a e pzrÄ 7p r W \
h ~ T h v p7r h ¯¯¯ h C h ¯¯¯
pzr j a < a pzr5W \ a
f N g
h l e a a è h a è hml ~ a è
p7r s <g A \ pzr E (5)
< j a j pzr s a p7r <
a
f N g
And then,
e e
T <
f N g fgU
> g > g > g
e ~ ? j h ? j h¥l ~ > ? j
A > I> pzr (6)
v zp r a R pzr !
? a'R pzr !
?kj
pzr a R zp r ! ? s ¢
f N
O g
a j e T ~ h zp r 7p r j 7p r=W
A T h h ¯¯¯ h h ¯¯¯
v p7r a , j pzr a pzr j a pzr W a
f N g
a j e T p7r zp r5W \
h ~ T h v pzr h ¯¯¯ h C h ¯¯¯
7p r pzr5W \ a
j a j a
f N g
h l e a j
pzr s g
f N g j
a j e pzr
A
T h a j ~ T e h
T e T hml ~ a j
v p7r a j
pzr j a v j j
pzr s a ^ (7)

So from (5) and (7) we get,

e e e h e e > e > e
< A < < T T < R < ? TU?
fg f N g fgU
O f N
O g fgU fON g f N
O g
P a j h P a j hml ~ a j
A \ pzr j zp r j a p7r s a E (8)
a
P P
where \, j are computable constants. This proves Lemma 2.
9
Now we prove the Theorem. From Lemma 1 and Lemma 2 we may imme-
diately get
e >
â ¤ G :@?
H
H fg
e > e > e > e >
A < â V G ? h < â ¤ G j ? h < â V G s ? h < â V G !?
fg è
fg fg < fg

e ih e ih e ïh e
A < v < x < v <
fg è
fg fg < f g

e ih e ih e
A < x < v <
fg fg fg
a j > P h T a j > P T ~ a j
A p7r a \ ? h pzr j a j
h ? hl pzr s a
v
µ a j h µ a j hml ~ a j
A \ pzr j 7p r j a pzr s a ^
a
References
House, 1993.
[2] Jason Earls. A note on the Smarandache divisors of divisors sequence
and two similar sequences. Smarandache Notions Journal, 2004, 14: 274-275.
ON SOME ASYMPTOTIC FORMULAE INVOLVING
SMARANDACHE MULTIPLICATIVE FUNCTIONS
Li Junzhuang and Liu Duansen

Abstract In this paper, we shall use the analytic method to study the mean value properties

of Smarandache-Type multiplicative function and , and give two
- -
asymptotic formulae for them.
Keywords: Smarandache-Type multiplicative function; Mean value; Asymptotic formula.

9
1. Introduction
In> reference [1], the definition
of Smarandache-Type multiplicative function

W :@? is the smallest C power divisible by : divided by largest C power >
which divides : . Another Smarandache-Type multiplicative function W :@?
is defined

as C root of smallest C power divisible by : divided by largest
C power which divides| | è : . That| is, Á anyÁ fixed positive integer : with the
for
normal factorization \ 3 ¸
¯¯¯ ² , ( T F ) we have
j
> | Õ rì ì} Ê

Ê ?BA» TE ADCyu¼
W WÊ E Ï ×ì ^
and ìrì} Ê ADCyu¼

> | Õ TE
W Ê ?#A» ÊE Ï×ì ^
> >
It is clear that W :@? and W :@? are multiplicative functions. In this paper,
we study the mean value properties of these two functions, and give some
asymptotic formulae for them. That is, we shall prove the following:
Theorem 1. For any real number a%b¿T and integer C bªv , we have the
asymptotic formula
« > > >
e > C j h C{? C h TU?ká C h TU?)a WZ@\ hmlon WZ è3 Zé
W :@?#A ä ä a t^
H fg û2j
>
where â,? is the Riemann zeta-function, be any fixed positive integer, and
ä
> h T T
á C TU?BA < T[R R è h{ è
ç
W @
Z \
h W W W \ ^
Theorem 2. For any real number a{boT and integer Còbv , we have
e > > > è
v,C{?ká v!?)a j hl n a Zé t E

W :@?BA
H fg ä
where
> T T
á v!?BA < TR R Wj \ h{ j W j ^
ç j h{
9
Now we prove the Theorem 1. Let
>
> e W :@?
G â?#A É E
H \ :Úã
>
Re ,â ?> ÝëT . From the Euler product formula [3] and the multiplicative property
of W :@? we have
> > > s
> ~ h W ? h W j ? h W ? h
G â?ðA < T s ¯¯¯
ç ã j(ã ã

W W W T
A T h h h ¯¯¯ h h
< W \) ã W ã
ç ã j(ã
W W W T
h h h ¯¯¯ h h h ¯¯¯
[
W @
Z )
\ ã
W Z j ã j W \) ã j W ã

T T T
A < W ã ç< T h h ¯¯¯ h
)\ W
ç T[R ã W ã W

> T T T
A Cyâ,? < T h{ W h h ¯¯¯ h
W )\ ã B
ä ç ã j(ã

> > T T T
A Cyâ,? â,? < T h R R
ä ä ç ã W ã W ã \)
>
> > â RcC{?
¢ T T
A Cyâ,? â,? ä> T[R R
ä ä vâ¢Ræv,C{?#ç
<
ã {
h W W ã \) { h W ã ã E
ä
> ½
where â? is the Riemann zeta-function. By Perron formula [2], with â A ,
[
W ä Z è3 h s ê
ADa , ³A C , we have
j
e > T W[Z è Z Êÿþ > >
>
â¢RcC{? > a ã
N5â h l n a W[Z è3 Zé t E

W :@?#A Ê þ Cyâ? â? ä > á â?
H0fg
v
û F ü
W Z è ä ä
v ¢
â æ
R ,
v {
C ? â
ä
where
> T T
á â?#A T[R R
ç
<
ã {
h W W ã \) { h W ã ã ^
T W Z
è Z Ê þ >
>
>
âRcC{? > a ã
ÿ
Ê þ Cyâ,? â,? ä> á â,? N â0E
vûF ü WZ è ä ä vâRæv,C{? â
ä
we move the integral line from âºA³C s F to âºA³C h \ h
F

. This time,
j j
the function >
> > > â×RcC{? a ã >
G â?#A Cyâ? â? ä > á â?
ä ä vâ×Ræv,C{? â
ä
has a simple pole point at âADC h T with residue
> > T >
C j h C{? C h TU? > a W[Z@\ á C h TU?V^
ä ä v!?
ä
So we have
T WZ è Z ÿÊ þ WZ è3 Z Êÿþ WZ è3 Ê þ W Z è Ê þ

[
~ h h h
v,Fõû ü W[Z
è Êÿþ ü W[Z
è Z Êÿþ ü WZ è3 Z Êÿþ ü WZ è3 ÿÊ þ
>
> > â¢RcC{? a ã >
Cyâ? â? ä > á â,?kN5â
ä ä vâ¢Ræv,C{? â
ä
> > T WZ@\ á > C
A C j h C{? C h TU? > a h TU?V^
ä ä v!?
ä
Note that
T W[Z è3 Z ÿÊ þ W[Z è3 Êÿþ WZ è Êÿþ

~ h h
v,Fõû ü WZ
è Z Êÿþ ü WZ è3 Z Ê þ ü W[Z è3 Ê þ
>
> > â¢R C{? a ã >
Cyâ? â? ä > á â ?kN â
ä ä vâR%v,C{? â
ä
2Èa
WZ è3 Zé
> è
J
and v!?ÔA ^
ä
« > > >
e > C j h C{? C h TU?)a WZ@\ á C h TU? hml n WZ è3
Z ét ^
W :@?#A ä ä a
H fg û2j

Next, we will give the proof of Theorem 2. Let
>
> e W :@?
â?BA É E
H \ :Úã
>
Re â,?>ÝëT . From the Euler product formula [3] and the multiplicative property
of W :@? we have
> > > s
> ~ h W ? h W j ? h W ? h
â? A < T ¯¯¯
ç ã j(ã s ã
> T
A < T h h h ¯¯¯ h
W \) ã
h
W ã
ç ã j(ã
h h h T
¯¯¯ h h
W[Z@\) ã W[Z j ã j W )\ ã jW ã
h ¯¯¯ÿ?
T T T
A < W ã ç< T h h ¯¯¯ h
ç TR ã \ ã W )\ \

> T T T
A Cyâ? < T h{ h h ¯¯¯ h
W )\ ã B
ä ç ã j(ã

> > T T T
A Cyâ? â? < T h R R W ã \
ä ä ç ã \ ã
>
> > â×RTU? T T
A Cyâ? â? ä > < T[R R W ã \ h{ W ã ã E
ä ä vâ×R v!?Bç ã h{
ä
> ½
where â? is the H Riemann zeta-function. By Perron formula [2], with â A ,
ä ê
ADa è , A

, we have
j
e > T è Z Êÿþ > >
>
âRTU? > a ã
N â hmlon a è Zé tE
Å
W :@?#A ÿ
Ê þ Cyâ,? â,? ä > á â?
H0fg
v
û F ü è ä ä
v
â æ
R !
v ? â
Å ä
where
> T T
á â?#A < T¢R R W ã \ h{ W ã ã ^
ç ã h
T è Z Êÿþ > >

>
â×RTU? > a ã
Å
Ê ÿ þ Cyâ? â? ä > á â,? N â!E
5
vûF ü è ä ä v â×Ræv!?
â
Å ä
H

we move the integral line from â{A F to â{A s F . This time, the
j j
function >
> > > â×RmTU? a ã >
â?BA Cyâ,? â,? ä > á â?
ä ä vâRæv!? â
ä
has a simple pole point at âAwv with residue
> >
v,C{?)a j á v!?V^
ä
So we have
T è Z ÿÊ þ W Z
è Z Êÿþ
WZ
è Êÿþ è Êÿþ
~ Å h h h Å
v,Fõû ü è Êÿþ ü è Z ÿÊ þ ü WZ
è Z Êÿþ ü WZ
è Êÿþ
Å Å>
> > â×RmTU? a ã >
Cyâ,? â,? ä > á â ?kN â
ä ä vâRæv!? â
> > ä
A v,C{?)a j á v!?V^
ä
Note that
T WZ è Z Ê þ WZ è Êþ è ÿÊ þ
~ h h Å
v,Fõû ü è Z Êþ ü WZ è Z Êÿþ W Z è ÿÊ þ
ü
Å >
> > â×RTU? a ã >
Cyâ,? â,?×ä > á â?kN â
ä ä vâRæv!? â
ä
è Zé
2Èa ^
So we may immediately get the asymptotic formula:

e > > > è Z é
v,C{?)a j á v!? hlon a

W :@?#A t ^
º
H fg ä
This proves the Theorem 2.
References
The book contains 41 research papers involving the Smarandache sequences,
functions, or problems and conjectures on them.
All these papers are original. Some of them treat the mean value or hybrid mean value
of Smarandache type functions, like the famous Smarandache function, Smarandache
ceil function, or Smarandache primitive function. Others treat the mean value of some
famous number theoretic functions acting on the Smarandache sequences, like k-th
root sequence, k-th complement sequence, or factorial part sequence, etc. There are
papers that study the convergent property of some infinite series involving the
Smarandache type sequences. Some of these sequences have been first investigated
too. In addition, new sequences as additive complement sequences are first studied in
several papers of this book.
(The Editor)
List of the Contributors
Zhang Wenpeng Yi Yuan Liu Huaning

Xu Zhefeng Wang Xiaoying Zhang Tianping
Zhang Xiaobeng Lv Chuan Ding Liping
Zhu Minhui Yao Weili Li Jie
Gao Nan Gou Su Lou Yuanbing
Guo Jinbao He Xiaolin Zhao Xiqing
He Yanfeng Li Hailong Zhao Xiaopeng
Yang Mingshun Liu Duansen Yang Cundian
Li Chao Li Junzhuang Liang Fangchi
Gao Jing

Research On Smarandache Problems in Number Theory, Edited by Zhang Wenpeng

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Research On Smarandache Problems in Number Theory, Edited by Zhang Wenpeng

Uploaded by

Copyright:

Available Formats

RESEARCH ON

Many books one can download from the Digital Library:

Standard Address Number: 297-5092

An arithmetic function and the primitive number of power 1

On the primitive numbers of power and -power roots 5

Mean value on the pseudo-Smarandache squarefree function 9

On the additive -th power complements 13

On the Smarandache pseudo-multiples of sequence 17

An arithmetic function and the divisor product sequences 21

The Smarandache irrational root sieve sequences 27

A number theoretic function and its mean value 33

On the primitive numbers of power and its triangle inequality 37

The additive analogue of Smarandache simple function 39

On the -power complement sequence 43

On the inferior and superior factorial part sequences 47

A number theoretic function and its mean value 49

On the generalized constructive set 53

On the inferior and superior prime part 57

Identities on the -power complements 61

On the asymptotic property of divisor function for additive complements 65

Mean value on two Smarandache-type multiplicative functions 69

On the Smarandache ceil function and the number of prime factors 73

On the mean value of an arithmetical function 77

Two asymptotic formulae on the divisor product sequences 81

On the Smarandache pseudo-even number Sequence 85

On the mean value of an arithmetical function 89

An arithmetical function and its cubic complements 93

On the symmetric sequence and its some properties 97

The additive analogue of Smarandache function 99

An asymptotic formula on Smarandache ceil function 103

A hybrid number theoretic function and its mean value 107

On the Smarandache pseudo-number 111

Several asymptotic formulae on a new arithmetical function 115

The primitive numbers of power and its asymptotic property 129

Some Asymptotic properties involving the Smarandache ceil function 133

Asymptotic formulae of Smarandache-type multiplicative Functions 139

On the integer part of the -th root of a positive integer 143

On the additive cubic complements 147

An arithmetical function and its hybrid mean value 151

On the -th power free sieve sequence 155

On a new Smarandache sequence 159

On some asymptotic formulae involving Smarandache multiplicative functions 163

American-Romanian number theorist Florentin Smarandache introduced hundreds of interest

August 10, 2004

Abstract For any fixed prime , we define

Keywords: Primitive number; Mean value; Asymptotic formula.

In problem 49 and 68 of reference [1], Professor F.Smarandache asked us to

Taking Awv , x in the theorem, we may immediately obtain the following

Proof. First we come to calculate

This completes the proof of the Lemma.

Keywords: Primitive numbers of power ; © -power roots; Asymptotic formula.

where a be a positive real number, and give an interesting asymptotic formula

where lº¸ denotes the l -constant depending only on parameter .

J ;=<> : h ;4<=> E if H J J C.K ¼

J ;=<4> : h ;=<> E if H¾ C.K ¼

This completes the proof of Lemma.

From (4), we can deduce that

Then from this and (3), we have

This completes the proof of Theorem.

is defined as the least positive integer such that  is divisible by . In this

Keywords: Pseudo-Smarandache squarefree function; Mean value; Asymptotic formula.

where \ , j , ¯¯¯ , X¸ are distinct prime divisors of : . Also he showed that

J ;=<> : h ;4<=> E if H JJ C.K¼

J ;=<4> : h ;=<> E if H¾ C.K¼

is defined as the least positive integer such that is divisible by . In this

where \ , j , ¯¯¯ , X¸ are distinct prime divisors of : . Also he showed that

where is the Euler constant.

Keywords: Pseudo-multiples of numbers; Mean value; Asymptotic formula.

e <> > a pzr a

l e }@W A l n pÏÐ WZ@\ a t ^

RT < > n pÏÐ W[Z@\ a t ^

This proves Theorem 1. <>

Taking â¹AªTE¤v in the theorems, and note that the fact

> TE if : is a h T -full number ;