On the Pell p-circulant sequences

Similar documents
Fibonacci and Lucas Numbers as Tridiagonal Matrix Determinants

ON NILPOTENCY IN NONASSOCIATIVE ALGEBRAS

SUM PROPERTIES FOR THE K-LUCAS NUMBERS WITH ARITHMETIC INDEXES

TiCC TR November, Gauss Sums, Partitions and Constant-Value Codes. A.J. van Zanten. TiCC, Tilburg University Tilburg, The Netherlands

Sequences and summations

Patterns of Continued Fractions with a Positive Integer as a Gap

POWERS OF COMPLEX PERSYMMETRIC ANTI-TRIDIAGONAL MATRICES WITH CONSTANT ANTI-DIAGONALS

On Stability of a Class of Fractional Differential Equations

On Solution of Min-Max Composition Fuzzy Relational Equation

Union, Intersection, Product and Direct Product of Prime Ideals

Factorization of Finite Abelian Groups

Stats & Summary

Available online through

ELEMENTS OF NUMBER THEORY. In the following we will use mainly integers and positive integers. - the set of integers - the set of positive integers

Inversion of two new circulant matrices over Z m

Sebastián Martín Ruiz. Applications of Smarandache Function, and Prime and Coprime Functions

A METHOD FOR THE RAPID NUMERICAL CALCULATION OF PARTIAL SUMS OF GENERALIZED HARMONICAL SERIES WITH PRESCRIBED ACCURACY

On a class of analytic functions defined by Ruscheweyh derivative

Journal Of Inequalities And Applications, 2008, v. 2008, p

for each of its columns. A quick calculation will verify that: thus m < dim(v). Then a basis of V with respect to which T has the form: A

The Computation of Common Infinity-norm Lyapunov Functions for Linear Switched Systems

MATRIX AND VECTOR NORMS

ME 501A Seminar in Engineering Analysis Page 1

Keywords: Heptic non-homogeneous equation, Pyramidal numbers, Pronic numbers, fourth dimensional figurate numbers.

Non-uniform Turán-type problems

A Family of Non-Self Maps Satisfying i -Contractive Condition and Having Unique Common Fixed Point in Metrically Convex Spaces *

Exercise # 2.1 3, 7, , 3, , -9, 1, Solution: natural numbers are 3, , -9, 1, 2.5, 3, , , -9, 1, 2 2.5, 3, , -9, 1, , -9, 1, 2.

3. REVIEW OF PROPERTIES OF EIGENVALUES AND EIGENVECTORS

Analytical Approach for the Solution of Thermodynamic Identities with Relativistic General Equation of State in a Mixture of Gases

An Alternative Method to Find the Solution of Zero One Integer Linear Fractional Programming Problem with the Help of -Matrix

Unique Common Fixed Point of Sequences of Mappings in G-Metric Space M. Akram *, Nosheen

Some Different Perspectives on Linear Least Squares

A Family of 2n-Point Ternary Non-Stationary Interpolating Subdivision Scheme

Chapter Unary Matrix Operations

Integration by Parts for D K

18.413: Error Correcting Codes Lab March 2, Lecture 8

On the introductory notes on Artin s Conjecture

The Number of the Two Dimensional Run Length Constrained Arrays

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n

Lexicographic Strategic Games Nonstandard Analysis

PATTERNS IN CONTINUED FRACTION EXPANSIONS

Chapter 7. Bounds for weighted sums of Random Variables

Expanding Super Edge-Magic Graphs

On Several Inequalities Deduced Using a Power Series Approach

CURVE FITTING LEAST SQUARES METHOD

The z-transform. LTI System description. Prof. Siripong Potisuk

MULTIOBJECTIVE NONLINEAR FRACTIONAL PROGRAMMING PROBLEMS INVOLVING GENERALIZED d - TYPE-I n -SET FUNCTIONS

10.2 Series. , we get. which is called an infinite series ( or just a series) and is denoted, for short, by the symbol. i i n

Introducing Sieve of Eratosthenes as a Theorem

DUALITY FOR MINIMUM MATRIX NORM PROBLEMS

THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Series A, OF THE ROMANIAN ACADEMY Volume 9, Number 3/2008, pp

MATH2999 Directed Studies in Mathematics Matrix Theory and Its Applications

Semi-Riemann Metric on. the Tangent Bundle and its Index

COMPUTERISED ALGEBRA USED TO CALCULATE X n COST AND SOME COSTS FROM CONVERSIONS OF P-BASE SYSTEM WITH REFERENCES OF P-ADIC NUMBERS FROM

Fibonacci Identities as Binomial Sums

Random Variables. ECE 313 Probability with Engineering Applications Lecture 8 Professor Ravi K. Iyer University of Illinois

Entropy ISSN by MDPI

Bond Additive Modeling 5. Mathematical Properties of the Variable Sum Exdeg Index

Application of Generating Functions to the Theory of Success Runs

SOME SERIES IDENTITIES FOR SOME SPECIAL CLASSES OF APOSTOL-BERNOULLI AND APOSTOL-EULER POLYNOMIALS RELATED TO GENERALIZED POWER AND ALTERNATING SUMS

Hypercyclic Functions for Backward and Bilateral Shift Operators. Faculty of Science, Ain Shams University, Cairo, Egypt 2 Department of Mathematics,

International Journal of Scientific and Research Publications, Volume 3, Issue 5, May ISSN

A New Efficient Approach to Solve Multi-Objective Transportation Problem in the Fuzzy Environment (Product approach)

A Technique for Constructing Odd-order Magic Squares Using Basic Latin Squares

Some results and conjectures about recurrence relations for certain sequences of binomial sums.

A New Method for Solving Fuzzy Linear. Programming by Solving Linear Programming

MATH 371 Homework assignment 1 August 29, 2013

Department of Statistics, Dibrugarh University, Dibrugarh, Assam, India. Department of Statistics, G. C. College, Silchar, Assam, India.

PubH 7405: REGRESSION ANALYSIS REGRESSION IN MATRIX TERMS

APPLICATION OF DIFFERENCE EQUATIONS TO CERTAIN TRIDIAGONAL MATRICES

Area and the Definite Integral. Area under Curve. The Partition. y f (x) We want to find the area under f (x) on [ a, b ]

A Study on New Sequence of Functions Involving the Generalized Contour Integral

Lecture 8. A little bit of fun math Read: Chapter 7 (and 8) Finite Algebraic Structures

Research Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings

Chapter 2 Intro to Math Techniques for Quantum Mechanics

arxiv: v4 [math.nt] 14 Aug 2015

2. Independence and Bernoulli Trials

Polyphase Filters. Section 12.4 Porat

#A27 INTEGERS 13 (2013) SOME WEIGHTED SUMS OF PRODUCTS OF LUCAS SEQUENCES

ICS141: Discrete Mathematics for Computer Science I

Abstrct Pell equto s mportt reserch object elemetry umber theory of defte equto ts form s smple, but t s rch ture My umber theory problems ce trsforme

h-analogue of Fibonacci Numbers

V. Hemalatha, V. Mohana Selvi,

D KL (P Q) := p i ln p i q i

Complete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables

A Damped Guass-Newton Method for the Generalized Linear Complementarity Problem

SUMMARY OF THE ZETA REGULARIZATION METHOD APPLIED TO THE CALCULATION OF DIVERGENT SERIES

Asymptotic Dominance Problems. is not constant but for n 0, f ( n) 11. 0, so that for n N f

Some identities involving the partial sum of q-binomial coefficients

European Journal of Mathematics and Computer Science Vol. 3 No. 1, 2016 ISSN ISSN

, we would have a series, designated as + j 1

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

Neville Robbins Mathematics Department, San Francisco State University, San Francisco, CA (Submitted August 2002-Final Revision December 2002)

ANALYTICAL NUMBER THEORY. MM-504 and 505 (Option-P 5

CHAPTER 4 RADICAL EXPRESSIONS

Optimality of Strategies for Collapsing Expanded Random Variables In a Simple Random Sample Ed Stanek

CS473-Algorithms I. Lecture 3. Solving Recurrences. Cevdet Aykanat - Bilkent University Computer Engineering Department

2/20/2013. Topics. Power Flow Part 1 Text: Power Transmission. Power Transmission. Power Transmission. Power Transmission

On the Rational Valued Characters Table of the

Solutions Manual for Polymer Science and Technology Third Edition

Transcription:

Notes o Nuber Theory d Dscrete Mthetcs Prt ISSN 30-53, Ole ISSN 367-875 Vol. 3, 07, No., 9 03 O the Pell -crcult sequeces Yeş Aüzü, Öür Devec, d A. G. Sho 3 Dr., Fculty of Scece d Letters, Kfs Uversty 3600, Turey Assocte Professor, Fculty of Scece d Letters, Kfs Uversty 3600, Turey 3 Eertus Professor, Fculty of Egeerg & IT, Uversty of Techology Sydey, 007, Austrl Receved: Jury 06 Acceted: 3 Jury 07 Abstrct: I ths er, we defe the geerlzed Pell -crcult sequece d the Pell - crcult sequece by usg the crcult trces whch re obted fro the chrcterstc olyol of the geerlzed Pell (, ) -sequece d the, we obt scelleous roertes of these sequeces. Also, we cosder the cyclc grous whch re geerted by the geertg trces d the uxlry equtos of the defed recurrece sequeces d the, we study the orders of these grous. Furtherore, we exted the Pell -crcult sequece to grous. Flly, we obt the legths of the erods of Pell -crcult sequeces the sedhedrl grou SD for 4 s lctos of the results obted. Keywords: Crcult Mtrx, Sequece, Grou, Perod. AMS Clssfcto: B50, 0F05, 5A36, 0D60. Itroducto Klc [7] defed the geerlzed Pell (, ) -ubers s follows: for y gve ( =,,3, ) > d 0 () ( () P P ( ) P ( ) ( wth tl codtos ) ( P () = = P ) = 0 d = (.) 9

( ) ( ) ( P ) = P = = P ( ) =. It s cler tht the chrcterstc olyol of the geerlzed Pell (, ) -sequece s f x = x x. Dvs [4] defed the crcult trx C = c ssocted wth the ubers c0, c,, c s follows: The ( th ) C c0 c c c c c0 c3 c = c c 3 c0 c c c c c 0. P x = c c x c x s clled the ssocted degree olyol olyol of the crcult trx 0 C [cf.,5,0,,4]. Suose tht the ( )th ter of sequece s defed recursvely by ler cobto of the recedg ters: = c0 c c, where c0, c,, c re rel costts. Kl [6] derved uber of closed-for foruls for the geerlzed sequece by the coo trx ethod s follows: 0 0 0 0 0 0 0 0 0 0 0 0 0 A = 0 0 0 0 c0 c c c c. He lso showed tht A 0 =. These hve bee used by Gry the develoet of the relted theory Toeltz trces [3], d by Sho d Berste exteso of geerlzto of cotued frctos to rbtrry order recursve sequeces [3]. I Secto, we defe the geerlzed Pell -crcult sequece d the Pell -crcult 9

sequece such tht these sequeces re obted fro the crcult trx C P whch s defed by usg the chrcterstc olyol of the geerlzed Pell (, ) -sequece. The we obt ther scelleous roertes. I [5,6,7,8,9,9], the uthors obted the cyclc grous d the segrous v soe secl trces. I Secto 3, we cosder the ultlctve orders of the crcult trx C P d the Pell -crcult trx M P worg to odulo d the, we obt the cyclc grous whch re geerted by reducg these trces odulo. Also ths secto, we study the defed recurrece sequeces odulo. The we derve the reltoshs betwee the orders of the obted cyclc grous d the erods of the defed sequeces ccordg to odulo. The study of recurrece sequeces grous beg wth the erler wor of Wll [6] where the ordry Fbocc sequeces cyclc grous were vestgted. The cocet exteded to soe secl ler recurrece sequeces by severl uthors; see for exle, [,3,5,7,9,0,,8,9,,5]. I Secto 4, we defe the Pell -crcult sequece by es of the eleets of the grous whch hve two or ore geertors, d the we exe ths sequece fte grous. Furtherore, we exe the behvours of the legths of the erods of the Pell -crcult sequeces the sedhedrl grou SD for 4. The Geerlzed Pell -Crcult d The Pell -Crcult Sequeces We c wrte the followg crcult trx for the olyol f ( x ) s s follows: C P ( ) ( = ) ( = = ) ( ) ( ) ( ) f =, f d,, = C = P P f =, =, = d =, =, 0 other wse. For exle, the trx C 4 s s follows: 0 0 C4 = 0 0. Defe the geerlzed Pell -crcult sequece by usg the trces C s show: 93

x x x, od, x = x x x, od( ), x x x, od( ), x x x 3 0od( ) where x = x = = x = 0 d x =. For 0, by ductve rguet, we y wrte x x x x x x x x x x x x x x ( C ) = x x x x x x( ) x ( ) x ( ) x ( ) It s esy to see tht ( ) 3 3 ( ) x C s crcult trx of order. for >, (.). (.) We ext defe the Pell -crcult sequece s = for > 0 (.3) where = = = = 0, = d. We the obt tht the geertg fucto of the Pell -crcult sequece { } s s follows: x g( x) = x x x. By (.3), we c wrte the followg coo trx: 0 0 0 0 0 0 0 0 0 0 MP = = 0 0 0 0 0 0 0 0 The trx M P s sd to be the Pell -crcult trx. It s cler tht = M For, by ductve rguet, we y wrte 94

( M ) 3 =. 3 (.4) Note tht det M =. It s well-ow tht the Sso detty for recursve sequece c be obted fro the detert of ts geertg trx. Le.. The chrcterstc equto of the Pell -crcult sequece x x x = 0 does ot hve ultle roots. Proof. Let d let μ be ultle root of h( z ). The 0 h z = z z z h μ = d h ( μ ) 0 root of h( z ). So, we obt ' Thus d hece, h d h ( μ ) ( μ ) Sce =. We frst ote tht 0 s ot h μ = μ μ μ = μ μ μ = 0. μ, = ± 7 4 4 ( ) 7 4 ( ) 7 4 ( ) 7 4 = = 4 4 4 ( ) 7 4 ( ) 7 4 ( ) 7 4 = = 4 4 4, by ducto o, t s see tht h( μ ) d h( μ ), whch re cotrdctos. Thus, the equto h( μ ) = 0 does ot hve ultle roots. h ε be the chrcterstc olyol of the Pell -crcult trx M. If Let ε, ε,, ε re egevlues of the trx M, the by Le., t s ow tht ε, ε,, ε re dstct. Let V be ( ) ( ) Vderode trx: 95

Suose tht d (, ) V s ( ) ( ) ε ε ε ε ε ε V = ε ε ε. W ε ε = ε trx obted fro V by relcg the th colu of V by W. We c ow estblsh the Bet forul for the Pell -crcult sequece wth the followg Theore. Theore.. Let be the th ter of the Pell -crcult sequece. The where det = det (, ) ( V ) ( V ) ( M ) =. Proof. Sce the egevlues of the trx M re dstct, the trx M s D = dg ε, ε,, ε, the t s esy to see tht M V = VD. Sce dgolzble. Let the trx V s vertble, get ( ) = for M V VD So, we obt V M V = D. Hece, the trx M s slr to D. So we. The we wrte the followg ler syste of equtos for: ε ε = ε ε ε = ε ε ε = ε. (, ) ( V ) det = for, =,,,. det ( V ) 96

3 The Cyclc Grous v the trces C P d M P For gve trx A= wth s tegers, A ( od ) reduced odulo, tht s, A( od ) ( ( od ) ) A = { A ( od ) 0 }. If gcd (, det A ) =, the the set otto A. Sce det A deotes the order of the set es tht ech eleet of A s =. Let us cosder the set A s cyclc grou. Let the M =, t s cler tht the set M s cyclc grou for every ostve teger. Slrly, the set C s cyclc grou f ( C ) trces C P d M P. gcd, =. We ext cosder the cyclc grous geerted by these Theore 3.. Let be re d let G be y of the cyclc grous C d M such tht N. If u s the lrgest ostve teger such tht G = G u, the G v v u = G for every v u. I rtculr, f G G, the G v = G for every v. Proof. Let us cosder the cyclc grou d let M P M be deoted by h( ) ( h ) MP I ( od ), the ( h ) MP I ( od ) d I s ( ) ( ) detty trx. Thus we fd tht h( ) dvdes h( ) wrtg M I. If where s ostve teger ( ) = ( ( )) = ( ) ( od ) h = we get fro the bol exso tht ( ) h P = 0 M I I whch yelds tht h( ) dvdes h( ). Thus, h( ) = h( ) or h h It s cler the tht h( ) = h( ) holds f d oly f there exsts teger u s ot dvsble by. Sce u s the lrgest ostve teger such tht h( ) h( ) u u h( ) h( ( u ) ). The, there exsts teger u u tht h( ) h( ). To colete the roof we y use ductve ethod o u.,. Also, =. whch =, we hve whch s ot dvsble by. So we get There s slr roof for the cyclc grou C. λ 97

Theore 3.. Let t = ( t ) e =, G be y of the cyclc grous C P d M d let where s re dstct res. The G = lc G, G,, G e e e t t Proof. Let us cosder the cyclc grou C P. Suose tht C e = α for t d let C d α =. The by (.), we obt α ( ) α ( ) e 0 od for, α ( ) α ( ) e od 0od for, od. Ths les tht = α α ( ) for d N α for ll vlues of. Thus t s verfed tht for C P. tht s, α C P s of the C = lc C,,, e e e C C t t. There s slr roof for the set M. It s well-ow tht sequece s erodc f, fter cert ot, t cossts oly of reettos of fxed subsequece. The uber of eleets the reetg subsequece s the erod of the sequece. A sequece s sly erodc wth erod f the frst eleets the sequece for reetg subsequece. Reducg the geerlzed Pell -crcult sequece d the Pell -crcult sequece of the by odulus, we c get the reetg sequeces, resectvely deoted by x = x, x, x,, x, d { } { } 3 {,,,,, } { } 3 where x = x ( od ), ( od ) =, =. They hve the se recurrece relto s the deftos of the geerlzed Pell -crcult sequece d the Pell -crcult sequece, resectvely. Theore 3.3. The sequece Slrly, the sequece { } { x } s sly erodc sequece f ( C ) s sly erodc for every ostve teger. gcd det,. = 98

{ } Proof. Let us cosder the Pell -crcult sequece {(,,, ) 0 } Q= q q q q, the Q P =. Sce there re. Let P dstct -tules { } of eleets of, t lest oe of the. Thus, the subsequece followg ths -tule reets; tht s the sequece s erodc. So f -tules ers twce the sequece,,, od. Fro the defto, we c esly derve tht d >, the,,, =. Thus we get tht the sequece s sly erodc. x. { } There s slr roof for the sequece { } We deote the legths of the erods of the sequeces x ( ) d ( ) by x { } l, l, resectvely. The, we hve the followg useful results fro (.) d (.4), resectvely. Corollry 3.. Let be re. The. If ( C ) l gcd det,. l =. C. =, the x P = M. Let be re d let such tht { od :, } ( ) ( ) N. The, t s cler tht the set A = x x = x x A s cyclc grou. Now we c gve reltosh betwee the chrcterstc equto of the Pell -crcult sequece d the erod l by the followg Corollry. Corollry 3.. Let be re d let N. The, the cyclc grou A( ) s soorhc to the cyclc grou M. 4 The Pell -Crcult Sequece Grous Let G be fte -geertor grou d let X be the subset of (,,, ) x x x X f d oly f G s geerted by x, x,, x geertg -tule for G. 99 G G G G such tht. We cll ( x, x,, x )

Defto 4.. Let G = X be ftely geerted grou such tht X = { x, x,, x}. The we defe the Pell -crcult sequece the grou G s follows: ( ) ( ) ( ) ( ) ( ) f, = f > for, wth tl codtos For -tule (,,, ) PC ( G ) x, x,, x. = x for. x x x X, the Pell -crcult sequece grou G s deoted by Theore 4.. A Pell -crcult sequece fte grou s sly erodc. Proof. Suose tht s the order of G. Sce there dstct G, t lest oe of the -tules ers twce the sequece -tules of eleets of PC ( G ) x, x,, x. Thus, cosder the subsequece followg ths -tule. Becuse of the reetg, the sequece s erodc. Sce the sequece wth u v, such tht PC By the defto of the sequece s erodc, there exst turl ubers u d v, ( G ) x, x,, x =, =,, =. u v u v u v PC ( G ) x, x,, x ( ) ( ) ( ) ( )( ) Therefore, we obt u = v, d hece,, we ow tht f, =. f > =, =,, =, u v u v u v whch les tht the sequece s sly erodc sequece. Let LPC ( G ) x, x,, x deote the legth of the erod of the sequece the defto of the sequece PC ( G ) x, x,, x PC ( G ) x, x,, x. Fro t s cler tht the erod of ths sequece fte grou deeds o the chose geertg set d the order whch the ssgets of x, x,, x re de. 00

We shll ow ddress the legths of the erods the Pell -crcult sequeces the sedhedrl grou SD. A grou SD s sedhedrl grou of order f SD =, b = b = e, b b = for every 4. Note tht the orders d b re d, resectvely [cf.,4]. Theore 4.. The legths of the erods the Pell -crcult sequeces the sedhedrl grou SD re s follows: 3. ( ) LPC SD ;, b = l for =,. ( ) LPC SD ;, b = l for 3. Proof.. We rove ths by drect clculto. Note tht the grou SD s defed by the resetto b, = b = eb, b=. =, b = d l = 5. The, It s cler tht b b =. The sequece ( ) PC SD ;, b s 3 ( 3)( ) 5 ( 7) 3 ( 7) ( ), b, b, b, b,, b,, b, ( ) 3 ( 7) ( 4) b,,, b,, e. Usg the bove, the sequece becoes: x =, x = b, x = b, x = b,, 3 4 x =, x = b, x = b, x = b,,, 5 4 6 7 8 9 x =, x = b, x = b, x = b,. 4 4 5 5 5 3 5 4 So we eed the sllest teger such tht 4 = for N. It s esy to see tht the legth of the erod of the sequece s. For 3, the sequece ( ) Fro bove, the sequece becoes: 3 5. PC SD ;, b hs the followg for: x =, x = b, x3 = b, x4 = b,, x = b,, ( 4) ( 4) λ x =, x = b, x = b, l l l 3 ( 4) λ ( 4) λ x = b,, x = b,, l 4 l 0

where λ, λ,, λ N. So we eed the sllest teger such tht Thus, we get tht ( ) 4 =. LPC SD ;, b = l. Ths coletes the outle of the lgebrc roertes of the geerlzed Pell -crcult sequeces whch we sought to develo. Acowledget Ths Proect ws suorted by the Cosso for the Scetfc Reserch Proects of Kfs Uversty. The Proect uber. 04-FEF-34 Refereces [] Aydı, H.& Sth, G.C. (994) Fte -quotets of soe cyclclly reseted grous, J. Lodo Mth. Soc., 49, 83-9. [] Bozurt, D. & T-Yu, T. (0) Deterts d verses of crcult trces wth Jcobsthl d Jcobsthl-Lucs ubers, Aled Mthetcs d Coutto, 9 (), 544-55. [3] Cbell, C.M., P.P. Cbell, The Fbocc legths of bry olyhedrl grous d relted grous, Cogr. Nuer., 009, 94: 95-0. [4] Dvs, Phl J. (979) Crcult Mtrces, Joh Wley, New Yor. [5] Devec, O. (05) The Pell-Pdov sequeces d the Jcobsthl-Pdov sequeces fte grous, Utl. Mth., 98, 57-70. [6] Devec, O. & Auzu, Y., (04) The cyclc grous d the segous v McWlls d Chebyshev trces, Jourl of Mth. Reserch, 6(), 55-58. [7] Devec, O. & Auzu, Y., The recurrece sequeces v Hurwtz trces, The Scetfc Als of Al. I. Cuz Uversty of Is, to er. [8] Devec, O.& Krdu,E. (0) The cyclc grous v the Pscl trces d the geerlzed Pscl trces, Ler Algebr d ts Al., 437, 538-545. [9] Devec, O. & Krdu, E. (05) The Pell sequeces fte grous, Utl. Mth., 96, 63-76. [0] Dooste, H. & Hshe, M. (006) Fbocc legths volvg the Wll uber (), J. Al. Mth. Cout., 0, 7-80. [] Dc, R. & Sth, G.C. (997) Fbocc sequeces fte lotet grous, Tursh J. Mth.,, 33-4. [] Goreste, D. (980) Fte Grous, Chelse, New Yor, 88-95. [3] Gry, Robert M. Toeltz d Crcult Mtrces: A Revew. htt://wwwee.stford.edu./~gry/toeltz.df. [4] Huert, B. (967) Edlche Grue, Srger, Hedelberg, 90-93. [5] Igleto, A.W. (956) The r of crcult trces, J. Lodo Mth. Soc., -3 (4), 445-460. [6] Kl, D. (98) Geerlzed Fbocc ubers by trx ethods, The Fbocc Qurt., 0(), 73-76. 0

[7] Klc, E. (009) The geerlzed Pell (,)-ubers d ther Bet foruls, cobtorl reresettos, sus, Chos, Soltos d Frctls, 40(4), 047-063. [8] Kox, S.W. (99) Fbocc sequeces fte grous, The Fbocc Qurt., 30(), 6-0. [9] Lü, K., & Wg, J. (007) -ste Fbocc sequece odulo, Utl. Mth., 7, 69-78. [0] Mur, T. (9) The Theory of Deterts Hstorcl Order of Develoet, Volue 4, Mcll, Lodo. [] Oz, E. (04) Tructed Lucs Sequeces d ts erod, Al. Mth. d Cot., 3, 85-9. [] P, Hogy & Jg, Zhol (05) VderL crcult tye trces, Abstrct d Aled Alyss, Vol.05, Artcle ID 3939, htt://dx.do.org/0.55/05/3939,. [3] Sho, A.G. & Berste, L. (973) The Jcob-Perro Algorth d the Algebr of Recursve Sequeces, Bullet of the Austrl Mthetcl Socety, 8 (4), 6-77. [4] Stehe, B. (990) Mtrces Methods d Alctos, Oxford Uversty Press, New Yor. [5] Ts, S., E. Krdu, (04) The Pdov sequeces fte grous, Chg M J. Sc., 4(), 456-46. [6] Wll, D.D. (960), Fbocc seres odulo, Aer. Mth. Mothly, 67, 55-53. 03