ON THE LINEAR DIFFERENCE EQUATION WHOSE SOLUTIONS ARE THE PRODUCTS OF SOLUTIONS OF TWO GIVEN LINEAR DIFFERENCE EQUATIONS

Similar documents
be a formal power series with h 0 = 1, v(h^) = \ and v(h n ) > 1 for n > 1. Define a n by

Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006

RANDOM FIBONACCI-TYPE SEQUENCES

-P" -p. and V n = a n + ft\ (1.2)

Math 61CM - Solutions to homework 2

Additional Practice Lessons 2.02 and 2.03

More Hodge-Podge Pseudoprimes

SOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS

Markov Chains, Stochastic Processes, and Matrix Decompositions

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.

Covariance and Correlation

3.2 Gaussian Elimination (and triangular matrices)

Math 412: Number Theory Lecture 3: Prime Decomposition of

SCORE BOOSTER JAMB PREPARATION SERIES II

The matrix will only be consistent if the last entry of row three is 0, meaning 2b 3 + b 2 b 1 = 0.

Perfect numbers among polynomial values

[POLS 8500] Review of Linear Algebra, Probability and Information Theory

On the Pell Polynomials

DISCUSSION CLASS OF DAX IS ON 22ND MARCH, TIME : 9-12 BRING ALL YOUR DOUBTS [STRAIGHT OBJECTIVE TYPE]

Chapter 7 Polynomial Functions. Factoring Review. We will talk about 3 Types: ALWAYS FACTOR OUT FIRST! Ex 2: Factor x x + 64

Which one of the following is the solution to the equation? 1) 4(x - 2) + 6 = 2x ) A) x = 5 B) x = -6 C) x = -5 D) x = 6

Congruences for algebraic sequences

1 Introduction. 2 Determining what the J i blocks look like. December 6, 2006

ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E.WHITNEY Lock Haven State College, Lock Haven, Pennsylvania

Course 2316 Sample Paper 1

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

Arithmetic properties of lacunary sums of binomial coefficients

ADVANCED PROBLEMS AND SOLUTIONS

GENERATING FUNCTIONS OF CENTRAL VALUES IN GENERALIZED PASCAL TRIANGLES. CLAUDIA SMITH and VERNER E. HOGGATT, JR.

1 - Systems of Linear Equations

arithmetic properties of weighted catalan numbers

ON ADDITIVE PARTITIONS OF SETS OF POSITIVE INTEGERS

Over the Integers A PROJECT SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA. Brittany Fanning

Congruences for combinatorial sequences

RECENT RESULTS ON LINEAR RECURRENCE SEQUENCES

Disjunction/Conjunction Normal Form

252 P. ERDÖS [December sequence of integers then for some m, g(m) >_ 1. Theorem 1 would follow from u,(n) = 0(n/(logn) 1/2 ). THEOREM 2. u 2 <<(n) < c

Rigidity of Graphs and Frameworks

x(n + 1) = Ax(n) and y(n) = Cx(n) + 2v(n) and C = x(0) = ξ 1 ξ 2 Ex(0)x(0) = I

198 VOLUME 46/47, NUMBER 3

L U C A S SEQUENCES AND FUNCTIONS O F A 3-BY-3 M A T R I X

Legendre s Equation. PHYS Southern Illinois University. October 18, 2016

Math 113 Homework 5. Bowei Liu, Chao Li. Fall 2013

Math 0312 EXAM 2 Review Questions

Lights Out!: A Survey of Parity Domination in Grid Graphs

Solutions to Exercises, Section 2.4

Some new representation problems involving primes

Math 283 Spring 2013 Presentation Problems 4 Solutions

G H. Extended Unit Tests A L L. Higher Still Advanced Higher Mathematics. (more demanding tests covering all levels) Contents. 3 Extended Unit Tests

Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography

Unit 3 Factors & Products

FastTrack - MA109. Exponents and Review of Polynomials

EFFICIENT COMPUTATION OF TERMS OF LINEAR RECURRENCE SEQUENCES OF ANY ORDER

IRREDUCIBILITY OF CLASSICAL POLYNOMIALS AND THEIR GENERALIZATIONS

ON DIVISION ALGEBRAS*

Math Assignment 3 - Linear Algebra

Lucas sequences and infinite sums

Section Properties of Rational Expressions

Fundamentals of Engineering Analysis (650163)

Solution of Linear systems

ADDENDA TO GEOMETRY OF A GENERALIZED SIMSON'S FORMULA

Simplifying Rational Expressions and Functions

Minnesota State High School Mathematics League

Graphing Square Roots - Class Work Graph the following equations by hand. State the domain and range of each using interval notation.

October 28, S4.4 Theorems about Zeros of Polynomial Functions

Complex Hadamard matrices and 3-class association schemes

A RECIPROCAL SUM RELATED TO THE RIEMANN ζ FUNCTION. 1. Introduction. 1 n s, k 2 = n 1. k 3 = 2n(n 1),

Lecture 22: Section 4.7

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Russ Euler and Jawad Sadek

17 Advancement Operator Equations

The Riddle of Primes

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

MY PUTNAM PROBLEMS. log(1 + x) dx = π2

2 u Du, k Hu Dv Hu, y H. u Cu j u qu u. Nv. v uy. Cu Hu F A H. qu Cu.. Cu j 1980, u V, v Nu My O k. v u u. A G C. My u v k, 2.5 H v v u / u v u v k y

1 Finite abelian groups

ADVANCED PROBLEMS AND SOLUTIONS

EXAMPLES OF PROOFS BY INDUCTION

Normal Forms Note: all ppts about normal forms are skipped.

Math 554 Qualifying Exam. You may use any theorems from the textbook. Any other claims must be proved in details.

Course Notes. Part IV. Probabilistic Combinatorics. Algorithms

Sums of fourth powers of Fibonacci and Lucas numbers

ECS130 Scientific Computing. Lecture 1: Introduction. Monday, January 7, 10:00 10:50 am

Lecture 2: Divide and conquer and Dynamic programming

Exercise 2.2. Find (with proof) all rational points on the curve y = 2 x.

S-Y0 U-G0 CANDIDATES

Statements, Implication, Equivalence

A prolific construction of strongly regular graphs with the n-e.c. property

Sieving 2m-prime pairs

DIOPHANTINE REPRESENTATION OF LUCAS SEQUENCES. Wayne L, McDanlel University of Missouri-St. Louis, St. Louis, MO (Submitted June 1993)

MULTIVARIATE PROBABILITY DISTRIBUTIONS

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

CONVERGENT SEQUENCES IN SEQUENCE SPACES

UNIT 3 INTERSECTIONS OF LINES AND PLANES

Sums of Powers of Integers. Julien Doucet. and A. Saleh-Jahromi

Definition: A sequence is a function from a subset of the integers (usually either the set

are the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).

SOR201 Solutions to Examples 3

ON SECOND-ORDER LINEAR RECURRENCE SEQUENCES: WALL AND WYLER REVISITED

CONGRUUM PROBLEM. Manju Somanath 1 and J. Kannan 2. National College, Trichy - 01, India

O N P O S I T I V E N U M B E R S n F O R W H I C H Q(n) D I V I D E S F n

Transcription:

ON THE LINEAR DIFFERENCE EQUATION WHOSE SOLUTIONS ARE THE PRODUCTS OF SOLUTIONS OF TWO GIVEN LINEAR DIFFERENCE EQUATIONS MURRAY S. KLAMK1N Scientific Laboratory, Ford Motor Company, Dearborn, Michigan It was shown by Appell f l l that if u^ and u 2 denote two linearly independent solutions of D 2 + p(t)d + q(t)ly - 0 2 2 then u l5 u-ju 2 5 u 2 denote three linearly independent solutions of the third-order linear differential equation <D 3 + 3pD 2 + (2p 2 + p f + 4q)D + (4pq + 2q T )ly = 0. Watson [2l shows that if <D 2 + iiy = 0, D 2 + j l w = 0, then y = vw satisfies the fourth-order differential equation D j ^ - 2 ( i + j)y + (r + J0y j = _ (I _ JJ ( I ^ m Bellman [3] gives a matrix method for obtaining Appell 1 s result and notes that the method can be used to find the linear differential equation of order mn whose solutions are the products of the solutions of a linear differential equation of order m and one of order n. We now obtain analogous results for linear difference equations, Let <A > and <B > denote sequences defined by the second-order linear difference equations (1) A ^ = P A + Q A A, x ' n+i n n ^n n-i (2) B ± = R B + S B. n+i n n n n-l 86

0 N T H E L I N E A Nov IQfiR DIFFERENCE EQUATION WHOSE SOLUTIONS ARE THE PRODUCTS OF SOLUTIONS OF TWO GIVEN LINEAR ft7 DIFFERENCE EQUATIONS w h e r e A 0, A 1? B 0, B t a r e a r b i t r a r y and P,Q, R 5 S a r e given, If Mi and u 2, Vj and v 2 denote p a i r s of linearly independent solutions of (l)and(2), respectively 5 then we first obtain the t b i r d - o r d e r linear difference equation whose solution is given by kill? + kgujug + k 3 u 2 where the k. T s a r e constants. Squaring (1) and letting C = A, we obtain (3) C ^ = P 2 C + Q 2 C, + 2 P Q A A. n+l n n n n-l n n n n-i o r (4) C _, - P 2 C - Q? C 4 = 2 P Q A AP A + Q A J ' n+l n n n n - i n n n - i n - i n - l n - l n-2 = 2 P P Q C.+ 2 P Q Q A A o. n n - i n n-l n n n-i n - l n-2 By d e creasing the index n by 1 in (3),- we can eliminate A A to obtain (5) P,C ^ = P (P P + Q )C + P Q (P P + Q J C, n - l n+l n n n - l ^ n n n - i n n n - i n n - i - P Q Q 2 C n n n - i n-2 We now obtain the fourth-order equation whose solution is given by + kjui + k 2 uiu 2 + ksujuj + k 4 u 8 Cubing (1) and letting D = A 3, we obtain o kjuj (6) x D ^ - P 3 D - Q 3 D = 3P 2 Q A 2 A A + 3P Q 2 A A 2 ' n+l n n n n - i n*n n n - l n n n n - l = 3P 2 Q A 2 A + 3P Q 2 A 2 (P A, +Q^ A ) n n n n-l n n n - l n-l n-l n - l n-2 o r (7) D ^ - P 3 D - Q 2 ( 3 P P + Q )D = 3P 2 Q A 2 A 4 s n+l n n n ' n n - i n n - l n n n n - l + 3 P Q 2 Q A 2 A = ' 3 P 2 Q ' A (P A +Q A J 2 n * n *n-i n - l n-2 n*n n - i n - i n - l n - l n - 2 ' + 3P Q 2 Q A 2 A n n n - i n - l n-2

88 ON THE LINEAR DIFFERENCE EQUATION WHOSE SOLUTIONS ARE [Nov. or (8) D _ L, - P 3 D - Q (3P P O + 3P 2 P 2 + Q 2 )D n+1 n n n n n-i n n n-i n n-i = 3P Q Q (2P P +Q )A 2 A + 3P 2 Q Q 2 A 2 A '. n^n n-i n n-i ^n n-i n-2 n V ^ n - i n-2 n-i By reducing the index of n by 1 in (6), we can then solve (6) and (8) f o r A 2 A. Then by substituting this expression in (7), we can obtain the desired difference equation. To find the fourth-order equation satisfied by kiuivi + k 2 uiv 2 + k 3 U2V! + k 4 u 2 v 2, we multiply (1) by (2) and let E = A B, to give (9) E ^ - P R E - Q S E = P S A B + R Q B A 4 n+i n n n n n n-i n n n n-i n n n n-i = P S B (P A +Q A J n n n-i n-i n-i n-i n-2 or. + R Q A (R B / + & B J n n n-i n-i n-i n-1- n-3' (10) E _ L - P R E - ( P P S + R R Q + Q S ) E = P S Q B A 0 7 n+i n n n n n-i n n n-i n ^n n n-i n n n-i n-i n-2 or + R Q S A B = P S Q A (R B + S B ) n n n-i n-i n-2 n n n-i n-2 n-2 n-2 n-2 n-3 + R Q S B (P A +Q A J n n n-i n-2 n-2 n-2 n-2 n-3 (11) E, - P R E - - ( P P - S + R R Q + Q S )E 4 n+i n n n n n-i n n n-i n n n n-l - (P S Q R + R Q S P )E 0 n n*n-i n-2 n^n n-i n-2 n-2 = P Q S S A B + R S O Q B A n n-i n n-2 n-2 n-3 n n-l n n-2 n-2 n-3 By now reducing the index n by 2 in (9) and by 1 in (10), we can then eliminate A B n and B 0A from (9), (10), and (11), to obtain the desired differ n-2 n-3 n-2 n-3 ence equation.

1968] THE PRODUCTS OF SOLUTIONS OF TWO GIVEN LINEAR DIFFERENCE 89 EQUATIONS If here P, Q, R, S and the elimination is rather simple. are independent of n, the equations simplify This special case gives a solution to part (i) of proposed problem H-127 by M. N. S. Swamy (Fibonacci Quarterly, Feb., 1968, p. 51), i. e., "The Fibonacci polynomials are defined by f n+1 fe> = xf n (x), n > 2, fi(x) = 1 and f 2 (x) = x. If z = f (x)f (y), then show that (i) z satisfies the recurrence relation z, A - xyz J LO - (x 2 + Jy 2 + 2)z, - xyz J, + z = 0. n+4 n+3 n+2 n+i n fr We now extend Bellman f s matrix method, with little change, to difference equations. First we give an analogous lemma for difference equations. Lemma. Let Y and Z denote, respectively, the solutions of the matrix difference equations EY - A(n)Y, Y(0) = I, EZ = ZB(n), Z(0) = I, then the solution of EX = A(n)XB(n), X(0) = C, is given by X = YCZ. (Here EY(n) = Y(n + 1)). An immediate proof follows by substitution. We now apply this result to finding the third-order linear difference equations whose general solution is ciuf + 2c 2 U;]iU2 + C3UJ5 where uj and u 2 are linearly independent solutions of (12) < E 2 + p(n)e + q(n) U = 0.

90 ON THE LINEAR DIFFERENCE EQUATIONS WHOSE SOLUTIONS ARE [Nov. Without loss of generality, let u^ and u 2 be determined boundary conditions u i ] n = 0 =. 1, EUi] n =o = 0, u 2]n=o = > EU 2 ] n =o = 1 Setting Eu = v, (12) is equivalent to Eu Ev v, -pv - qu If we now let A(n) = 0 1 -q(n) -p(n) The matrix solution of Eu = A(n)U, U(0) = I, is given by U = Uj(n) Euj(n) u 2 (n) Eu 2 (n) and the solution of EV = VA(n), V(0) = I, by V = U, the transpose of U. From our lemma, the solution of (13) EX = AXA, X(0) = C, is given by X = UCU. Taking C to be the symmetric matrix

1968] THE PRODUCTS OF SOLUTIONS OF TWO GIVEN LINEAR 91 DIFFERENCE EQUATIONS c l II C 2 c 2 c 3 we see that X is given by X = II X l II X 2 X 2 II X 3 II where 2 2 Xi = CjUi + 2c 2 UiU2 + C3U2, X 2 = C-iU-iEUi + C2(UjEU2 + ^ E U j ) + C3U2EU2, x 3 = c{en\ + 2c 2 (Eu 1 )(Eu 2 ) + C3EU2. Equation (13) can be written as Exj_ EX21 Ex 2 Ex 3 = 0 1 1 -q -p i- j * l x 2 1 x 2 ^ 3 8 1 0 -q 1 -Pi and which is also equivalent to the system Exi = x 3, Ex 2 = qx 2 - px 3, Ex 3 = q 2 Xi + 2pqx 2 + p 2 X3. Eliminating x 2 and x 3, we obtain the third-order linear difference equation corresponding to (5). Similarly;, eliminating xj and x 2, we obtain the equation 2 2 whose general solutionis CJEUJ + 2c 2 (Eui)(Eu 2 ) + c 3 Eu 2 ; eliminating x t an4 X3? we obtain the equation whose general solution is CiUiEui + c 2 (uieu 2 + u 2 Eui) + C3U3EU3

ON THE LINEAR DIFFERENCE EQUATIONS WHOSE SOLUTIONS 92 ARE THE PRODUCTS OF SOLUTIONS OF TWO GIVEN LINEAR Nov 1968 DIFFERENCE EQUATIONS In stating our lemma, we ignored any discussion of the dimensionality of Y and Z. It is clear that the result is valid if A(n) and Y are r x r matrices, B(n) and z s x s matrices, and C and X r x s matrices. Using the same technique as before, but with much more computation, we can obtain the linear difference equation of order r s whose solutions are the products of order r and one of order s. REFERENCES 1. C. Appell, Comptes Rendus, XCI (1880), pp. 211-214. 2. G. N. Watson, Bessell Functions, MacMillan, N. Y., 1948, pp. 145-146. 3. R. Bellman, n On the Linear Differential Equations whose Solutions are the Products of Solutions of Two Given Linear Differential Equations," Boll. Un. Mat. Ital. (3) 12 (1957), pp. 12-15. * * * * * (continued from p. 85.) 4. REMARKS Generalizing these famous conjectures leads to a multitude of conjectures in the Gaussian Integers. Some such as the infinitude of twin primes appears easier to settle and some such as the quadruples of primes seem less attainable than the real case does. See p. 80 for a First Quadrant Graph of Gaussian Primes. 5. REFERENCES 1. J. H. Jordan and C. J. Potratz, "Complete Residue Systems in the Gaussian Integers," Mathematics Magazine, Vol. 38, No. 1, pp. 1-12 (1965). * * * * *