ON THE GENERALIZATION OF THE FLOOR OF THE SQUARE ROOT SEQUENCE

Yao Weili
Research Center for Basic Science, Xian Jiaotong University Xian, Shaanxi, P.R.China

Abstract

The oor of the square root sequence is the natural sequence, where each number is repeated 2n +1 times. In this paper, we use analytic method to study the mean value properties of its generalization, and give an interesting asymptotic formula.

Keywords:

the oor of the square root sequence; mean value; asymptotic formula.

1. Introduction
The oor of the square roots of the natural numbers are: 0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4, 5,5,5,5,5,5,5,5,5,5,5,6,6, 6,6,6,6,6,6,6,6,6,6,6, 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,8, This sequence is the natural sequence, where each number is repeated 2n +1 times. In reference [1], Professor F.Smarandache asked us to study the properties of this sequence. We denote the generalization of the sequence as b(n), in which each number is repeated kn + 1 times, and express it as b(n) = [n1/k ]. In reference [2], He Xiaolin and Guo Jinbao studied the mean value of d(b(n)), and obtain an asymptotic formula for it. In this paper, as a generalization of [2], we use analytic method to study the mean value properties of (b(n)), and give a general asymptotic formula for (b(n)). That is, we shall prove the following : Theorem. For any real number x > 1 and integer n 1, we have

+k1 k (+1) +k k + O(x k ), +k x 1 k x log x + O (x),

(b(n)) =
nx

(2)x + 0(x k ), +k1 (1 )x + O(x k ),

k+1

if > 0; if = 0; if = 1; if < 0 and = 1

where (n) =

d be the divisor function, (n) be the Riemann Zeta funcd|n

tion, = max{1, }, = max{0, 1 + } and > 0 be an arbitrary real number.

184

SCIENTIA MAGNA VOL.1, NO.1

2. Proof of the Theorem

In this section, we shall complete the proof of the theorem. Firstly, we need following: Lemma 1. Let > 0 be a xed real number. Then for x > 1, we have (n) =
nx

( + 1) +1 x + O(x ), +1

and (n) =
nx

( + 1)x + O(x ), if = 1; (2)x + O(log x), if = 1.

where = max{1, }, = max{0, 1 }, (n) denotes the Riemann zetafunction. Proof See reference [3]. Lemma 2. Let n be a positive integer, and b(n) = [n1/k ], d(n) be the divisor function, then 0 (b(n)) =
nx nx

d [n1/k ] =

1 x log x + O(x). k

Proof. See reference [2]. Now we use the above Lemmas to complete the proof of Theorem. We separate into three cases respectively. Case 1 , when > 0, we have (b(n)) =
nx nx

([n1/k ]) ] +
2k n<3k

=
1k n<2k

[n +

1/k

[n1/k ] +

[n1/k ] + O(N )
N k n<(N +1)k

=
j N

(j + 1)k j k (j ) + O(N ). (j ) and f (j ) = (j + 1)k j k , applying Abels

j N

Let A(n) =
nx

identity and Lemma 1, we have (b(n))

nx

= A(N )f (N ) A(1)f (1) =

N 1

A(t)f (t)dt + O(N )

N

k ( + 1) +k N k (k 1) +1

( + 1) +k+1 t dt +k

On the generalization of the oor of the square root sequence

185

= =

+O(N +k1 ) k ( + 1) +k N + O(N +k1 ) +k +k1 k ( + 1) +k x k + O(x k ). +k 1 ([n1/k ])

nx

Case 2, when = 1, we have 1 (b(n)) =

nx

=
1k n<2k

1 [n +

1/k

] +
2k n<3k

1 [n1/k ] +

1 [n1/k ] + O(N )
N k n<(N +1)k

=
j N

(j + 1)k j k 1 (j ) + O(N ). 1 (j ) and f (j ) = (j + 1)k j k , we have

j N

Let A(n) =
j N

1 (b(n)) =
nx nx

1 [n1/k ]
N 1

= A(N )f (N ) A(1)f (1) = (2)N k + O(N k+1 ) = (2)x + O(x

k+1 k

A(t)f (t)dt + O(N )

),

where > 0 be an arbitrary real number. Case 3, when < 0 and = 1, we have (b(n)) =
nx nx

([n1/k ]) [n1/k ] +
2k n<3k

=
1k n<2k

[n1/k ] + +
N k n<(N +1)k

[n1/k ] + O(N ) (j + 1)k j k (j ) + O(N ).

=
j N

Let A(n) =
j N

(j ) and f (j ) = (b(n)) =

(j + 1)k j k , we have
j N

([n1/k ])
nx

nx

186
= A(N )f (N ) A(1)f (1)

SCIENTIA MAGNA VOL.1, NO.1

N 1

A(t)f (t)dt + O(N )

= k (1 )N k + O(N k+1 ) (k 1) (1 )N k = (1 )N k + O(N k+1 ) = (1 )x + O(x

+k1 k

).

Combining the above result, we have

+k1 k (+1) +k k + O(x k ), +k x 1 k x log x + O (x),

(b(n)) =
nx

(2)x + 0(x k ), +k1 (1 )x + O(x k ),

k+1

if > 0; if = 0; if = 1; if < 0 and = 1

This completes the proof of Theorem.

References
[1] F.Smarandache, Only Problems, Not Solutions, Chicago, Xiquan Publ. House, 1993. [2] He Xiaolin, On the 80-th problem of F.Smarandache (II), Smarandache Notions Journal, 14 (2004), 7479. [3] T.M.Apostol, Introduction to Analytic Number Theory, New York, SpringerVerlag, 1976.