Molnár H., Sándor

English

EKE Repository of Publications

Acta Acad. Paed. Agriensis, Sectio Mathematicae 28 (2001) 21-26 A P P R O X I M A T I O N B Y Q U O T I E N T S OF T E R M S OF S E C O N D O R D E R L I N E A R R E C U R S I V E S E Q U E N C E S O F I N T E G E R S S á n d o r H . - M o l n á r ( B u d a p e s t , H u n g a r y ) A b s t r a c t . In the paper real quadratic algebraic numbers are approximated by the quotients of terms of appropriate second order recurrences of integers. AMS Classification N u m b e r : 11J68, 11B39 Keywords: Linear recurrences, approximation, quality of approximation. 1. I n t r o d u c t i o n Let G = G{A, B,Gq,G\) — {Gnj^ -o be a second order linear recursive sequence of rational integers defined by recursion Gn = AGn-1 + BGn-2 (n > 1) where A, B and the initial terms Go, Gi are fixed integers with restrictions AB 0, D — A2 + 4B ^ 0 and not both Go and G'i are zero. It is well-known that the terms of G can be written in form (1) GN = CIAn-bßn, where a and ß are the roots of the characteristic polynomial x2 — Ax — B of the sequence G and a = Gl~^ßoß, b = (see e. g. [7], p. 91). Throughout this paper we assume | a | > \ß\ and the sequence is non-degenerate, i. e. a/ß is not a root of unity and cib / 0. We may also suppose that Gn / 0 for n > 0 since in [1] it was proved that a non-degenerate sequence G has at most one zero term and after a movement of indices this condition can be fulfilled. In the case D = A2 + 4B > 0 the roots of the characteristic polynomial are real, \a\ > \ß\,(ß/a)n — 0 as n oo and so by (1) Hm % ± l - a follows [61. n—*oo u n In [2] and [3] the quality of the approximation of a by quotients G n + i / G n was considered. In [3] it was proved that if G is a non-degenerate second order linear recurrence with D > 0, and c and k are positive real numbers, then G'n + i a — G'n 1 < I GN I ^  22 S. H.-Molnár holds for infinitely many integer n if and only if (i) k < ko and c is arbitrary, (ii) or k = ko and c < Co, (iii) or k = ko, c = Co and B > 0, (iv) or k — ko, c = Co, B < 0 and b/a > 0, Gn < where k0 = 2 - and c0 - |a | f co-i |&r If D < 0 then a and ß are non real complex numbers with |a | = \ß\ and by (1) we have = • But \ß/a\ = 1, thus Hm does not even exist. The approximation of |tv| by rationals of the form |Gn- |- i /Gn | was considered e.g. in [3], [4] and [5]. In [3] it was proved that if G is a non-degenerate second order linear recurrence with D < 0 and initial values Go = 0, G'i = 1, then there exists a constant ci > 0, depending only on the sequence G, such that for infinitely many n. In this paper the root a of the characteristic polynom of the sequence G will not be approximated by the quotients Gn+\/Gn, but by Gn+i/Hn, where H is an appropriately chosen second order linear recursive sequence. We can always give a better approximation for |cv| if D < 0, and for a in the most cases if D > 0 as it was given by the authors in [3]. This can be achieved by the approximation of the numbers of the quadratic number field Q(a ) when D > 0. The theorems in [3] can only approximate quadratic algebraic integers. Since at least one real quadratic algebraic integer a can be found for any real quadratic algebraic number 7, such that 7 6 Q (a), our theorem can adequately approximate any irrational quadratic algebraic number, independently whether it is an algebraic integer or not. We are going to illustrate the above statement and its applicability to non-real complex quadratic algebraic numbers. 2. Resu l t We prove the following theorem: T h e o r e m . Let A and B be rational integers with the restrictions AB / 0 and D = A2+4B > 0 is not a perfect square. Denote by a and ß the roots of equation x2 — Ax — B = 0, where |c*| > \ß\. Let t - ~ + £ Q(a) with integers s, q > 0,p / 0 and r. Dehne the numbers k0 and Cq by k 0 _ 2 — log Iff 1 log H and CQ = y/D qsB h o - l 1 Approximation by quotients of terms of second order linear recursive 23 and let k and c be positive real numbers. Then with linear recurrences G(A, B, qr, psB) and H(A, B, 0, qsB) the inequality t -G n + 1 Hr < 1 c\Hn\k holds for infinitely many integer n if and only if (i) k < k0 and c is arbitrary, (ii) or k = ko and c < CQ. (Note that k0 > 0 since \B\ = \aß\ < a 2 . ) Corollary. Since t = 1- + ^c* is an irrational number, then G -'n + l Hr < cm holds with some c > 0 for infinitely many n if and only if \B\ = 1. 3. Examples 1st E x a m p l e , t = a is a real quadratic algebraic integer. Let G'(4,19, Go, Gi), where Gq,G\ G Z not both GO and G'i are zero. The characteristic equation is x2 — 4a; — 19 = 0 and a = (4 + \/92)/2. If approximation is done according to [3], the quality of approximation k0 = 2 - = 0.4634845713 .. . The equation 92 = A2 + 4B can be written in an infinite variety forms: . . . , 22 + 4 • 22, 42 + 4 • 19, G2 + 4 • 14, 82 + 4 • 7,102 - 4 • 2,122 - 4 • 13, . . . . Using IB\ of minimum value c*i = lo+^ioo-s = ß = Q e Q(ari), a = a x - 3 . G(10, - 2 , - 3 , - 2 ) , tf (10, - 2 , 0, - 2 ) and thus k0 = 2 - = 1,696248791... . 2nd E x a m p l e . / is a real quadratic non-algebraic integer. Let t be the root of larger absolute value of the equation 36x2 — 894x- -f 1399 = 0. The roots of x2 — 894a: + 36 • 1399 = x2 - 894a;+ 50364 = 0 are c*i and ß1. Since t = ^ a i , i.e. t G Q(»i ), we can approximate t. k0 = 2- ^ ^ L = 0, 3902074312 . . ., c0 = 0, 002251014 . . . . Since D = 8942-4-3G-1399 = 22-34-(432-4), s/D = 2-32 V ( 4 3 2 - 4)>ifc follows that t G Q(a) is also true for the root a of x2 — 43a; + 1 = 0. Indeed, t = | + c^v and thus G'(43, —1, 10, —3), i i (43, —1, 0, —6). If we approximate a by the quotients Gn+i/Hn) we get ko = 2, Co = 2, 386303511 . . ., and thus holds for infinitely many n. H n ^ cHl ^ H\ 24 S. H.-Molnár 3 r í E x a m p l e , t' is a non-real quadratic algebraic integer. - 3 + t V 3 1 Let t' = ai, where cvi is the root of x + Zx + 10 = 0,i. e.|c*i| = yiÖ. Since | a i | = yTÖ = 6+/36+* _ 3 | a i | ^ w h e r e Q i s a r o o t 0f x2 — 6a,* — 1 = 0 and |ai[ = a — 3. Calculating with the sequences G(6, 1, —3, 1) . This ^ ± 1 Hr, < 2VIOIÍ; and H(6,1, 0, 1), A,'o = 2 and c0 = \/40 and thus approximation is the best. Ath E x a m p l e , a is a complex, non-algebraic quadratic integer. Ax2 + 5x -f 6 = 0, |cvi| = - 5 - V 2 5 - 9 6 | 0 l | = ^24 _ 14+743+4. 4 — 0 0 1 = — 1, where a is root of the equation x2 - Ax - 2 = 0. A = A, B = 2, G'(4, 2, - 2 , 2) and # (4 ,2 ,0 ,4 ) , = 2 - = 1, 535669821 . . . , c0 = 0, 5573569115 . . . . Calculating with the sequences G*(4, 2, —1,1) and H*(4, 2, 0, 2), = = 2fc°-c0 = 1,615905915.. . . P roof of T h e o r e m . By (1) we can write Gn+i — a\an+1 — b\ßn+l and Hn = aan — bßn for any n > 0, where G1 — Goß psB — qrß psB — qra ai = ^— = „ — b l = a - ß a - ß ' qsB - 0ß qsB a = b = a - ß ' qsB a — ß a — /?' a — ß Suppose that for an integer n > 0 and the positive real numbers c and k we have (2) t -G 71+1 Hr < 1 c\Hr \k ' Substituting the explicit values of the terms of the sequences and using the equality (3) at — ci\Q — qsB (r P \ psB — qrß G 71 + 1 Hr t -a — ß \s q a . i a n + 1 - 6i/3n+1 - -1- - a - = 0, a - ß {at - aia)an - (bt - b1ß)ßr aan - bßn (bt - b t f ) ß  Hn aan - bßr follows. Approximation by quotients of terms of second order linear recursive 25 (4) Therefore using the equality a = b, inequality (2) can be written in the form Gn-(-1 1 > C I Hr t. - H n = c\Hn\k-1\(bt-b1ß)ßr k-1 — c lacv I I 1 — cl Ka = c | a | f c - 1 ( | a | f c - 1 | / ? | ) n | 6 í - 6 i / ? | \ßn\ \bt - biß\ k-l Since L < 1 and a • ß — — B, this inequality holds for infinitely many n only if | / ? |H f c _ 1 = \B\\a\k~2 < 1, that is if k < 2 - = k0 and in the case k = k0 we need 1 c < I a^o-^bt -By (3) and by a = b it follows that \bt - bxß\ = - bxß\ = \axa - bxß\ = |Gi| = \psB\. Therefore using the fact that a — ß = \/~D c < JD qsB ko-l \psB\ = Co Thus by (4) we obtain that (2) holds for infinitely many n if k < ko or k = ko and c < cq. (If ^ > 0 then for any sufficiently large n, else for any sufficiently large even n.) Refe rences [1] Kiss, P., Zero terms in second order linear recurrences, Math. Sern. Notes (Kobe Univ.), 7 (1979), 145-152. [2] Kiss, P., A Diophantine approximative property of the second order linear recurrences, Period. Math. Hungar., 11 (1980), 281-287. [3] Kiss, P. AND SINK A, Zs., On the ratios of the terms of second order linear recurrences, Period. Math. Hungar., 23 (1991), 139-143. [4] Kiss, P. AND TICÍIY, R. F., A discrepancy problem with applications to linear recurrences I., Proc. Japan Acad. 65, No. 5 (1989) 135-138. [5] Kiss, P. AND TICHY, R. F., A discrepancy problem with applications to linear recurrences I., Proc. Japan Acad. 65, No. 6 (1989), 191-194. 26 S. H.-Molnár [6] MÁTYÁS, F. , On the quotients of the elements of linear recursive sequences of second order, Mat. Lapok 27 (1976/79), 379-389. (In Hungarian) [7] NIVEN, I. AND ZUCKERMAN, H. S., An introduct ion to the theory of numbers, Wiley, New York, I960. S á n d o r H . - M o l n á r BGF. PSZFK. Department of Mathematics Buzogány str. 10. 1149 Budapest, Hungary 

Approximation by quotients of terms of second order linear recursive sequences of integers 21

http://publikacio.uni-eszterhazy.hu/3965/1/Molnar_H_21-26.pdf

Approximation by quotients of terms of second order linear recursive sequences of integers 21

Abstract

Similar works

Full text

Available Versions

EKE Repository of Publications