Fibonacci type sequences and integer multiples of periodic continued fractions

: We construct a class of quadratic irrationals having continued fractions of period n ≥ 2 with ‘small’ partial quotients for which specific integer multiples have periodic continued fractions with the length of the period being 1, 2 or 4, and with ’large’ partial quotients. We then show that numbers in the period of the new continued fraction are functions of the numbers in the periods of the original continued fraction. We also show how polynomials arising from generalizations of these continued fractions are related to Chebyshev and Fibonacci polynomials and, in some cases, have hyperbolic root distribution.


Introduction
L et [a 0 , a 1 , a 2 , . . . ] be a simple continued fraction expansion of a real number α where a j 's are positive integers. If α is a quadratic irrational, then by a theorem of Lagrange [1, p. 44] its continued fraction will be periodic, i.e., α = [a 0 , a 1 , . . . , a k , b 1 , b 2 , . . . , b n ], where b 1 , b 2 , . . . , b n is the period of the expansion of α, and a 0 , a 1 , . . . , a k is the non-periodic part. We say that α is of period k if its periodic part has length k.
If α is a quadratic irrational, then for any positive integer N, Nα is a quadratic irrational and has a periodic continuous fraction. Cusick [2] presents an algorithm for obtaining the continued fraction of Nα and uses it to estimate the length of the period of the expansion of Nα to that of α. In this paper, we construct a quadratic irrational α such that when N is a Fibonacci or Lucas number, the continued fraction of Nα has a period of length 1, 2 or 4. As we shall see, the length of the period of the new continued fraction depends on the parity of n, the length of the period of the original continued fraction.
Fibonacci numbers and Lucas numbers are integers that solve the recurrence relation under the initial conditions F 0 = 0, F 1 = F 2 = 1, L 0 = 2 and L 1 = 1 respectively. Fibonacci polynomials, which are generated by the rational function also define the Fibonacci numbers when x = 1. In §2, we construct Fibonacci-like numbersF n (m) and use them to construct α n , the largest zero of the quadratic where N is a positive integer. We then show the relationship between the continued fraction of α n and F n · [2N, 1 (n−1) ] , where 1 (n) is the sequence 1, 1, 1, . . . , 1 with 1 repeated n times. In §3, we construct Lucas-like numbersL n (m) and use them to construct β n , the largest zero of the quadratic where N = 5k + 3 is a positive integer. We then show the relationship between the continued fraction of β n and the purely periodic continued fraction L n · [2N, 1 (n−2) , 2, 1, 2k, 1, 2, 1 (n−2) ].
In §4, we generalize these continued fractions, as well as results of §2. Polynomials arising from convergents of the generalized continued fractions are studied in §5. In particular, we show how these polynomials relate to Fibonacci and Chebyshev polynomials and show that some of them have their roots in hyperbolas. Contents of this paper are a summary of results in the dissertation [3].

Fibonacci-like numbers and quadratic irrationals
Let m be a positive integer and define the sequenceF n (m) by the recurrence relatioñ under the initial conditionsF 0 (m) = 0,F 1 (m) = 1 andF 2 (m) = m. Using (1) together with the recurrence (2), Clearly, when m = 1 we get the usual Fibonacci sequence. From the generating function (3), and the generating function of Fibonacci numbers, we get the relatioñ Now consider the quadratic with the zeros Continued fractions of the zeros (5) have some interesting properties which we explore in this paper. A quadratic irrational α is said to be reduced if α > 1 and −1/α > 1. If α is reduced, then its continued fraction is purely periodic [1,Theorem 2.48]. First we show that when n odd, On the other hand,F n+1 (2N) − α n (N) = NF n + F n−1 + B n (N) > 1.
We have used (4) and the well known identity for Fibonacci numbers Let x n (N) = NF n + F n−1 + B n (N). Using (4), and the Euclidean algorithm we get and together with (6) gives When n even, and using the identity (7).
We also have thatF Now let x n (N) = 1/(1 − (NF n + F n−1 − B n (N))), then This implies that when n even, In each case, the length of the period in the continued fraction expansion of α n (N) is independent of n. We have proved Theorem 1. Let α n (N) be the largest zero of the quadratic x 2 − 2NF n x − F nFn (2N) and N > 1 be a positive integer, then the continued fraction of α n (N) is given by when n is odd, and when n even the continued fraction is given by We now show the relationship between the continued fraction of α n (N) and F n · [2N, 1 (n−1) ]. Let α have the simple continued fraction where p 0 = a 0 = ⌊α⌋, p −1 = 1, q 0 = 1 and q −1 = 0. We will use the correspondence [1, Lemma 2.8] c 0 1 1 0 Taking the determinant on both sides of (9) gives the identity Also, taking the transpose of the matrices on both sides of (9) we get c k 1 1 0 Lemma 1. For all n ≥ 2, and m ≥ 1 we have the continued fraction, and for n ≥ 3 we have the continued fractionF where 1 (n) = 1, 1, . . . , 1 n times.
Proof. It can easily show by induction on k that for all k ≥ 1, It follows that 1 1 1 0 where we have used (4). It follows by (8), and the correspondence ( . We can observe that all the partial quotients of [1 (n) , m] are bounded, and for j ≤ n, its sequence of convergents {p j /q j } is the same as the sequence of convergents for the continued fraction of F n+1 /F n , which converges to the golden ratio. By comparison, for any positive integer m,F n+1 (m)/F n (m) also converges to the golden ration.
We now show another interesting property of the continued fraction of α n (N).
where the 1 (n) means that 1 has been repeated n times, and F n is the nth Fibonacci number. Then λ n (N) is an algebraic integer, and when n is odd while when n is even One way of approaching this question is by the use of Chatelet algorithm for integer multiples of a continued fraction described by Cusick [2] in order to get the continued fraction of λ n (N). This approach is tedious and very involving. We will employ a rather straightforward approach by using the correspondence (9). Let x = [2N, 1 (n−1) ] and recall that where [2N, 1 (n−1) ] = p n q n . By the correspondence (9), and hence Clearly x is the largest zero of the quadratic and is given by Both x and λ n (N) = F n x are algebraic integers. We also have that F n x = α n (N), and its continued fraction has been described in theorem 1.

Lucas-like numbers and quadratic irrationals
Let m be a positive integer and define the Lucas-like sequenceL n (m) bỹ whereL n (1) is the Lucas sequence. The numbersL n (m) solves the recurrence relatioñ For a fixed positive integer N, consider the quadratic The zeros of the quadratic are given by Just like in the previous section, we are going to examine the continued fractions of these quadratic irrationals. We will use the well known identity as well as identities that relate the Fibonacci sequence to the Lucas sequence and First we show that when n is even, 1/(β n (N) −L n+1 (2N)) is reduced. Let C n (N) = N 2 L 2 n + L nLn (2N), Where we have used (13). On the other hand, L n+1 (2N) − β n (N) = NL n + L n−1 + C n (N) > 1.
It can also be shown that .
It is easy to show (by induction on n) that 0 < 1 5 5 − NL n − L n−1 + C n (N) < 1. Now, 1 1 5 5 − NL n − L n−1 + C n (N) . This implies that when n is odd, We can also make the simplification in the two statements above. We have proved the following result: Theorem 3. Let N = 5k + 3 for k ≥ 0, and β n (k) be the largest zero of the quadratic x 2 − 2NL n x − L nLn (2N), then the continued fraction of β n (k) is given by when n is odd, and is given by when n is even.
There are some purely periodic continued fractions with periods of arbitrary length which when multiplied by L n , give periodic continued fractions with period of length 2 or 4 depending on the parity of n. We give some of these continued fractions below. where the 1 (n) means that 1 has been repeated n times, and L n is the nth Lucas number. Then µ n (k) is an algebraic integer, and when n is odd while when n is even it is given by Proof. Fix N = 5k + 3 and let y = [2N, 1 (n−2) , 2, 1, 2k, 1, 2, 1 (n−2) ].

Generalizations
We now examine the continued fraction of G k (N, x) defined by where x ≥ 1, x (k) = x, x, . . . , x repeated k times and n is a non-zero positive integer.
. It can easily be shown by induction on k that from which we get 2N 1 1 0 This implies that is the largest zero of the quadratic and is given byG We can now write As we will see below, the continued fraction of G k (N, x) depends on the parity of k because of the identity To simplify the notation, let . We first examine the continued fraction of G k (N, x) for k odd. For all k ≥ 1 and x ≥ 1, we have by (18) that β k (N, x) = (NF k (x) + F k−1 (x)) 2 + 1 so that Denote this by G .
Hence the continued fraction of G (1) k (N, x) is purely periodic with period of length 1 given by {2NF k (x) + 2F k−1 (x)}. For all k > 1 odd, the continued fraction of G k (N, x) is given by, Now for the case when k > 1 is even, by identity (18), β k (N, x) = (NF k (x) + F k−1 (x)) 2 − 1 so that Denote this by G (2) k (N, x) so that 1/G (2) .
We can now see that 1/G (2) k (N, x) is purely periodic with a period of length 2 given by {1, 2NF k (x) + 2F k−1 (x) − 2}. For all k > 1 even, the continued fraction of G k (N, x) is given by, We have proved the following result: Theorem 5. For all k ≥ 1 and x ≥ 1, the product of the kth Fibonacci polynomial F k (x) and the periodic continued fraction [2N, x (k−1) ] gives the periodic continued fraction when k is even.
If we set x = 1 in the above theorem, we get the result of Theorem 2.

Polynomials from convergents of [N, x (k) ]
In this section, we show how polynomials arising from the convergents of [N, x (k) ] are related to Chebyshev and Fibonacci polynomials. We describe the polynomials for k = 1, 2 and 3 and show how the roots of these polynomials are distributed.
To determine the roots of q k (x), first note that U n (x) has all its roots in the interval (−1, 1) given by x k = cos k n+1 π [4, section 2.2]. It follows that q 2n+1 (N, x) has real roots in the interval (−4/N, 0] and are given by x k = 2 N cos k n+1 π − 1 . It can also be shown that q 2n (N, x) has n − 1 real roots in the interval (−4/N, 0] and one real root outside this interval. Now for the case when k = 2, let p n (N, x)/q n (N, x) be the convergents of [N, x, x]. When n ≡ (0 mod 3) and n ≡ (1 mod 3), q 3n (N, x) and q 3n+1 (N, x) are respectively generated by the rational functions and their zeros seem to lie close to the hyperbola y 2 − x 2 = 1 − 1/N 2 . Let p n (N, x)/q n (N, x) be the convergents of [N, x, x]. When n ≡ (2 mod 3), q n (N, x) are generated by the rational function and have a factor of x 2 + 1. By eliminating this factor and making a change of variable x → x − 1/N we get (after clearing denominators) polynomials Q n (N, x) that are generated by This shifting of the polynomial reduces the number of terms as can be seen in the generating function above. Comparing this generating function to that of the Fibonacci polynomials (1), we have

Theorem 6.
For any non-zero k ∈ R, let Q n (N, x) be as defined in equation (22). Then for all n ≥ 1, all the zeros Q n (N, x) lie on the hyperbola Proof. Bicknell and Hoggatt [5] proved that if F n (x) = 0 then x = 2i cos(jπ/n) for j = 1, 2, . . . , n − 1. Let where 0 < N. Then where θ j = jπ/(n + 1) for j = 1, 2, . . . , n − 1. Using the identity in which we consider the principal branch of the log, we get The 2n zeros of Q n (N, z) are now given by for j = 1, 2, . . . , n − 1 where ϕ j is given by (24). It is straightforward to check that all these points lie on H1.
Numerical calculations suggest that polynomials generated by the rational functions (22) have their roots close to H1.
Polynomials arising from the convergents of [N, x (k) ] seem to get more complicated as k gets larger. For an example, let k = 3, and p n (N, x)/q n (N, x) be the convergents of [N, x, x, x] then q 4n+3 (N, x) are generated by x(x 2 + 2) 1 − (Nx 3 + 2x 2 + 2Nx + 2)t + t 2 . Now for k = 4, q 5n+4 (N, x) are generated by In general, for a fixed k, let q n (N, x) be the denominator of the convergents of [N, x (k) ] when n ≡ −1 mod (k + 1). To simplify the notation, denote them by Q m (x). Then Q m (x) are generated by where g k (N, x) are generated by the rational function By (1), we get the explicit expression for g k (N, x) as We can apply a theorem of Khang Tran [6,Theorem 1], to determine the curve on which the roots of Q m (N, x) lie. As k increases however, so does the difficulty in describing this curve. As an example, for k = 4 the roots of Q m (3, x)/F 5 (x) lie on the curve given by 3x 4 − 18x 2 y 2 + 3y 4 + 2x 3 − 6xy 2 + 9x 2 − 9y 2 + 4x + 3 = 0.
The relationship to Fibonacci and Chebyshev polynomials of the second kind follows from the generating function (26). For a fixed k that is even, Q n (N, x) = F k+1 (x)F n (g k (N, x)), while for a fixed k that is odd, Q n (N, x) = F k+1 (x)U n (g k (N, x)).

Conclusion
In conclusion, we pose a question. Are there any other integer sequences f n such thatf n+1 (m) := m f n + f n−1 , and for which the continued fraction of 1 f n N f n + N 2 f 2 n + f nfn (2N) is purely periodic with length of the period depending on n. And the continued fraction of N f n + N 2 f 2 n + f nfn (2N) is periodic with a fixed period length independent of n?