GENERALIZATION OF AN ERS MATRIX METHOD FOR COMPUTING

Florentin Smarandache, Ph D Associate Professor Chair of Department of Math & Sciences University of New Mexico 200 College Road Gallup, NM 87301, USA E-mail:smarand@unm.edu Ers matrix method for computing Fibonacci numbers and their sums can be extended to the s-additive sequence: g s 1 g s 2 ... g 1 0 , g0 1 , and
s

gn
i 1

gn

for n 0 .
n 1

For example, if we note Sn

j 1

g j , we define two (s 1) (s 1) matrixes such

that:

Bn

1 Sn : Sn

s 1

0 gn : gn s

0 ... 0 gn 1 ... gn s 2 : ... : gn s ... gn 2 s 3

0 gn s 1 , : gn 2 s 2

n 1, and
1 1 : 1 1 0 1 : 1 1 0 ... 0 1 ... 0 : ... : , 0 ... 1 0 ... 0

thus, we have analogously: Bn 1 M n 1 , M r c M r M c , whence Sr c Sr gr Sc gr 1Sc 1 ... gr s 1Sc gr c gr gc gr 1gc 1 ... gr s 1gc s 1 ,

s 1

and for r c n it results: S2n Sn gnSn gn 1Sn 1 ... gn s 1Sn s 1 , 2 2 2 g2 n g n gn ... g n ; 1 s 1 for r n , c n 1 , we find: g2 n 1 gn gn 1 gn 1gn 2 ... gn s 1gn s , etc. S2n 1 Sn gnSn 1 gn 1Sn 2 ... gn s 1Sn s Whence we can construct a similar algorithm as M. C. Er for computing sadditive numbers and their sums.

REFERENCE: M. C. Er, Fast Computation of Fibonacci Numbers and Their Sums, J. Inf. Optimization Sci. (Delhi), Vol. 6 (1985), No. 1. pp. 41-47. [Published in GAMMA, Braov, Anul X, No.. 1-2, October 1987, p. 8]