Scribd
Upload
50 views3 pages

On The Square-Free Number Sequence

The main purpose of this paper is to study the number of the square-free number sequence, and give two interesting asymptotic formulas for it. At last, give another asymptotic formula and a corollary.

Uploaded by

RyanElias
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views3 pages

On The Square-Free Number Sequence

The main purpose of this paper is to study the number of the square-free number sequence, and give two interesting asymptotic formulas for it. At last, give another asymptotic formula and a corollary.

Uploaded by

RyanElias
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Scientia Magna

Vol. 1 (2005), No. 2, 46-48


On the square-free number sequence
Ren Dongmei
Research Center for Basic Science, Xian Jiaotong University
Xian, Shaanxi, P.R.China
Abstract The main purpose of this paper is to study the number of the square-free number sequence,
and give two interesting asymptotic formulas for it. At last, give another asymptotic formula and a
corollary.
Keywords Square-free number sequence; Asymptotic formula.
1. Introduction
A number is called a square-free number if its digits dont contain the numbers: 0, 1, 4,
9. Let A denote the set of all square-free numbers. In reference [1], Professor F. Smarandache
asked us to study the properties of the square-free number sequence. About this problem, 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 number of the square-free number sequence, and
obtain two interesting asymptotic formulas for it. That is, let S(x) =

nx,nA
1, we shall prove
the followings:
Theorem 1. For any real number x 1, we have the asymptotic formula
lnS(x) =
ln6
ln10
lnx +O(1).
Theorem 2. For any real number x 1, we have the asymptotic formula

nx,nB
1 = x +O
_
x
2 ln 2
ln 10
_
,
where B denote the complementary set of those numbers whose all digits are square numbers.
Let B

denote the set of those numbers whose all digits are square numbers. Then we have
the following:
Theorem 3. For any real number x 1,we have the asymptotic formula

nx,nB
1
n
= lnx + C +O
_
x

ln
5
2
ln 10
_
,
where C is a computable constant, denotes the Eulers constant.
Let A

denote the complementary set of A, we have following:


Corollary. For any real number x 1, we have the asymptotic formula
Vol. 1 On the Square-Free number sequence 47

nx,nA

1
n
= lnx + D +O
_
x

ln
5
3
ln 10
_
,
where D is a computable constant.
2. Proof of Theorems
In this section, we shall complete the proof of Theorems. First we need the following one
simple lemma.
Lemma. For any real number x 1, we have the asymptotic formula

nx,nB

1
n
= C +O
_
x

ln
5
2
ln 10
_
.
Proof. In the interval [10
r1
, 10
r
), (r 2), there are 3 4
r1
numbers belong to B

, and
every numbers reciprocal isnt greater than
1
10
r1
; when r = 1, there are 4 numbers belong to
B

and their reciprocals arent greater than 1. Then we have

nB

1
n
< 3 +

r=1
3
4
r
10
r
,
then

nB

1 is convergent to a constant C. So

nx,nB

1
n
=

nB

1
n

n>x,nB

1
n
= C +O
_

r=k
3 4
r
10
r
_
= C +O
_
x

ln
5
2
ln 10
_
.
Now we come to prove Theorem 1. First for any real number x 1, there exists a non-
negative integer k, such that 10
k
x < 10
k+1
(k 1) therefore k log x < k + 1. If a number
belongs to A, then its digits only contain these six numbers: 2, 3, 5, 6, 7, 8.
So in the interval [10
r1
, 10
r
)(r 1), there are 6
r
numbers belong to A. Then we have

nx,nA
1
k+1

r=1
6
r
=
6
5
(6
k+1
1) <
6
k+2
5
<
6
2
5
x
ln 6
ln 10
,
and

nx,nA
1
k

r=1
6
r
=
6
5
(6
k
1) 6
k
>
1
6
x
ln 6
ln 10
.
So we have
1
6
x
ln 6
ln 10
<

nx,nA
1 <
6
2
5
x
ln 6
ln 10
.
Taking the logarithm computation on both sides of the above, we get
48 Ren Dongmei No. 2
ln(x
ln 6
ln 10
) + (ln6) <

nx,nA
1 < ln
_
x
ln 6
ln 10
_
+ (2 ln6 ln5).
So
lnS(x) = ln
_
_

nx,nA
1
_
_
= ln
_
x
ln 6
ln 10
_
+O(1) =
ln6
ln10
lnx +O(1).
This proves the Theorem 1.
Now we prove Theorem 2. It is clear that if a number doesnt belong to B, then all of its
digits are square numbers. So in the interval [10
r1
, 10
r
), (r 2), there are 3 4
r1
numbers
dont belong to B; when r = 1, there are 4 numbers dont belong to B. Then we have

nx,nB
1 =

nx
1

nx,nB

1
= x +O
_
4 + 3 4 + 3 4
2
+ + 3 4
k
_
= x +O
_
4
k+1
_
= x +O
_
x
2ln 2
ln 10
_
.
This completes the proof of the Theorem 2. Now we prove the Theorem 3. In reference [2], we
know the asymptotic formula:

nx
1
n
= lnx + +O
_
1
x
_
,
where is the Eulers constant.
Then from this asymptotic formula and the above Lemma, we have

nx,nB
1
n
=

nx
1
n

nx,nB

1
n
= lnx + +O
_
1
x
_
C +O
_
x

ln
5
2
ln 10
_
= lnx + C +O
_
x

ln
5
2
ln 10
_
.
This completes the proof of the Theorem 3. Now the Corollary immediately follows from the
Lemma and Theorem 3.
Reference
[1] F.Smarandache, Only problems, Not Solutions, Xiquan Publ. House, Chicago, 1993.
[2] Tom M.Apostol, Introduction to Analytic Number Theory, Springer-Verlag, New York,
1976.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy