Beruflich Dokumente
Kultur Dokumente
Wenpeng Zhang
Research Center for Basic Science, Xi'an Jiaotong University Xi'an Shaanxi, People's Republic of China
1.
As usual, the Lucas sequence {Ln} and the Fibonacci sequence {Fn} (11. 0,1,2, ... ,) are defined by the second-order linear recurrence sequences
and
~
for n
0, Lo
= 2, L1 = 1, Fo = 0 and FI = 1.
tant role in the studies of the theory and application of mathematics. Therefore, the various properties of Ln and Fn were investigated by many authors. For example, R. L. Duncan [1] and L. Kuipers [2J proved that (logFn) is uniformly distributed mod 1. H.London and R.Finkelstein [3] studied the Fibonacci and Lucas numbers which are perfect powers. The author [4] obtained some identities involving the Fibonacci numbers.
In this paper, we introduce a new counting function a(m) related to the Lucas
numbers, then use elementary methods to give an exact calculating formula for its mean value. First we consider the Smarandache's generalized base, Professor F.Smarandach defined over the set of natural numbers the following infinite generalized base: 1 =
go
< gl < ... < gk < .... He proved that every positive integer N
N=L(f.i9j,
;=0
1 This
with
gi'
1]
191
,n.
rj
o.
This base is important for partitions. If we take the gi as the Lucas sequence, then we can get a particular base, for convenience, we refer to it as a Smarandache Lucas base. Then any positive integer m may be uniquely written in the Smarandache Lucas base as:
m =
L aiLi,
i=l
with all ai
= 0 or 1,
(1)
That is, any positive integer may be written as a sum of Lucas numbers. Now for an integer m =
The main purpose of this paper is to study the distribution properties of a( m), and present a calculating formula for the mean value
Ar(N)
L ar(n),
n<N
= 1,
2.
(2)
A1(Lk) =
and
L
n<Lk
a(n)=kFk-1
with
> k2 > ... > ks under the Smarandache Lucas base. Then we have
and
192
Further,
Al(N) For any positiv e intege r r
=L
;=1
[kiFk; -l
+ (i -l)Lk J.
calcul ating formu la for AALk ). But in these cases, the compu tation s are more complex. 2.
In this section , we compl ete the proof of the Theor ems. First we prove Theor em 1 by induct ion. For k
A 1 (L 2 ) = Al(3) = 2
L
n<LIc
a(n) = kFk-l
~'m
(3)
holds for k = 1 and 2. Assum e (3) is true for all k assum ption we have Al(Lm ) =
L
n<L m _ 1
a(n)
1)
L
Lm_1$ n<L m
a(n) a(n + L m - l )
= Al(L m -
L
O$n<L m
_ 2
=A1 (L m - 1 )+
L
O$n<L m
_ 2
(a(n)
+ 1)
a(n)
L
n<L m _ 2
= (m -1)Fm = m(Fm 2
+ (m -
2)Fm Fm 3 2 -
+ Lm - 2
3
+ Fm - 3 ) Fm 1 -
2Fm -
+ Lm - 2
= mFm - l
= mFm 1,
Fm -
+ Lm - 2
+ Fm - 3
193
= Lm-
+ F-1
or F-1
1 [(k 5
l)(k - 2)Lk-2
if k = 1; if k = 2.
5 [(k -
(4)'
+ 2L m - 2
= 5Fm -;
+ 2Fm - 2 = L m - 1 , we have
= A2(Lm-d
1 =5 [em -
+ A 2 (L m - 2 ) + 2A1(L m - 2) + L m - 2
3
2)(m - 3)L rn -
+ 5(m -
2)Fm -
+ 7(m -
2)Fm -
+ 3Frn - 2 ] + 3Fm- 3 ]
+ 5 [em -
3)(m - 4)Lm-4
3
+ 5(m -
3)Fm- 4
+ 7(m -
3)Fm- s
+ 2(m =
2)Fm -
+Lm - 2
3
~ [em -l)(m 5
2)L rn -
+ 5(m 4
1)Fm -
+ 5 [em -
+ 5(m -
1)Fm -
+ 7(m -
l)Fm - s
+ 3Fm - 3 ]
~ [2(rn 5
+ 14Fm =
s ] +2(m -2)Fm -
+L m -
~ [em -l)(m -
2)L m- 2
+ 5(m 194
1)Fm-
+ 7(m -
1)Fm- 3
+ 3Fm -
1]
- -:[2(m - 2)(L m -. 3 oJ
1
+ 2L m - 4 ) -
2L m -
+ 5(Fm - 3 + 2Fm - 4 )
5" [(m - l)(m - 2)L m - 2 + 5(m - I)Fm - 2 + 7(m - I)Fm - 3 + 3F~-1] - 5" [10(177. - 2)Fm - 3
1
2L m -
+ 5L m - 3 + 7L m - 4 ]
+ 2(m - 2)Fm - 3 + L m - 2
=
= m.
have
Al(N) =
L
n<Lkl
a(n)
L
Lkl $;n<N
a(n) a(n)
= A 1 (Lk 1 )
L
Lkl $.n<N
L
and
(a(n) + 1)
(a 2 (n)
O$.n<N-Lk l
+ 2a(n) + 1)
= A 2 (LkJ
This proves the first part of Theorem 2. The final formula in Theorem 2 can be proved using induction on .s and the recursion formulae. This completes the proof of Theorem 2.
195
REFERENCES
1. Duncan, RL., Application of Uniform Distribution to the Fibonacci Nu.mbers, The Fibonacci Quarterly 5 (1967), 137-140. 2. Kuipers, 1., Remark on a paper by R. L. Duncan concerning the uniform distrubu.tion mod 1 of the sequence of the Logarithms of the Fibonacci numbers, The Fibonacci Quarterly 7 (1969),465-466. 3. London, H. and Finkelstein, R., On Fibonacci and Lucas numbers which are perfect powers, The Fibonacci Quarterly 7 (1969), 476-48l. 4. Wenpeng Zhang, Some identities involving the Fibonacci numbers, The Fibonacci Quarterly 35 (1997), 225-229. 5. Robbins, N., Applications of Fibonacci Numbers, Kluwer Academic publishers, 1986, pp. 7788. 6. Dumitrescu, C., Seleacu, V., Some notions and questions in number theory, Xiquan Pub!. Hse., Glendale, 1994, Section #47-517. Grebenikova, Irina, Some Bases of Numerations (Abstracts of Papers Presented at the American Mathematical Society), Vol. 17, No.3, Issue 105, 1996, p. 588. 8. "Smarandache Bases" at http://www.gallup.unm.edursmaranda.che/bases.txt.
196