A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION

Similar documents
DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

GENERATING IDENTITIES FOR FIBONACCI AND LUCAS TRIPLES

Hoggatt and King [lo] defined a complete sequence of natural numbers

6.3 Testing Series With Positive Terms

(2) F j+2 = F J+1 + F., F ^ = 0, F Q = 1 (j = -1, 0, 1, 2, ). Editorial notes This is not our standard Fibonacci sequence.

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

INEQUALITIES BJORN POONEN

MAT 271 Project: Partial Fractions for certain rational functions

Properties and Tests of Zeros of Polynomial Functions

SEQUENCES AND SERIES

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

The natural exponential function

INFINITE SEQUENCES AND SERIES

MAT1026 Calculus II Basic Convergence Tests for Series

SOME TRIBONACCI IDENTITIES

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

Continued Fractions and Pell s Equation

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

1. By using truth tables prove that, for all statements P and Q, the statement

Dirichlet s Theorem on Arithmetic Progressions

Infinite Sequences and Series

Solutions to Math 347 Practice Problems for the final

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

Assignment 5: Solutions

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6

arxiv: v1 [math.co] 3 Feb 2013

7 Sequences of real numbers

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

The log-behavior of n p(n) and n p(n)/n

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

~W I F

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA.

SOME FIBONACCI AND LUCAS IDENTITIES. L. CARLITZ Dyke University, Durham, North Carolina and H. H. FERNS Victoria, B. C, Canada

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

Sequence A sequence is a function whose domain of definition is the set of natural numbers.

Different kinds of Mathematical Induction

Chapter 6 Infinite Series

Lesson 10: Limits and Continuity

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Appendix to Quicksort Asymptotics

Seunghee Ye Ma 8: Week 5 Oct 28

Solutions to Tutorial 3 (Week 4)

CHAPTER 1 SEQUENCES AND INFINITE SERIES

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

SOME RESULTS ON FIBONACCI QUATERNIONS MUTHULAKSHMI R. IYER Indian Statistical Institute, Calcutta, India

Bertrand s Postulate

MA131 - Analysis 1. Workbook 7 Series I

ADVANCED PROBLEMS AND SOLUTIONS

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS

MA131 - Analysis 1. Workbook 3 Sequences II

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

Section 11.6 Absolute and Conditional Convergence, Root and Ratio Tests

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

IRRATIONALITY MEASURES, IRRATIONALITY BASES, AND A THEOREM OF JARNÍK 1. INTRODUCTION

Random Models. Tusheng Zhang. February 14, 2013

Square-Congruence Modulo n

Coffee Hour Problems of the Week (solutions)

The Boolean Ring of Intervals

3 Gauss map and continued fractions

Math 220A Fall 2007 Homework #2. Will Garner A

MDIV. Multiple divisor functions

Some Basic Diophantine Equations

CHAPTER 10 INFINITE SEQUENCES AND SERIES

The Structure of Z p when p is Prime

PRACTICE FINAL/STUDY GUIDE SOLUTIONS

INFINITE SEQUENCES AND SERIES

2 Banach spaces and Hilbert spaces

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Some identities involving Fibonacci, Lucas polynomials and their applications

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

On Some Properties of Digital Roots

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

SEQUENCE AND SERIES NCERT

Math 113, Calculus II Winter 2007 Final Exam Solutions

Factors of sums and alternating sums involving binomial coefficients and powers of integers

Householder s approximants and continued fraction expansion of quadratic irrationals

1 Approximating Integrals using Taylor Polynomials

Sequences and Series of Functions

AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif.

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

Section 7 Fundamentals of Sequences and Series

Chapter 8. Euler s Gamma function

University of Manitoba, Mathletics 2009

A PROOF OF THE TWIN PRIME CONJECTURE AND OTHER POSSIBLE APPLICATIONS

On Divisibility concerning Binomial Coefficients

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

MATHEMATICS ON SEQUENCES OF INTEGERS GENERATED BY A SIEVING PROCESS BY PAUL ERDŐS ANa ERI JABOTINSKY (Communicated by Prof. J. POPKEN at the meeting o

On Generalized Fibonacci Numbers

Objective Mathematics

Chapter 10: Power Series

Transcription:

A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II C. T. LONG J. H. JORDAN* Washigto State Uiversity, Pullma, Washigto 1. INTRODUCTION I the first paper [2 ] i this series, we developed certai properties of the simple cotiued fractio expasios of itegral multiples of quadratic surds with expasios of the form [a,b] or [a,b,c] where the otatio is that of Hardy Wright [1, Chapter 10]. For easy referece, we restate the priciple results here. Theorem 1. deote the k Let = [a,b], let be a positive iteger, let p, /q. coverget to let t, = q, - + q, - for k > 0 where we take q_ x = 0. The = [r/s] if oly if = <l 2i _ 2 > r = p 2m-2' s = t 0 2m-2 0 for some m > 1. Theorem 2. Let,, p, /q, t, be as i Theorem 1. The = [u,v,w] if oly if v = q 2 m _ l 9 vu = P 2 m _ 1 - If vw = t 2 m _ 1-2 for some iteger m ^ 1. * 8 th Theorem3. Let = [ a, b, c ], let p, /q, be the k coverget to, let t^ = q k _ 1 + q k + 1 s k = p k _^ + p k + 1 for k > 1. The, for every iteger r > 1, we have q 2 r * ^ = [ p 2r 9 fc 2r> c t 2 r / b ] ' q 2r-l = t p 2r-l " X ' l > Sr-i " 2 ] hv-l ' * = [ S 2r-1> q 2 r - l ' ( c ' + 4 c / b ) q 2 r - l J t 2 r ' ( = [ s 2 r - 1, 1, q 2 r - 2, 1, (be + 4)q 2 r - 2]. Of course, for a = b = c = 1, the precedig theorems give results ivolvig the golde ratio, (1 + V*5)/2, the Fiboacci Lucas umbers sice, i that case, *The first author was supported by NSF Grat GP-7114. 135

136 A LIMITED ARITHMETIC [March { = (1 + VB)/2. p k = F k + 2, q k = F k + 1, ^ = L k + 1, ^ = ^ where F L deote respectively the Fiboacci Lucas umbers. I the preset paper, we devote our attetio primarily to the study of the simple cotiued fractio expasios of positive ratioal multiples of quadratic surds with expasios of the form [a]. Agai, we ote that, for a = 1, the theorems specialize to results about the golde ratio Fiboacci Lucas umbers. 2. PRELIMINARY CONSIDERATIONS Let the itegral sequeces {f } {g } be defied as follows: ri>0 >0 (1) f 0 = 0, ft = 1, f = a ^! * ^ ' - (2) go = 2, gt = a, g = ag _ 1 + g ^, > 0, where a is ay positive iteger. These differece equatios are easily solved to give (3) f = * ", => 0, 7a 2 + 4 (4) g = t +?, > 0, where = (a + Va 2 + T)/2 J = (a - */a 2 + 4)/2 are the two irratioal roots of the equatio (5) x 2 - ax - 1 = 0.

1970] ON SIMPLE CONTINUED FRACTIONS - H 137 Icidetally, if fl is a quadratic surd, we will always deote the cojugate surd by p. The followig formulas, of iterest i themselves, geeralize results for the Fiboacci Lucas umbers are easily proved by iductio, f = 2 > Z : ^(2! - M+ li) 2 a i + 1 i=0 ^ / (6) > 0, fo 2+l i=0 (7) % = f - l + W ^ > ( 8 ) f m + + l = f m f + W + 1> m ^ 0 ' * > ( 9 ) ^r-+l = f m^ + W + 1' m * ' ^ > (10) f f - f A ^ = (-l) m ~h JJt9 l < m <. m m-1 +1 m-+1' Also, we obtai i the usual way from (8) the followig lemma. Lemma 4. For the itegral sequece (f } ^ 0 we have that f If if oly if m, where m are positive itegers m > 2 if a = 1. 3, PRINCIPAL RESULTS Our first theorem, together with the results of the first paper i this couplet, yields a series of results cocerig the simple cotiued fractio expasio of multiples of = : [a] by the reciprocals of positive itegers* The theorem is also of some iterest i its ow right. Theorem 5. Let = (a + b*/c)/d with a, b, c, d itegers, c ot a perfect square, c d positive. Let r be a positive ratioal umber such that 2ar/d is a iteger. Let a 2 + d 2 = b 2 c let 1 < < r. The r = [a 0, a l8 a 2, ],

138 A LIMITED ARITHMETIC [March if oly if L 2 a r 1 r ' a " ~ c P a i > a 2' ' " 1 * Proof. We ote first that a^ - 2ar/d is p positive. This is so sice [ ar + r l W c ^ ra + rbvc" a 0 - ( 3 _^ "J! ^ c g. so that 2ar ^ - r a + rbn/c" d = 51 (*- - b 2 c > b's/c" U- rd 1 a + h\l~c r { - 1 => o, by hypothesis. Now let /x = [a^ a 2, a 3, ] so that The r = a 0 + -. t 2ar "1 1 0, a 0 -, a ls a 2, = 2 a r t 2ar r i + bvc 2a\ d ~ d J r(-a + b's/c) -d(a + b^f) r(a 2 - b 2 c) a + b^c" ~. dr = _ r

1970] ON SIMPLE CONTINUED FRACTIONS - H 139 the proof is complete. Corollary 6. Let a be positive itegers. Let = [a] let > f. The = [a 0, a l9 a 2, ] if oly if = [0, a 0, - a, a l9 a 2, " ' ]. Proof. Sice * * > a + \ / a 2 + 4 f = [a] = j, we may use the precedig theorem with a = a, b = 1, c = a 2 + 4, d = 2, r =. The result the follows immediately sice is a iteger 2ar _ 2a d ~ 2 + d 2 = a 2 + 4 = b 2 c, as required. Now for f = [a] = s - The covergets p, /q. are give by the equatios p 0 = a, P l = a 2 + 1, p = ap _ 1 + p _ 2, (11) ^ 2, q 0 = 1, q t = a, q = a q ^ + q 2, it is clear that p = f q = f - for ^ 0. Also, p' = f q f = f - for ^ 0, where p f /q T is the coverget to l/f. The

140 A LIMITED ARITHMETIC [March followig results could all be stated i terms of the sequeces (p } {q }; istead, we use the sequeces (f } ( g }. Corollary 7. Let r, s, be the positive itegers with > = r = f 2m' a d S = [ a ]. The f/ = [0, r, s], if oly if, = f 2 m - l ' q - for some m ^ 2. ^2m-l Proof. This is a immediate cosequece of Theorem 1 with a = b, Corollary 6. Corollary 8. Let u, v., w, be positive itegers with > = [ a ]. The f/ = [0, u, v, w ], if oly if, v = f 2m> vu = ^ m + l " 1 ' vw = g 2-2 for some iteger m ^ 2. Proof. This is a immediate cosequece of Corollary 6 Theorem 2 with u = v = w = a. The ext corollary results from Theorem 3 Corollary 6 by takig a = b = c. However, sice, i this special case, parts (a) (b) of Theorem 2 yield results already obtaied, we cocer ourselves oly with parts (c) (d). r > 1, Corollary 9. Let be a positive iteger greater tha. The for 4 = [ > < W f 2r' < a2+ ' 4 > f 2r] ^ = [0, g 2 r - 1. 1, f 2r+1-2, 1, (a* + 4)f 2r+1-2 ]. The ext theorem shows that the periodic part of the simple cotiued fractio expasio of for siy positive iteger > f = [a] is almost symmetric. Of course, by Corollary 6, the same thig is true of f/. Theorem 10. Let a be positive itegers with > = [a]. The = [a 0, a t,, a ] the vector (a l9 a 2,, a _-) is symmetric if r ^ 2.

1970] ON SIMPLE CONTINUED FRACTIONS - II 141 Proof. Sice a 0 = [ ], we have that 0 < f - fy < 1 f! = 1 - i, 1 ( - a 0 where f j is the first complete quotiet i the expasio of. Moreover, 1 1 fl = - a0 ^ + a 0 so that -1 < J" <0 f sice ao + /f is clearly greater tha oe, Thus, fj is a reduced quadratic surd by the geeral theory (see, for example [3, Chapter 4]) has a purely periodic simple cotiued fractio expasio, say fl = [ait a 2,, a r ]. Additioally, we also have that [a, a -, ', a-] is the expasio of the egative reciprocal of the cojugate of lo Thus, r. o i I, L a r*, a r_]_»., j a ', a- 1 J J = - j = 7- + a* v so that (12) J = [0, a r - a Q, a r - l f a r _ 2, -, a ^ a r ]

142 A LIMITED ARITHMETIC [March But, from above, = [a 0, &i,, a r ], by Corollary 6, (13) - = [0, a 0 - a, a lf a 2,, a r ]. Thus, comparig (12) (13), we have that the vector (a ls a 2,, a _-) is symmetric. We ow tur our attetio to the cosideratio of more geeral positive ratioal multiples of = [a]. Theorem 11. Let r be ratioal with 0 < r < 1. If the simple cotiued fractio expasio of r is ot purely periodic, the r = [0, a 1? a 2,, a j I _ r.., r ~ La " V V l ' a - 2 ' "» a 2 ' a J for some ^ 2. Proof. If r had a purely periodic simple cotiued fractio expasio, the r would have to be a reduced quadratic surd so that r > 1-1 ^ rt < 0. But the first of these iequalities implies that (14) j < r < 1,, sice = -l/f, the secod implies that (15) > r > 0

1970] ON SIMPLE CONTINUED FRACTIONS - H 143 which is already implied by (14). Therefore, sice r is ot purely periodic, we have (16) 0 < r < i, so that 0 = [ r ] = a 0. Now cosider f 1 = ^ > 1. set aj = [ i] ^ 1. Agai, 1 1 _ f i - aj = h > 1 (2 = " T T~~ - H 7 + at sice?" = - 1. Therefore, - 1 < J 2 < 0 2 i s a purely periodic simple cotiued fractio expasio, reduced. Thus, 2 a s 6 = [ a 2i a 3,, a ], r = [0, a l5 a 2,, a j, as claimed. Also, + ai = - - = a, a -,, a 0, r * T- L ' -1 ' 2 J ' * 2

144 A LIMITED ARITHMETIC [March so that the proof is complete. "~" ~~ I a a., a.., a ~ «a^, a i r L 1-1 r-2 2 J Theorem 12. Let r be ratioal with 0 < r < 1. If the simple cotiued fractio expasio of rf is purely periodic, the r = [ v a i» "» *J for some > 0. - = fa, a -,, a A 1 r L -1 0 J Proof. Sice the simple cotiued fractio expasio of rf is purely periodic, it is reduced we have by the precedig proof that < r < 1 Sice we also have f i r - - i.2. = = a, a.,, a~ J, r T L -1 the proof is complete. I passig, we ote that the periodic part of the expasios of rf eed ot exhibit ay symmetry or eve ear symmetry. For example, for a = [1] = 2, we have that

1970] ON SIMPLE CONTINUED FRACTIONS - II 145 o r = [0, 2, l f 3, 1, 1, 3, 9] a = [1, 4, 1, 2, 6, 2]. Also, it is easy to fid ratioal umbers r with 0 < r < 1 such that the surds va a/v are ot equivalet where we recall that two real umbers JJL v are said to be equivalet if oly if there exist itegers a, b, c, d with ad - be j = 1 such that u, = SL4. ^ cv + d However, as the followig theorems show, there exist iterestig examples, where ear symmetry of the periodic part of the expasios of r f equivalece of r r/f both hold. We will idicate that r f f/r are equivalet by the otatio / r b r Theorem 13. Let a be a positive iteger, let f = [a], let the sequeces (f } {g } be as defied above. The, for > 1, ^O -0 >0 f 2+l f 2+2 = [a Q, a x,, a r ] 2+2 r.. o 1 7 = a, a,? ", a J r f 2-KL ^ where the vector (a 2, a 3, *, a r, ao) is symmetric, a 0 = a 2 = 1, aj = f - 1 l o *4+3

146 A LIMITED ARITHMETIC [March Proof. We first demostrate the purely periodic ature of the expasios i questio. From the defiitio, it i s clear that f i s strictly icreasig for ^ 2. Also, f /f - is the coverget to l/f. Therefore, (17) ^ L. < i <^ ±1< 1. i 2+l * x 2+2 it follows from the proof of Theorem 11 that f f 2 - /fl 2 has a purely periodic expasio. Also, from Theorem 12, f 2 2 /f 2 - has a purely periodic expasio whose period is the reverse of that for f 2 +l ^ 2 +2* Additioally, from (17), it follows that < f 2+l _ i < 1 / f 2+l _ f 2 \ = _ 1_ f 2+2 f 2 \ f 2+2 f 2+l/ 2f 2+l f! 2+l 2+2 so that -. f 2+l > _ g,, 1 < ^ _. < _ + 1 *2+2 x 2+l 2+2 < 2 f t a y + 1 < 2 2+l 2+2 Thus, a 0 = [ff 2+1 / f 2 + 2 ] = 1. Now 2+l. f.! f 2+2 we claim that W 4+3 * - K ^ ^1! < f 4+3 9 so that a 4 = f 4-1. To see that this is so, we ote mat, sice f 2 /f - is the coverget to,

1970] ON SIMPLE CONTINUED FRACTIONS 147 f 2+2 ^ f4+4. < f f " < ^ 2+l 4+3 1 ^ f2+l f 4+4 ^ f2+l 1 < ^ <. % 2+2 4+3 2+2 But this gives, usig (10), 2-fl 2+l 4+4 2+2 4+3 * f x > f f 2+2 2+2 4+3 f 2+2 1 f 2+2 f 4+3 f 4+3 o r (18) < f 4+3 a s desired. Also, we have that f 2+2 t f 4+3 f * "^ f 2+l 4+2 so that, agai by (10), o < ^ S J i. f 2+2 - i *2+l f 4+3 ~ f 2+2 f 4+2 ^, :, f 2+l f 2+2 f 4+2 2+2 4+2 f 2+l f 2+l f 4+3 f 2+l

148 A LIMITED ARITHMETIC [March Thus, aj = [f i] = f. - 1 as claimed. Fially, to show the symmetry of the vector (a 2, &$,, a, a Q ), it suffices to show that (19) 1 - =. «. 2+l a 2 f 2+l f7~7 2+2 " * " a 0 a t Makig use of the determied values of a 0 aj settig a 2 = 1, meas that we must show that this (20) 1 = **** f 2+l f 2+l f ( ' 1 x 2+2 " < f 4 + 3 - «which will also, of course, cofirm the fact that a 2 = 1. Now (20) is true if oly if

1970] ON SIMPLE CONTINUED FRACTIONS - H 149 1 - _ f 2+l 2+2 ( f 4 + 3 " «x 2+2 which i s true if oly if 1 f 2+l. x 2+2-1 (f 4+3 " 1) - ^ 2 + 2 ' f + f f x 2+l * 2+2 which, i tur, is true if oly if f H s 2+2 2+2 f - ^ f 2 + l - f 2 + 2 " f 2 + l + to+3 ^ 2 + 2 " " To see that this l a s t equatio i s true we make use of (8), (10), the fact that 2 = ^ + i 0 obtai f 2+2 ^f2+2 = f 2+2 f 2+l + * f 2+2 " ^ f2+l f 2+2 + ^f2+2 f 2+l " f 2 + 2 " f 2-KL + ^ 2 Q + 2 " f + 1 + V < - l f 2 + 2 - W 2 + 2 " ^ + 2 2 ^ 2 + 2 " a^f2+l f 2+2 f f 2+l + a f f 2+l f 2+2 " f f 2+2 f (f + f ) 2+2 u 2+2 2 ; f f - f 2 1 2+l 2+3 2+2 f 2 4 - f f + f f - f 2-1 x 2+2 I 2+2 2 2+l 2+3 2+2 f - 1 I 4+3

150 A LIMITED ARITHMETIC [March This completes the proof. Because of the similarity of method, the followig theorems a r e stated without proof. The otatio is as before. T h e o r e m 14. F o r > 2, 2 *. r i 7 = L a 0> a i> a 2» "» a r J 2+l f 2+l ^ r -i i -f - = La 3-1, a 4, a 5,, a r, a 2, a 3 J, 2 where the vector (a 3, a 4,, a r ) is s y m m e t r i c, a 0 = 0, a 4 = 1, a 2 f 4+l " l f a d a 3 = f 3 +! T h e o r e m 15. Let >: 2 be a iteger. The +2 r.., f = [a 0, a t,, a r J, 11 > _ r»... " 1?""" * ' ~" L a r' +2 a r - l ' ' a o J s - ~ e f = [ b 0, b j,, b s ], T^-t = [ V V l ' ' fc o] T h e o r e m 16. Let be a positive iteger. The g 2+l t T.., f = [ a 0, a A, a 2,, a r J, 8 2+2

1970] ON SIMPLE CONTINUED FRACTIONS - II 151 g 2+2 2+l = [ 2 9 a 4? a 5,.., a. a 2, a 3 ] r the vector (a 3, a 4,», a r ) is symmetric with a 0 = 0, a, t = 1, f 4+3 " l s a d a 3 = 3e Theorem 17, Let be a positive iteger. The g 2 =2+l = [a 0, *U, a r ] g 2+i g 2 = [ a r, a r _ l S, a if a 0 ], where the vector (a 29 a 3, «, a r s a 0 ) is symmetric with a^ - a 2 = l f a l = f 4+l " X «I view of the precedig results 9 oe would expect a iterestig theorem cocerig the simple cotiued fractio expasio of i.. s but we were ot able to make a geeral assertio value for all a. To illustrate the difficulty, ote that s whe a = 2 = 1 + *J"2 9 we have f 4 = [ 0, 1, 5, 1, 3, 5, 1, 7], &4 f g5 f = [0, 1, 5, 1, 5, 3, 1, 4, 1, 7],

152 A LIMITED ARITHMETIC [March f 1- = [0, 1, 5, 1, 4, 1, 3, 5, 1, 4, 1, 7]. &6 However, for i; = = [1] = «^ -» we obtai the followig rather elegat result: Theorem 18. Let a = (1 + *v/5)/2 let F L deote the Fiboacci Lucas umbers, respectively. The, for > 4, F (21) _. a = [0, 1, 2, 1,, 1, 3, 1,, 1, 4] L L (22) -I- a = [ 3, 1,, 1, 3, 1, -, 1, 2, 4 ], where, i (21), there are - 4 oes i the first group - 3 oes i the secod group just the reverse i (22). Proof. Set x = [2, 1, -., 1, 3, 1,, 1, 4] = [2, 1,, 1, 3, 1,, 1, 4, x ]. The it is easy to see by direct computatio as o computes covergets, that a x + b \ JT7T where

1970] ON SIMPLE CONTINUED FRACTIONS - H 153 a " 4 ( L - l F - l + F -2> 2 + ( L -2 F -l + F -3 F -2> = 4 F + F F - l + <-»*' b = L - l F - l + F -2 = F C " 4 ( L - l F - 3 + F -2 F -4> + < L -2 F -3 + V s W = 4F -l + F F - 3 Moreover, from (23), d = L F + F F = F 2 V l - 3-2 -4-1 x (a - d ) + J ( a - d ) 2 + 4b c 7 y 2c y = [o, i. x j X x + 1 (a - d ) + J ( a - d ) 2 + 4b c y (a - d +2c )+ (a - d ) g +4b c ' = (a - d -2b ) + J(a - d ) 2 + 4b c J 2(a - b + c - d ) Now

154 A LIMITED ARITHMETIC [March a - d - 2b = 4F 2 + F F, + ( - l ) - F 2-2F 2-1 - 1 = 2 F 2 + F F, - F F 0-1 - 2 (25) = F (2F + F - F Q) - 1-2 ' F ^F+2 " F - 2 * = F L, a - b + c - d v = (a - d - 2b ) + b + c ' (26) = F L + F 2 + 4F 2 + F F 0-1 - 3 F L + 2F -L - 1 = L 2 < a " V 2 + 4 V = < 4 F + F F - l + ^ " p Ll>' + 4 F ^ ( 4 F ^ _ 1 + F F _ 3 ) (27) = K F l + 3 + 4 F ^ 4 F L l + F F a-3> = F < F + 3 + 1 6 F - l + 4 F F - 3 > = 5 F 2 L 2 T h u s, usig (25), (26), (27), i (24), we obtai Y F L + F L \/5 F - J / = = ji 1 + V5 = 2 " 2L2 L '

1970] ON SIMPLE CONTINUED FRACTIONS H 155 as claimed. The other part of the proof is a immediate cosequece of Theorem 11. Fially, we commet o the questio of the equivalece of rf f/r. If r = g ^ /f or r = g m /g^9 where m are oegative itegers, it frequetly turs out to be the case that rf ~ f/r. However, this is ot ecessarily the case hece, & fortiori, it is.ot ecessarily the case for more geeral r. For example, for a = (l+\[5)f2 = [1], J. a = [0, 1, 2, 3, 1, 4] 1» a = [ 3, 1, 3, 2, 4] where 3 = f 4 = g 2 7 = g 4 ; other examples are easily foud. However, if r = f s = f for oegative itegers m the we always have s * r * as the followig theorem shows. Theorem 18. If m are oegative itegers, the f f m *. t m

156 A LIMITED ARITHMETIC [March Proof. Without loss of geerality, we may assume that 0 < m < that (m,) = 1. We let f f f f = m 2 3 m + 2 b = c = f d = -HJ D c 2qm+l' a J ' ^ q m + l ' f ^ m where q is chose so that 2q + 2 = 0 (mod ), as may easily be doe sice (m,) = 1. With this choice for q it follows f from Lemma 4 that l f 2 G im+2 ^ f ml f 2am s o t a t a» k» c» a d d a r e a^itegers. Also, by (10), ad - be = J*L*E1±2. V p q m _ f2 f f 2qm+l m ^ = f f - f 2 2qm+2 2qm 2qm+l = -1. Fially, we show that f (28) ^ f / f a F " - \ m \ m + b H + c for this choice of a, b, c, d. Makig the idicated substitutios, we have that (28) holds if oly if f m f 2qm+2 / f J\ + f f I F " ' * / f 2qm+l T~ m " * t \ m / = 7 T \ TT 0 '* / f \ ' f: f / t. I j. 2 q m

1970] ON SIMPLE CONTINUED FRACTIONS - II 157 this is true if oly if ^ f2qm+l + ^f2qm ^f2qm+2 + f 2qm+l e But this is clearly true sice af 2 = a + 1 af 0, - + f = f 0, 0 J * 2qm+l 2qm 2qm+2 the proof is complete, Fially 8 we ote that the list of stated theorems is ot exhaustive. could o doubt prove theorems cocerig Oe f f f, y y? " s 9 f» f +2 +4 +5 so o. However? we were ot able to arrive at geeral formulatios of the expasios of f f g m t m t r ' f ' T" 8^f o r T" * & ^ m & t 9 for arbitrary positive itegers m. The results stated seem to be the most iterestig. REFERENCES 1. G. H. Hardy E. M. Wright, A Itroductio to the Theory of Numbers, Oxford Uiversity Press, Lodo, 1954. 2. C. T. Log J, H, Jorda 9 "A Limited Arithmetic o Simple Cotiued Fractios," Fiboacci Quarterly, 5 (1967), pp. 113-128. 3. C. D. Olds, Cotiued Fractios, Rom House, New York, 1963.