ON A NUMBER SET RELATED TO THE K -FREE NUMBERS

Li Congwei
College of Electron and Information, Northwestern Ploytechnical University, Xian, Shaanxi, P.R.China

Abstract

Let Fk denotes the set of k-free number. For any positive integers l 2, we dene a number set Ak,l as follows Ak,l = {n : n = ml + r, ml n < (m + 1)l , r Fk , n N }. In this paper, we study the arithmetical properties of the number set Ak,l , and give some interesting asymptotic formulae for it.

Keywords:

Number set; k-free number; Asymptotic formula.

1. Introduction
Let k 2 be an integer. The k -free numbers set Fk is dened as follows Fk = {n : if prime p|n then pk n, n N }. In problem 31 of [1], Professor F.Smarandache asked us to study the arithmetical properties of the numbers in Fk . About this problem, many authors had studied it, see [2], [3], [4]. For any positive integer n and l 2, there exist an integer m such that ml n (m + 1)l . So we can dene the following number set Ak,l : Ak,l = {n : n = ml + r, ml n < (m + 1)l , r Fk , n N }. In this paper, we use the elementary methods to study the asymptotic properties of the number of integers in Ak,l less than or equal to a xed real number x, and give some interesting asymptotic formulae. That is, we shall prove the following results: Theorem 1. Let k, l 2 be any integers. Then for any real number x > 1, we have the asymptotic formula 1=
nx nAk,l
1 1 1 x + Ok,l x l + k kl , (k )

154

SCIENTIA MAGNA VOL.1, NO.1

where (s) denotes the Riemann zeta function and Ok,l means the big Oh constant related to k, l. Theorem 2. Assuming the Riemann Hypothesis, there holds 1=
nx nA2,2
29 6 x + O x 44 + 2

where is any xed positive number.

2. Two Lemmas
Lemma 1. For any real number x > 1 and integer k 2, we have the asymptotic formula 1 x + O xk . 1= ( k ) nx
nFk

Proof. See reference [5]. Lemma 2. Assuming the Riemann Hypothesis, we have 1=
nx nF2
7 6 x + O x 22 + 2

Proof. See reference [6].

3. Proof of the theorems

In this section, we shall complete the proofs of the theorems. For any real number x 1 and integer l 2, there exist a positive integer M such that M l x < (M + 1)l . So from the denition of the number set Ak,l and Lemma 1, we can write
M 1 (t+1)l tl

(1)

1=
nx nAk,l M 1 t=1 m=1 mFk

1
mxM l mFk M 1 t=1
1 k

=
t=1

(t + 1)l tl +O (k )

(t + 1)l tl

1 k

x Ml + +O (k )
M 1

x Ml

=
t=1

l1 (t + 1)l tl x M l + + Ok,l M 1+ k (k ) (k )

l1 x + Ok,l M 1+ k , (k )

(2)

On a number set related to the k -free numbers

155

On the other hand, from (1) we have the estimates 0 x M l < (M + 1)l M l Now combining (2) and (3), we have 1=
nx nAk,l
1 1 1 x + Ok,l x l + k kl . (k )

l1 l

(3)

This completes the proof of Theorem 1. From the same argue as proving Theorem 1 and Lemma 2, we can get 1= =
nx nA2,2 12 2 M 1 t=1 t

+O

7 M 1 22 + t=1 t

(4)

= =

6 M2 2 6 x 2

+ O M 22 +
29 + 44

29

(5) . (6)

+ Ok,l x

This completes the proof of Theorem 2.

References
[1] F.Smarandache, Only Problems, Not Solutions, Chicago, Xiquan Publ. House, 1993, pp. 27. [2] Zhang Tianping, On the k -Power Free Number Sequence, Smarandache Notions Journal, 14 (2004), 62-65. [3] Zhu Weiyi, On the k -Power Complement and k -Power free Number Sequence, Smarandache Notions Journal, 14 (2004), 66-69. [4] R.C.Baker and J.Pintz, The distribution of square free numbers, Acta Arith, 46 (1985), 71-79.