INVERSE TERNARY CONTINUED FRACTIONS

Similar documents
Proofs Not Based On POMI

Note that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction.

Trade Patterns, Production networks, and Trade and employment in the Asia-US region

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

QUARTIC POWER SERIES IN F 3 ((T 1 )) WITH BOUNDED PARTIAL QUOTIENTS. Alain Lasjaunias

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

WEAR A COLLAR RAISE A DOLLAR THIS

Proof by Induction. Andreas Klappenecker

Proofs Not Based On POMI

Green s Function for an n-point Right Focal Boundary Value Problem

Worksheet A VECTORS 1 G H I D E F A B C

S. Lie has thrown much new light on this operation. The assumption

1 Recursive Algorithms

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic

GENERALIZED PALINDROMIC CONTINUED FRACTIONS

Selma City Schools Curriculum Pacing Guide Grades Subject: Algebra II Effective Year:

COMPLETE PADOVAN SEQUENCES IN FINITE FIELDS. JUAN B. GIL Penn State Altoona, 3000 Ivyside Park, Altoona, PA 16601

ELEMENTARY LINEAR ALGEBRA

ANGLO-CHINESE JUNIOR COLLEGE MATHEMATICS DEPARTMENT. Paper 1 18 August 2015 JC 2 PRELIMINARY EXAMINATION Time allowed: 3 hours

PhysicsAndMathsTutor.com

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Introductory Numerical Analysis

Mathematical Induction Assignments

A THEOREM ON LOCALLY EUCLIDEAN GROUPS

EIGENVALUES AND EIGENVECTORS

January Core Mathematics C1 Mark Scheme

CHINO VALLEY UNIFIED SCHOOL DISTRICT INSTRUCTIONAL GUIDE ALGEBRA II

CSCE 222 Discrete Structures for Computing. Proof by Induction. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker

(308 ) EXAMPLES. 1. FIND the quotient and remainder when. II. 1. Find a root of the equation x* = +J Find a root of the equation x 6 = ^ - 1.

PHI 120 Introductory Logic Consistency of the Calculus

ON THE PARTITIONS OF A GROUP AND THE RESULTING CLASSIFICATION*

\ABC (9) \AX BI Ci\ = 0, r; vi -iv ~*i -n*yi -o

Bounds for Eigenvalues of Tridiagonal Symmetric Matrices Computed. by the LR Method. By Gene H. Golub

Groups with many subnormal subgroups. *

EQUATIONS WHOSE ROOTS ARE T I E nth POWERS OF T I E ROOTS OF A GIVEN CUBIC EQUATION

ON DIVISION ALGEBRAS*

ELEMENTARY LINEAR ALGEBRA

DM559 Linear and Integer Programming. Lecture 3 Matrix Operations. Marco Chiarandini

THE NUMBER OF COPRIME CHAINS WITH LARGEST MEMBER n


The purpose of computing is insight, not numbers. Richard Wesley Hamming

THE CONTIGUOUS FUNCTION RELATIONS FOR pf q WITH APPLICATIONS TO BATEMAN'S ƒ»«and RICE'S # n (r, p, v)

SOME APPLICATIONS H. F. BLICHFELDT

A NEIGHBORHOOD TREATMENT OF GENERAL TOPOLOGICAL SPACES*

Algebra 1. Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots.

T h e C S E T I P r o j e c t

Math 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby

Fermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.

NOTE ON IRREDUCIBLE QUARTIC CONGRUENCES*

Admissible Monomials (Lecture 6)

On Permutation Polynomials over Local Finite Commutative Rings

Chapter 1. Sets and Numbers

11.3 Eigenvalues and Eigenvectors of a Tridiagonal Matrix

Mark Scheme (Results) Summer 2007

NEW ALGORITHM FOR MINIMAL SOLUTION OF LINEAR POLYNOMIAL EQUATIONS

TABLE OF CONTENTS 2 CHAPTER 1

Some Results Concerning Uniqueness of Triangle Sequences

Vector Algebra. a) only x b)only y c)neither x nor y d) both x and y. 5)Two adjacent sides of a parallelogram PQRS are given by: PQ =2i +j +11k &

ACO Comprehensive Exam October 18 and 19, Analysis of Algorithms

ESTIMATION OF POLYNOMIAL ROOTS BY CONTINUED FRACTIONS

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

page 1 Total ( )

A SET OF FOUR POSTULATES FOR BOOLEAN ALGEBRA IN TERMS OF THE "IMPLICATIVE" OPERATION*

PERIODICITY OF SOMOS SEQUENCES

Chapter 2. Real Numbers. 1. Rational Numbers

P. ERDÖS 2. We need several lemmas or the proo o the upper bound in (1). LEMMA 1. { d ( (k)) r 2 < x (log x)c5. This result is due to van der Corput*.

TRIANGLE CENTERS DEFINED BY QUADRATIC POLYNOMIALS

PRINCIPLE OF MATHEMATICAL INDUCTION

Mathematical Structures Combinations and Permutations

64 P. ERDOS AND E. G. STRAUS It is possible that (1.1) has only a finite number of solutions for fixed t and variable k > 2, but we cannot prove this

Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.

1 = k1 + k 2 2 = 3k 1 + 5k 2

Solving Pell s equation using the nearest square continued fraction

chapter 5 INTRODUCTION TO MATRIX ALGEBRA GOALS 5.1 Basic Definitions

Introduction. The first chapter of FP1 introduces you to imaginary and complex numbers

*I can recognize parts of an expression. *I can recognize parts of an expression in terms of the context.

Junior Soldiers Unit 13 : Lesson 1

LINEAR SYSTEMS AND MATRICES

SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS

A Formula of Newton. term. Or, putting it differently, the "sequence of first differences" Eugene F. Krause

A NEW NORMAL FORM FOR QUARTIC EQUATIONS*

Ternary Modified Collatz Sequences And Jacobsthal Numbers

55 Separable Extensions

Lecture 2. Fundamentals of the Analysis of Algorithm Efficiency

Chapter 4. Matrices and Matrix Rings

Practice Midterm Exam Solutions

JUST THE MATHS UNIT NUMBER 1.6. ALGEBRA 6 (Formulae and algebraic equations) A.J.Hobson

STRAIGHT LINES EXERCISE - 3

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.

2. Linear recursions, different cases We discern amongst 5 different cases with respect to the behaviour of the series C(x) (see (. 3)). Let R be the

CHAPTER 8: EXPLORING R

The theory of continued fractions and the approximations of irrational numbers

CSC 344 Algorithms and Complexity. Proof by Mathematical Induction

1 Matrices and Systems of Linear Equations

ELEMENTARY LINEAR ALGEBRA

June Core Mathematics C1 Mark Scheme

Jumping Sequences. Steve Butler 1. (joint work with Ron Graham and Nan Zang) University of California Los Angelese

REAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.

Question Scheme Marks AOs. 1 Area( R ) ( ) 2 = 6(2) + ("1.635") = B1ft 2.2a 1

MATHEMATICS EXTENSION 2

Transcription:

I93I-1 TERNARY CONTINUED FRACTIONS 565 INVERSE TERNARY CONTINUED FRACTIONS BY D. N. LEHMER In Jacobi's extension of the continued fraction algorithm* we are concerned with three series of numbers given by the recursion formulas A n = q n A n -.\ + p n A n -2 + A n -z, B n q n B n -i + p n B n -2 + i? n _3, W (JnCn 1 T" pvpn 2 ~T C n 3, with initial values 1, 0, 0 for A ; 0, 1, 0 for B, and 0, 0, 1 for C. We have called this series of numbers (A n, B n, C n ) the convergent sets, and the series of numbers (p n, q n ) the partial quotient sets of a ternary continued fraction, f It is well known that if the partial quotient sets recur periodically the ratios A n /B n, A n /C n and B n /C n approach cubic irrationalities except in certain special cases where they approach quadratic irrationalities \ or where they approach no limit at all. The cubic irrationalities when they exist are connected by a linear fractional relation with the roots of the characteristic cubic Ak~2 P Blc-2 Ck-2 Ajc-i Bk-i p Cjc-i Ah Bk Ck p = 0, connected with the purely periodic ternary continued fraction (Pu 0\\p2,q2\ - ' ' ; pk, Ok) formed of those partial quotient pairs that recur. This characteristic cubic we write p 3 Mp 2 -\-Np -1=0, where M = A k -2+Bk-i+C k} and N = Ak~2Bk~i Ak-iBk-2 + Bk-iCk BkCk-i + CkAk-2 AkCk-2» We shall confine ourselves in what follows to purely periodic * Jacobi, Werke, vol. VI, pp. 385-426. t Proceedings of the National Academy of Sciences, vol. 4 (1918), p. 360* Î J. B. Coleman, American Journal of Mathematics, vol. 52, No. 4, October, 1930.

566 D. N. LEHMER [August, fractions. Those fractions which have a finite number of nonperiodic partial quotient pairs to start with introduce no new difficulties. The irrationalities which they determine are simply related to the fraction obtained by ignoring the non-periodic pairs. Two ternary continued fractions (pi, q\\ p 2, q 2 \ ; pn, <ln) and (p n, q n ; p n -\, q n -in', ; p2, 2; pu gi) will be called inverse. If a purely periodic ternary continued fraction be set up with the first of these as its period and another with the second as its period the two continued fractions will not necessarily have the same discriminating cubic, unless the partial quotient pairs read backward and forward the same. Thus the cubic which corresponds to the fraction (1, 1; 3, 2; 4, 1) is p 3 14p 2 1=0 and that corresponding to the fraction (4, 1; 3, 2; 1, 1) is p 3 17p 2 + 3p 1 =0. The irrationalities defined by these cubics are different. It is the purpose of this paper to show that if the p's and g's are given by the equations (1) P = at + P, q = yt + Ô,. where a, j8, 7, S, t are any given integers whatever, positive, negative or zero, then the discriminating cubic is the same for the fraction and its inverse. This theorem we establish by induction, but in the treatment by this method it appears that it is necessary to drive along simultaneously a group of assumed relations. This peculiarity, seldom met with elsewhere, seems to be characteristic of the proofs by induction of theorems in continued fractions of higher orders. Let the nth convergent set of the first fraction be (A n, B n, C n ) and of the second be (A n r, Bn, Cn), and let the coefficients of the discriminating cubic of the first be M and N and of the second M' and N'. We have to show that if the equations (1) hold, then M =M' and N = N'. These equations are easily verified, for w = l, 2,. We assume them true for values of the index up to and including n. We consider then the fraction with n+1 partial quotient pairs: (p h q x ; p 2, q 2 ', ; pn, q n ', P, q) where p and q also satisfy equations (1) and let the nth. convergent set of the inverse of this fraction be (A", B", CI 1 ). By the formula given on page 361 of my note on Jacobi's algorithm (loc. cit.), we have for the last three convergent sets of this fraction :

i 9 3i.] TERNARY CONTINUED FRACTIONS 567 (Cn_2, pcn-2 + ^n-2, qcn-2 + ^n-2), pcn 1 ~T" An \, qcn l (C», pcn + An, C n ' + Bn ). From the hypothesis that Af = ikf' we have (2) ^4 W -2 + B n -\ + C n = A n -2 + -B n _l + C n, and we wish to show that ^4 n _l + B n + gc w + pcn-l + C n _2 = ^n-1 + ^n + Cn + 1 = C n -2 + pcn-l + -4n~l + ^Cn + -#n Replacing and q by their values from (1), we have (3) A n - X + B n + C n _ 2 + (7/ + B)C n + (at + 0)C w _i = il '_l + B n ' + C n '_ 2 + (7/ + 8)C n ; + (<** + j3)c '-i. If this equation is to hold for all values of /, we should have, equating coefficients of t, (4) yc n + OiCn-l = jcn + acn'-l. We now assume this equation to hold and proceed as before to «+ 1. In the resulting equation the coefficient of / vanishes by virtue of equation (4). The terms independent of / must satisfy the equation (5) acn + yiôcn + PCn^ + Cn-t) = 7«C» + OÔCn'-l + 7*»' + '-!. This equation we also assume to be true for the values of n in question, and on proceeding to n + 1 we find the coefficients of / vanish by virtue of (5). The remaining terms reduce by (4) and (5) to the equation (6) ycn-i + acn-2 = y Al + a4 n '_i. On assuming this equation to hold and proceeding to the value n + 1 we obtain equation (4) again. Equations (4), (5) and (6) thus form a closed system. We return to equation (3) and equate the parts independent of t. The resulting equation, (7) A n -X + B n + C n -2 + hc n + pc n -l = An-l + Bn + Cn-2 + C» + 0C»_i,

568 D. N. LEHMER [August, we also assume to hold for all values of the index up to and including n. Proceeding to n + 1 we find that the coefficient of t vanishes by virtue of (5), while the terms independent of / yield the equation (8) A n + hb n + /3 n _! + n _ 2 + C n -1 + ô 2 C n + /3ôC w _i + ÔC _ 2 + /3C n =A n l +bb n ' + i 8^wL 1 +^n, -2+C n / _ 1 +ô 2 C n, +/3ôC tt '_ 1 +$C w '_ 1 +/3C w '. If we assume this equation and proceed to n + 1, we find that the resulting equations are found to be true by virtue of the preceding equations. Equations (4), (5), (6), (7), and (8) with equation (2) form then a closed system of equations, all of which may be verified for n = l, 2, 3,. Assuming them true for values of the index up to n, they therefore hold for values up to n + 1. They therefore hold in general. The corresponding discussion for the assumed equation N = N' leads to the following set of equations, where for shortness we write (Ai, Bj) for AiBj AjBii (9) (A n - h B n ) + G4 n _ 2, C n ) + (J5 n _x, C») = (An-1, Bn) + (An-2, Cn) + (Bn-1, Cn). (10) 7(4 1, C n ) + a{b n,cn-l) = Y^n-l, C n ' ) + *{BJi, C w '_i). (11) y(a n,cn-2) +a(c n,b n - 2 ) = (o«- 07) (^ n', Cn'-i) + 7(^-1, 5»') + «(Ai, B n f -l). (12) 7(^n-2, Cn-l) + a(c w _ 2, n _ X ) = 7(4»',5»'-i) + a(4 B '- 1,C»'). (13) (^n_ X, 5.) + (An-l, Cn-2) + (5 n, C n _ 2 ) + ô(a n -l, C») + 18(5», Cn-l) = (i4»'-l, *n') + (A n '-1, C w '_ 2 ) + (»', C»'_ 2 ) + «(i4 n '_i,c»') +/3W,C n '-_!). (14) (i4»,b _ 2 ) + (i4»,c»-i) + ô(b n,cn-l) + (B n -2,C n -l) + Ô(A nj Cn-2) + j8(^»-l, Cn- 2 ) = Un', S»'-*) + (i4 w ',C»'_i) + 5(^n, Cn-l) + (Bn-2, Cn-l) + Ô(^4 n ', C n '_ 2 ) + /3(4 W, _1,C W, _ 2 ). This is found to be a closed system of equations, and the assumption of any one is justified by the others. A simple trial verifies them for the values of n = 1, 2, 3. They are then true in general. We have then the following theorem.

W-I TERNARY CONTINUED FRACTIONS 569 THEOREM 1. In any periodic, ternary continued fraction the discriminating cubic is not changed when the order of the partial quotient pairs is inverted provided that the partial quotient pairs satisfy the equations pi = at + 0, qi = yt + ô, where a, /3, y and ô are any fixed integers, positive, negative or zero, and the parameter t also takes any integer values positive, negative or zero. As an interesting special case we may take a: or 7 equal to zero. Taking a = 3 = 0, 7 = 1, we get the following theorem. THEOREM 2. The discriminating cubic is not changed by inversion of order of the partial quotient sets in any periodic ternary continued fraction in which p is fixed while q takes any values, or q is fixed while p takes any values. Such continued fractions might be called linear, since the equation between p and q requires them to be the coordinates of points on a line. With some difficulty, due to the complicated algebra involved, we have shown that if in a quaternary continued fraction with periodic partial quotient sets (p, q, r) we have the equations pi = at + 0, qi = yt + ô, r- = X* + /1, where a, ]3, 7, S, X, JJL are fixed integers, positive, negative or zero, while the parameter t takes any integer values, positive, negative or zero, then the order of the partial quotient sets may be inverted without changing the discriminating quartic. A similar theorem seems to hold for fractions of higher order, but a general proof is lacking. THE UNIVERSITY OF CALIFORNIA