The Fibonacci sequence modulo π, chaos and some rational recursive equations

Size: px
Start display at page:

Download "The Fibonacci sequence modulo π, chaos and some rational recursive equations"

Transcription

1 J. Math. Anal. Appl. 310 (2005) The Fibonacci sequence modulo π chaos and some rational recursive equations Mohamed Ben H. Rhouma Department of Mathematics and Statistics Sultan Qaboos University PO Box 36 P.C. 123 Al-khod Muscat Oman Received 29 January 2005 Available online 25 March 2005 Submitted by G. Ladas Abstract In this paper we provide the closed form solution to the inter-related equations y n+2 = y ny n+1 1 and z n+2 = (z n+1 + z n ) mod π. y n + y n+1 Both of these equations were suggested as open problems in the book by Kocic and Ladas [V.L. Kocic G. Ladas Global Behavior of Nonlinear Difference Equations of High Order with Applications Kluwer Academic Dordrecht 1993]. We also give the closed form solution to the equations x n+1 = x nx n 2 + a and x n+1 = x n 1x n 2 + a x n + x n 2 x n 1 + x n 2 studied by X. Li and D. Zhu [X. Li D. Zhu Two rational recursive sequences Comput. Math. Appl. 47 (2004) ] Elsevier Inc. All rights reserved. Keywords: Difference equations; Attractivity; Stability; Rational recursive sequences; Fibonacci sequence; Chaos address: rhouma@squ.edu.om X/$ see front matter 2005 Elsevier Inc. All rights reserved. doi: /j.jmaa

2 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) Introduction Rational recursive sequences have been the focus of extensive research especially since the appearance of the monograph by Kocic and Ladas [4]. The more recent monograph by Kulenovic and Ladas [5] is exclusively dedicated to rational recursive equations and contains a long list of open problems and conjectures. The following open problem was suggested in [4]. Open Problem [ p. 175]. The secant method for finding 1: Study the asymptotic behavior and the periodic nature of solutions of the difference equation y n+2 = y ny n+1 1 n= (1) y n + y n+1 where y 0 and y 1 are arbitrary numbers such that y n exists for all n. The change of variables y n = cot z n leads to the equation cot z n+2 = cot z n cot z n+1 1 cot z n + cot z n+1 and so if the values of z n are restricted to the interval (0π) we obtain the Fibonacci sequence modulo π namely z n+2 = (z n + z n+1 ) mod π. (2) The study of this equation is also listed in [4] as: Open Problem [ p. 175]. The Fibonacci sequence modulo π: Assume z 0 and z 1 are arbitrary numbers in (0π). Study the asymptotic behavior and the periodic character of solutions of the difference equation (2). As explained in [4] a possible derivation of Eq. (1) comes from using Newton s method for solving the equation f(x)= x = 0 with the sequence x n+1 = x n f(x n) f (x n ) and replacing the derivative f (x n ) by the approximation f(x n ) f(x n 1 ). x n x n 1 Actually the intersection between Fibonacci numbers and Newton s method is not restricted to this example. In fact Gill and Miller [3] produced the subsequence {F 2 n +1/F 2 n} using Newton s method to solve the equation x 2 x 1 = 0 with initial approximation x 0 = 1. In the same note [3] they also proved that the secant method with initial approximations x 0 = 1 and x 1 = 2 produces the sequence {F Fn +1/F Fn }. A more recent paper [9] also extended some old results [1] about (±1) n /(F n F n+1 ) also using Newton s method. Recently Li and Zhu [6] have studied similar looking equations namely

3 508 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) x n+3 = a + x n+2x n x n+2 + x n n= (3) x n+3 = a + x n+1x n x n+1 + x n n= (4) where a [0 ) and the initial conditions x 0 x 1 and x 2 are positive. For both Eqs. (3) and (4) it was found that the positive equilibrium of the equation is globally asymptotically stable. In a recent paper [2] we have obtained closed form solutions for several equations some of which having similar numerators and denominators to those of recursions (1) (3) and (4). In particular the solutions to the following equations x n+2 = x n+1x n + 1 x n+1 + x n (5) x n+2 = x n+1x n 1 x n+1 x n (6) x n+2 = x n+1x n 1 x n+1 x n (7) x n+2 = x n+1x n + x n x n+1 x n (8) x n+2 = x n+1 x n x n+1 x n + 1 (9) x n+2 = x n+1 x n x n+1 x n + 1 (10) as well as their good sets were given explicitly. For example when [( ) x0 1 Fn 2 ( ) x1 + 1 Fn 1 ] ( 1) n 1 n 1 x x 1 1 and (x 0 x 1 )(x0 2 1)(x2 1 1) 0 solutions to (6) exist and are given by x n = 1 + [( x 0 1) Fn 2 ( x1 +1) Fn 1 ] ( 1) n x 0 +1 x [( x 0 1) Fn 2 ( x1 +1) Fn 1 ] ( 1) n (11) x 0 +1 x 1 1 where F n denote the nth term in the Fibonacci sequence. On the other hand all solutions to (5) are periodic of prime period 3 while all solutions to (7) are periodic of prime period 6. In this paper we provide: (1) The closed form solutions to Eqs. (1) (3) and (4) as well as their asymptotic behavior. (2) Results related to Eq. (2) from our discussion of the solution to Eq. (1). In particular we establish that the Fibonacci sequence modulo π is chaotic and give the exact number of periodic points of period p. (3) A new set of solvable rational recursive equations.

4 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) The rest of the paper is organized as follows: in the next section we provide a few preliminary lemmas. In Section 3 we find and discuss the closed form solution of Eq. (1) along with results and comments about (2). In Section 4 we give the closed form solution to both (3) and (4) and explain why their solutions always converge to a fixed value. Finally a few generalizations are made in Section Preliminary results We begin with the following elementary lemma. Lemma 1. Let b x y and z be arbitrary complex numbers such that b(x + y)(x + b)(y + b) 0. If then z b z + b = ( x b x + b )( ) y b (12) y + b z = xy + b2 x + y. (13) The following lemmas give the solution to a few nonlinear sequences of the form x n+1 = αx p n k xq n l. Lemma 2. Let F n be the Fibonacci sequence defined by F 0 = F 1 = 1 and F n+2 = F n+1 + F n. The sequence x n+2 = αx n+1 x n with initial conditions x 0 and x 1 has the general form x n = α ( 1+F n) x F n 2 0 x F n 1 1 for all integers n 2. (14) The proof of Lemma 2 can be easily obtained by induction. Lemma 3. Let λ 1 λ 2 and λ 2 be the roots of the polynomial λ 3 λ 1 = 0 and (abc)be the solution to the linear system (15) a + b + c = 0 aλ 1 + bλ 2 + c λ 2 = 1 aλ bλ2 2 + c λ 2 2 = 0. (16) Then the sequence x n+3 = x n+1 x n with the initial conditions x 0 x 1 and x 2 has the general form x n = x A n 2 0 x A n 1 xa n 1 2 (17)

5 510 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) where A n is given by A n = aλ n 1 + bλn 2 + c λ n 2. (18) Proof. It is easy to establish that given initial conditions x 0 x 1 and x 2 the general term of x n can be written in the form x n = x C n 0 xa n 1 xb n 2 where A n B n C n satisfy the linear recursion Y n+3 = Y n+1 + Y n. Moreover C 0 = B 2 = A 1 = 1 and C 1 = C 2 = B 0 = B 1 = A 0 = A 2 = 0. The values of λ 1 λ 2 and λ 2 are the roots the polynomial λ 3 λ 1 = 0 which is the characteristic polynomial of (19). The rest of the proof follows from straightforward computations. Lemma 4. Let µ 1 µ 2 and µ 2 be the roots of the polynomial (19) µ 3 µ 2 1 = 0 and let (abc)be the solution to the linear system (20) a + b + c = 0 aµ 1 + bµ 2 + c µ 2 = 0 aµ bµ2 2 + c µ2 2 = 1. (21) Then the sequence x n+3 = x n+2 x n with the initial conditions x 0 x 1 and x 2 has the general form x n = x B n 1 0 x B n 2 1 x B n 2 (22) where B n is given by B n = aµ n 1 + bµn 2 + c µn 2. (23) The proof of Lemma 4 is identical to that of Lemma 3 and thus will be omitted. 3. Equation (1) and the Fibonacci sequence mod π First notice that by Lemma 1 a solution to (1) also satisfies the equation ( )( ) y n+2 i y n+2 + i = yn+1 i yn i. (24) y n+1 + i y n + i By virtue of Lemma 2 we obtain that y n i y n + i = ( y0 i y 0 + i ) Fn 2 ( y1 i y 1 + i ) Fn 1.

6 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) Thus setting up e iθ 0 = y 0 i y 0 + i and e iθ 1 = y 1 i y 1 + i (25) or equivalently θ 0 = 2arccot y 0 and θ 1 = 2arccot y 1 (26) we have y n i y n + i = ei(f n 2θ 0 +F n 1 θ 1 ) and y n = i 1 + ei(f n 2θ 0 +F n 1 θ 1 ) 1 e i(f n 2θ 0 +F n 1 θ 1 ). (27) Theorem 1. The solution to Eq. (1) exists for all integers n 0 if and only if (F n 2 θ 0 + F n 1 θ 1 ) mod 2π 0 for all n 0. (28) Moreover when it exists the solution to (1) is given by ( ) Fn 2 θ 0 + F n 1 θ 1 y n = cot 2 = cot(f n 2 arccoty 0 + F n 1 arccoty 1 ). (29) In addition (i) If θ 0 and θ 1 are both rational multiples of π then either {y n } diverges in finitely many steps or y n is periodic. (ii) If θ 0 is a rational multiple of π and θ 1 is not (or vice-versa) then {y n } is aperiodic and does exist for all integers. Proof. Both (28) and (29) follow straight from (27). On the other hand if θ 0 = (m 0 π/n 0 ) and θ 1 = (m 1 π/n 1 ) then studying the sequence (F n 2 θ 0 + F n 1 θ 1 ) mod 2π is equivalent to studying the sequence G n = (m 0 n 1 F n 2 + m 1 n 0 F n 1 ) mod 2n 0 n 1 (30) which is bound to be periodic. (See for example [7] and references therein.) If G n contains zero then the sequence {y n } will diverge. Otherwise the sequence {y n } will be periodic. To illustrate item (i) of Theorem 1 the initial values y 0 = and y 1 = 0 do correspond to values of θ 0 and θ 1 that are rational multiples of π and yield a periodic sequence of prime period 12. On the other hand when y 0 = 0 and y 1 = 3

7 512 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) the sequence {y n } only exist for n 7. Consider now T π the square with corners (0 0) (0π) (π π) and (π 0) in the plane and the matrix A = ( ). Using the definitions and results of [8 Chapter 5] we have that the matrix A induces a hyperbolic Anosov toral automorphism defined on T π namely the map L A : T π T π defined by L A (x y) = (y x + y mod π). (32) The following relation between the nth power of the matrix A and the Fibonacci sequence is well known: ( ) A n Fn 2 F = n 1. F n 1 F n Also known is the fact that the matrix A 2 induces the cat map one of the simplest examples of chaos in two dimensions. Perhaps less known is that the map L A induced by the matrix A is itself chaotic. The following theorem is just a translation of the fact that L A is chaotic in terms of the Fibonacci sequence mod π. Theorem 2. (i) The set of periodic points of the Fibonacci sequence modulo π is dense in T π. Moreover for any given integer n 1 the number of n-periodic points on the Torus T π is given by (31) F n 2 + F n 1 + ( 1) n 1. (33) (ii) Given any two open neighborhoods U and V in T π there exist initial conditions (z 0 z 1 ) U and an integer n 0 such that the nth iterate (z n z n+1 ) of the Fibonacci sequence modulo π belongs to the set V. Proof. Items (i) and (ii) are simply the density of periodic points and the transitivity properties of chaotic systems. As for the number of periodic solutions of period n it can be obtained by solving the equation A n (z 0 z 1 ) T = (z 0 z 1 ) T mod π and using the identity F 2 n F n 1F n+1 = ( 1) n. In terms of the sequence (1) Theorem 2 implies that if F and P are respectively the forbidden set and the set of initial conditions of periodic solutions of (1) then F P is dense in R 2. Theorem 2 also implies transitivity of the sequence (1) in R 2.

8 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) Equations of the form x n+1 = (x n k x n l + 1)/(x n k + x n l ) When a>0 and k and l are distinct nonnegative integers all recursions of the form y n+2 = y n k+1y n l+1 + a (34) y n k+1 + y n l+1 can be transformed to the equation x n+2 = x n k+1x n l (35) x n k+1 + x n l+1 by the change of variables y n = ax n. In this section we will present results for the case k = 0 and l = 1. With minor changes all results do apply to other cases. In particular Eqs. (3) and (4) studied in [6] can be treated in a very similar way. Consider the equation x n+2 = x nx n (36) x n + x n+1 By virtues of Lemmas 1 and 2 we have that ( ) ( ) xn 1 x0 1 Fn 2 ( ) x1 1 Fn 1 =. (37) x n + 1 x x Thus the expression of x n is easily obtainable whenever (x 0 1) F n 2 (x 1 1) F n 1 (x 0 + 1) F n 2 (x 1 + 1) F n 1 to yield the closed form x n = (x 0 + 1) F n 2(x 1 + 1) F n 1 + (x 0 1) F n 2(x 1 1) F n 1 (x 0 + 1) F n 2(x 1 + 1) F n 1 (x 0 1) F n 2(x 1 1) F. (38) n 1 Notice also that using Eq. (37) we can write x n 1 x n + 1 = x 0 1 F n 2 [ F n 1 ] x 1 1 F Fn 2 n 2 x x (39) Since the ratio F n 1 /F n 2 (1 + 5 )/2 asn we can conclude that if 1+ 5 x 0 1 x x x > 1 then the sequence {x n } 1. Similarly if 1+ 5 x 0 1 x x x < 1 then the sequence {x n } 1asn.

9 514 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) An immediate consequence of this fact is that if x 0 and x 1 are both positive then the sequence {x n } 1asn. A very similar explanation works for Eqs. (3) and (4). In fact the solutions to Eqs. (3) and (4) with a = 1 are respectively given by x n = 1 + ( x 0 1) An 2 ( x1 1) An ( x2 1) An 1 x 0 +1 x 1 +1 x ( x 0 1) An 2 ( x1 1) An ( x2 1) An 1 (40) x 0 +1 x 1 +1 x 2 +1 and x n = 1 + ( x 0 1) Bn 1 ( x1 1) Bn 2 ( x2 1) Bn x 0 +1 x 1 +1 x ( x 0 1) Bn 1 ( x1 1) Bn 2 ( x2 1) Bn (41) x 0 +1 x 1 +1 x 2 +1 where A n and B n are respectively given by Lemmas 3 and 4. Since Li and Zhu [6] considered positive initial conditions and that both sequences {A n } and {B n } converge to + as n we can easily see that {x n } 1 for both Eqs. (3) and (4). In fact in light of Eqs. (40) and (41) it is also easy to see that the sequence {x n } will converge to 1 for all initial conditions x 0 x 1 x 2 ( 0). Moreover obtaining the good sets of (40) and (41) and more detailed rules of convergence is done in a very similar way as for Eq. (36). The following theorem sums up the discussion of this section. Theorem 3. Let k>l>0 be two integers and consider Eq. (35) with initial conditions x 0 x 1...x k. There exist sequences {A (i) n } for i = 0...kall converging to as n such that ki=0 (x i + 1) A(i) n x n = ki=0 (x i + 1) A(i) n + k i=0 (x i 1) A(i) n k i=0 (x i 1) A(i) n (42) as long as the denominator in (42) does not vanish. Moreover if all initial conditions are positive then {x n } 1 and if all initial conditions are negative then {x n } Generalizations to other rational recursive equations In this section we illustrate how to obtain closed form solutions for some special rational recursive equations. To this purpose consider the equation x n+k+1 = α k i=0 x p i n+i n= (43) with initial conditions x 0 x 1...x k. For simplicity we will consider only integer powers p i. As in Lemmas 2 4 by computing the first few items of the sequence {x n } we can easily obtain the general form of the solution namely x n = α B n k i=0 x A(i) n i (44)

10 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) where the sequences {A (i) n } satisfy the linear equation A (i) n+k+1 = k j=0 p j A (i) n+j (45) with initial conditions A (i) i = 1 and A (i) j = 0 for all 0 i j k. The sequence {B n } also satisfies the linear equation k B n+k+1 = 1 + p j B n+j B 0 = B 1 = =B k = 0. (46) j=0 Appropriate changes of variables do lead to several interesting cases of which we only choose the following few A first order equation We start with the elementary first order equation x n+1 = αxn 2 (47) with initial condition x 0. It is easy to establish that the general term of x n is given by x n = α 2n 1 x (2n ) 0. (48) Immediately we can see that the closed form of the first order two-parameter recursive equation y n+1 = αyn 2 + 2αay n + a(aα 1) (49) is given by y n = α 2n 1 (y 0 + a) (2n) a. (50) In particular when αa = 1 we obtain that the closed form to y n+1 = αyn 2 + 2y n is given by ( y n = α 2n 1 y ) (2 n ) 1 α α. With the change of variables x n = (y n a)/(y n + a) we can also deduce from (50) the closed form solutions to the 2-parameter equation y n+1 = (1 + α)ay2 n + 2(1 α)a2 y n + (1 + α)a 3 (1 α)yn 2 + 2(1 + α)ay n + (1 α)a 2 (51) and its special cases when α =±1 y n+1 = y2 n + a2 2y n y n+1 = 2a2 y n yn 2 +. a2 (52) (53)

11 516 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) In fact the solution to (51) is given by y n = a (y 0 + a) (2n) + α 2n 1 (y 0 a) (2n ) (y 0 + a) (2n) α 2n 1 (y 0 a) (2n ) (54) whenever the denominator in (54) does not vanish for all n Some high order equations Let l>1 be an integer a be an arbitrary real number and x 0 a x 1 a... x l a be the initial conditions of the rational recursive equation x n+l+1 = a x n+l x n n= (55) x n + a Using the change of variables x n = a(y n 1) Eq. (55) reduces to the simpler form y n+l+1 = y n+l n= y n which is well defined whenever the product l y i 0. i=0 Our first conclusion then is that Eq. (55) is well defined if and only if l (x i + a) 0. i=0 Second whenever the polynomial λ l+1 λ l + 1 is solvable Eq. (55) is also solvable explicitly. For the sake of this discussion we will just concentrate on the general behavior of Eq. (55) for large values of l. Using Corollary p. 6 and Theorem p. 12 in [4] we can easily establish that unless x 0 = x 1 = =x l = 0 as n grows large all solutions to Eq. (55) will alternate between terms converging to zero and others diverging to. The second and last equation we consider is the rational recursive equation x n+1 x n x n+2 = n= (56) x n+1 + x n + 1 with initial conditions x 0 and x 1. Setting y n = x n /(x n + 1) we obtain that y n+2 = y n+1 y n. Thus by Lemma 2 and some simple algebra we obtain that x n = x F n 2 0 x F n 1 1 (57) (1 + x 0 ) F n 2(1 + x 1 ) F n 1 x F n 2 0 x F n 1 1 whenever the initial conditions x 0 and x 1 are chosen such that the denominator never vanishes. We would like to end this paper by stressing that despite the fact that we can generate several closed form solutions for some interesting rational recursive equations the set of

12 M. Ben H. Rhouma / J. Math. Anal. Appl. 310 (2005) solvable equations remains very small. In fact to our knowledge amongst the nontrivial equations of the form x n+2 = αx n+1 + βx n + γ ax n+1 + bx n + c only the following special equations have closed form solutions: x n+2 = αx n+1 x n x n+2 = αx n x n+1 x n+2 = αx n+1 βx n + αβ β 2 x n + β x n+2 = αx n βx n+1 + αβ β 2. (58) x n+1 + β Acknowledgment I thank my colleague Dr. Samir Siksek for his helpful comments on and around the Fibonacci sequence. References [1] B.A. Brousseau Summation of infinite Fibonacci series Fibonacci Quart. 7 (1969) [2] M. Ben H. Rhouma G. Miller Closed form solutions of some rational recursive sequences of second order Comm. Appl. Nonlinear Anal. 12 (2005) [3] J. Gill G. Miller Newton s method and ratios of Fibonacci numbers Fibonacci Quart. 19 (1981) 1 4. [4] V.L. Kocic G. Ladas Global Behaviour of Nonlinear Difference Equations of Higher Order with Applications Kluwer Academic Dordrecht [5] M.R.S. Kulenovic G. Ladas Dynamics of Second Order Rational Differential Equations Chapman & Hall CRC Boca Raton FL [6] X. Li D. Zhu Two rational recursive sequences Comput. Math. Appl. 47 (2004) [7] M. Renault The Fibonacci sequence under various moduli Masters Thesis Wake Forest University May [8] S.N. Elaydi Discrete Chaos Chapman & Hall CRC Boca Raton FL [9] T. Taka-aki Algebraic independence of Fibonacci reciprocal sums associated with Newton s method Tsukuba J. Math. 27 (2003)

Global Attractivity of a Higher-Order Nonlinear Difference Equation

Global Attractivity of a Higher-Order Nonlinear Difference Equation International Journal of Difference Equations ISSN 0973-6069, Volume 5, Number 1, pp. 95 101 (010) http://campus.mst.edu/ijde Global Attractivity of a Higher-Order Nonlinear Difference Equation Xiu-Mei

More information

On the Dynamics of a Rational Difference Equation, Part 1

On the Dynamics of a Rational Difference Equation, Part 1 International Journal of Difference Equations (IJDE). ISSN 0973-6069 Volume 3 Number 1 (2008), pp. 1 35 Research India Publications http://www.ripublication.com/ijde.htm On the Dynamics of a Rational Difference

More information

Monotone and oscillatory solutions of a rational difference equation containing quadratic terms

Monotone and oscillatory solutions of a rational difference equation containing quadratic terms Monotone and oscillatory solutions of a rational difference equation containing quadratic terms M. Dehghan, C.M. Kent, R. Mazrooei-Sebdani N.L. Ortiz, H. Sedaghat * Department of Mathematics, Virginia

More information

Dynamics of a Rational Recursive Sequence

Dynamics of a Rational Recursive Sequence International Journal of Difference Equations ISSN 0973-6069, Volume 4, Number 2, pp 185 200 (2009) http://campusmstedu/ijde Dynamics of a Rational Recursive Sequence E M Elsayed Mansoura University Department

More information

Global Attractivity in a Higher Order Nonlinear Difference Equation

Global Attractivity in a Higher Order Nonlinear Difference Equation Applied Mathematics E-Notes, (00), 51-58 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Global Attractivity in a Higher Order Nonlinear Difference Equation Xing-Xue

More information

Research Article Global Attractivity of a Higher-Order Difference Equation

Research Article Global Attractivity of a Higher-Order Difference Equation Discrete Dynamics in Nature and Society Volume 2012, Article ID 930410, 11 pages doi:10.1155/2012/930410 Research Article Global Attractivity of a Higher-Order Difference Equation R. Abo-Zeid Department

More information

Convergence and Oscillation in a Rational Fourth Order Difference Equation

Convergence and Oscillation in a Rational Fourth Order Difference Equation Australian Journal of Basic and Applied Sciences, 5(7): 771-777, 011 ISSN 1991-8178 Convergence and Oscillation in a Rational Fourth Order Difference Equation Hamid Gazor, Azadeh Memar, Tahereh Gazor and

More information

A System of Difference Equations with Solutions Associated to Fibonacci Numbers

A System of Difference Equations with Solutions Associated to Fibonacci Numbers International Journal of Difference Equations ISSN 0973-6069 Volume Number pp 6 77 06) http://campusmstedu/ijde A System of Difference Equations with Solutions Associated to Fibonacci Numbers Yacine Halim

More information

ON THE GLOBAL ATTRACTIVITY AND THE PERIODIC CHARACTER OF A RECURSIVE SEQUENCE. E.M. Elsayed

ON THE GLOBAL ATTRACTIVITY AND THE PERIODIC CHARACTER OF A RECURSIVE SEQUENCE. E.M. Elsayed Opuscula Mathematica Vol. 30 No. 4 2010 http://dx.doi.org/10.7494/opmath.2010.30.4.431 ON THE GLOBAL ATTRACTIVITY AND THE PERIODIC CHARACTER OF A RECURSIVE SEQUENCE E.M. Elsayed Abstract. In this paper

More information

ON THE RATIONAL RECURSIVE SEQUENCE X N+1 = γx N K + (AX N + BX N K ) / (CX N DX N K ) Communicated by Mohammad Asadzadeh. 1.

ON THE RATIONAL RECURSIVE SEQUENCE X N+1 = γx N K + (AX N + BX N K ) / (CX N DX N K ) Communicated by Mohammad Asadzadeh. 1. Bulletin of the Iranian Mathematical Society Vol. 36 No. 1 (2010), pp 103-115. ON THE RATIONAL RECURSIVE SEQUENCE X N+1 γx N K + (AX N + BX N K ) / (CX N DX N K ) E.M.E. ZAYED AND M.A. EL-MONEAM* Communicated

More information

Global Attractivity of a Rational Difference Equation

Global Attractivity of a Rational Difference Equation Math. Sci. Lett. 2, No. 3, 161-165 (2013) 161 Mathematical Sciences Letters An International Journal http://dx.doi.org/10.12785/msl/020302 Global Attractivity of a Rational Difference Equation Nouressadat

More information

Two Rational Recursive Sequences

Two Rational Recursive Sequences ELSEVIER An Intemational Journal Available online at www.sciencedirectcom computers &.c,=.c= ~--~=,,,==T. mathematics with applications Computers Mathematics with Applications 47 (2004) 487-494 www.elsevier.eom/locat

More information

Periodicity and Solution of Rational Recurrence Relation of Order Six

Periodicity and Solution of Rational Recurrence Relation of Order Six Applied Mathematics 3 79-733 http://d.doi.org/.436/am..377 Published Online July (http://www.scirp.org/journal/am) Periodicity and Solution of Rational Recurrence Relation of Order Si Tarek F. Ibrahim

More information

Global Asymptotic Stability of a Nonlinear Recursive Sequence

Global Asymptotic Stability of a Nonlinear Recursive Sequence International Mathematical Forum, 5, 200, no. 22, 083-089 Global Asymptotic Stability of a Nonlinear Recursive Sequence Mustafa Bayram Department of Mathematics, Faculty of Arts and Sciences Fatih University,

More information

On Robbins example of a continued fraction expansion for a quartic power series over F 13

On Robbins example of a continued fraction expansion for a quartic power series over F 13 Journal of Number Theory 28 (2008) 09 5 www.elsevier.com/locate/jnt On Robbins example of a continued fraction expansion for a quartic power series over F 3 Alain Lasjaunias C.N.R.S.-UMR 5465, Université

More information

Global Attractivity in a Nonlinear Difference Equation and Applications to a Biological Model

Global Attractivity in a Nonlinear Difference Equation and Applications to a Biological Model International Journal of Difference Equations ISSN 0973-6069, Volume 9, Number 2, pp. 233 242 (204) http://campus.mst.edu/ijde Global Attractivity in a Nonlinear Difference Equation and Applications to

More information

Anna Andruch-Sobi lo, Ma lgorzata Migda. FURTHER PROPERTIES OF THE RATIONAL RECURSIVE SEQUENCE x n+1 =

Anna Andruch-Sobi lo, Ma lgorzata Migda. FURTHER PROPERTIES OF THE RATIONAL RECURSIVE SEQUENCE x n+1 = Ouscula Mathematica Vol. 26 No. 3 2006 Anna Andruch-Sobi lo, Ma lgorzata Migda FURTHER PROPERTIES OF THE RATIONAL RECURSIVE SEQUENCE x n+1 = Abstract. In this aer we consider the difference equation x

More information

Dynamics of higher order rational difference equation x n+1 = (α + βx n )/(A + Bx n + Cx n k )

Dynamics of higher order rational difference equation x n+1 = (α + βx n )/(A + Bx n + Cx n k ) Int. J. Nonlinear Anal. Appl. 8 (2017) No. 2, 363-379 ISSN: 2008-6822 (electronic) http://dx.doi.org/10.22075/ijnaa.2017.10822.1526 Dynamics of higher order rational difference equation x n+1 = (α + βx

More information

Global Attractivity in a Higher Order Difference Equation with Applications

Global Attractivity in a Higher Order Difference Equation with Applications International Jr, of Qualitative Theory of Differential Equations and Applications International Vol. 3 No. 1 Jr, (January-June, of Qualitative 2017) Theory of Differential Equations and Applications Vol.

More information

OscillationofNonlinearFirstOrderNeutral Di erenceequations

OscillationofNonlinearFirstOrderNeutral Di erenceequations AppliedMathematics E-Notes, 1(2001), 5-10 c Availablefreeatmirrorsites ofhttp://math2.math.nthu.edu.tw/»amen/ OscillationofNonlinearFirstOrderNeutral Di erenceequations YingGaoandGuangZhang yz Received1June2000

More information

On the Third Order Rational Difference Equation

On the Third Order Rational Difference Equation Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 27, 32-334 On the Third Order Rational Difference Equation x n x n 2 x (a+x n x n 2 ) T. F. Irahim Department of Mathematics, Faculty of Science Mansoura

More information

INVARIANT CURVES AND FOCAL POINTS IN A LYNESS ITERATIVE PROCESS

INVARIANT CURVES AND FOCAL POINTS IN A LYNESS ITERATIVE PROCESS International Journal of Bifurcation and Chaos, Vol. 13, No. 7 (2003) 1841 1852 c World Scientific Publishing Company INVARIANT CURVES AND FOCAL POINTS IN A LYNESS ITERATIVE PROCESS L. GARDINI and G. I.

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,

More information

STABILITY OF THE kth ORDER LYNESS EQUATION WITH A PERIOD-k COEFFICIENT

STABILITY OF THE kth ORDER LYNESS EQUATION WITH A PERIOD-k COEFFICIENT International Journal of Bifurcation Chaos Vol 7 No 2007 43 52 c World Scientific Publishing Company STABILITY OF THE kth ORDER LYNESS EQUATION WITH A PERIOD-k COEFFICIENT E J JANOWSKI M R S KULENOVIĆ

More information

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.

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. Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real

More information

PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes

PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be

More information

Nonhyperbolic Dynamics for Competitive Systems in the Plane and Global Period-doubling Bifurcations

Nonhyperbolic Dynamics for Competitive Systems in the Plane and Global Period-doubling Bifurcations Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 3, Number 2, pp. 229 249 (2008) http://campus.mst.edu/adsa Nonhyperbolic Dynamics for Competitive Systems in the Plane and Global Period-doubling

More information

ON THE STABILITY OF SOME SYSTEMS OF EXPONENTIAL DIFFERENCE EQUATIONS. N. Psarros, G. Papaschinopoulos, and C.J. Schinas

ON THE STABILITY OF SOME SYSTEMS OF EXPONENTIAL DIFFERENCE EQUATIONS. N. Psarros, G. Papaschinopoulos, and C.J. Schinas Opuscula Math. 38, no. 1 2018, 95 115 https://doi.org/10.7494/opmath.2018.38.1.95 Opuscula Mathematica ON THE STABILITY OF SOME SYSTEMS OF EXPONENTIAL DIFFERENCE EQUATIONS N. Psarros, G. Papaschinopoulos,

More information

Notes on Continued Fractions for Math 4400

Notes on Continued Fractions for Math 4400 . Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural

More information

Attractivity of the Recursive Sequence x n+1 = (α βx n 1 )F (x n )

Attractivity of the Recursive Sequence x n+1 = (α βx n 1 )F (x n ) ISSN 1749-3889 (print), 1749-3897 (online) International Journal of Nonlinear Science Vol.7(2009) No.2,pp.201-206 Attractivity of the Recursive Sequence (α βx n 1 )F (x n ) A. M. Ahmed 1,, Alaa E. Hamza

More information

Dynamics of the equation complex plane

Dynamics of the equation complex plane APPLIED & INTERDISCIPLINARY MATHEMATICS RESEARCH ARTICLE Dynamics of the equation in the complex plane Sk. Sarif Hassan 1 and Esha Chatterjee * Received: 0 April 015 Accepted: 08 November 015 Published:

More information

CONGRUENCES FOR BERNOULLI - LUCAS SUMS

CONGRUENCES FOR BERNOULLI - LUCAS SUMS CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the

More information

Section 11.1 Sequences

Section 11.1 Sequences Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS

More information

Journal of Number Theory

Journal of Number Theory Journal of Number Theory 130 (2010) 1737 1749 Contents lists available at ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt A binary linear recurrence sequence of composite numbers Artūras

More information

ON A DIFFERENCE EQUATION WITH MIN-MAX RESPONSE

ON A DIFFERENCE EQUATION WITH MIN-MAX RESPONSE IJMMS 2004:55, 295 2926 PII. S067204402270 http://ijmms.hindawi.com Hindawi Publishing Corp. ON A DIFFERENCE EQUATION WITH MIN-MAX RESPONSE GEORGE L. KARAKOSTAS and STEVO STEVIĆ Received 25 February 2004

More information

M.ARCIERO, G.LADAS AND S.W.SCHULTZ

M.ARCIERO, G.LADAS AND S.W.SCHULTZ Georgian Mathematical Journal 1(1994), No. 3, 229-233 SOME OPEN PROBLEMS ABOUT THE SOLUTIONS OF THE DELAY DIFFERENCE EQUATION x n+1 = A/x 2 n + 1/x p n k M.ARCIERO, G.LADAS AND S.W.SCHULTZ Abstract. We

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Corrected Version, 7th April 013 Comments to the author at keithmatt@gmail.com Chapter 1 LINEAR EQUATIONS 1.1

More information

INDEFINITE QUADRATIC FORMS AND PELL EQUATIONS INVOLVING QUADRATIC IDEALS

INDEFINITE QUADRATIC FORMS AND PELL EQUATIONS INVOLVING QUADRATIC IDEALS INDEFINITE QUADRATIC FORMS AND PELL EQUATIONS INVOLVING QUADRATIC IDEALS AHMET TEKCAN Communicated by Alexandru Zaharescu Let p 1(mod 4) be a prime number, let γ P + p Q be a quadratic irrational, let

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 998 Comments to the author at krm@mathsuqeduau All contents copyright c 99 Keith

More information

Newton, Fermat, and Exactly Realizable Sequences

Newton, Fermat, and Exactly Realizable Sequences 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw

More information

Groups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group

Groups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group C H A P T E R t h r e E Groups Introduction Some of the standard topics in elementary group theory are treated in this chapter: subgroups, cyclic groups, isomorphisms, and homomorphisms. In the development

More information

Positive periodic solutions of higher-dimensional nonlinear functional difference equations

Positive periodic solutions of higher-dimensional nonlinear functional difference equations J. Math. Anal. Appl. 309 (2005) 284 293 www.elsevier.com/locate/jmaa Positive periodic solutions of higher-dimensional nonlinear functional difference equations Yongkun Li, Linghong Lu Department of Mathematics,

More information

Global Behavior of a Higher Order Rational Difference Equation

Global Behavior of a Higher Order Rational Difference Equation International Journal of Difference Euations ISSN 0973-6069, Volume 10, Number 1,. 1 11 (2015) htt://camus.mst.edu/ijde Global Behavior of a Higher Order Rational Difference Euation Raafat Abo-Zeid The

More information

Persistence and global stability in discrete models of Lotka Volterra type

Persistence and global stability in discrete models of Lotka Volterra type J. Math. Anal. Appl. 330 2007 24 33 www.elsevier.com/locate/jmaa Persistence global stability in discrete models of Lotka Volterra type Yoshiaki Muroya 1 Department of Mathematical Sciences, Waseda University,

More information

Discrete Halanay-type inequalities and applications

Discrete Halanay-type inequalities and applications Nonlinear Analysis 55 (2003) 669 678 www.elsevier.com/locate/na Discrete Halanay-type inequalities and applications Eduardo Liz a;, Anatoli Ivanov b, Juan Bosco Ferreiro c a Departamento de Matematica

More information

Linear recurrence relations with the coefficients in progression

Linear recurrence relations with the coefficients in progression Annales Mathematicae et Informaticae 4 (013) pp. 119 17 http://ami.ektf.hu Linear recurrence relations with the coefficients in progression Mircea I. Cîrnu Department of Mathematics, Faculty of Applied

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

Global dynamics of two systems of exponential difference equations by Lyapunov function

Global dynamics of two systems of exponential difference equations by Lyapunov function Khan Advances in Difference Equations 2014 2014:297 R E S E A R C H Open Access Global dynamics of two systems of exponential difference equations by Lyapunov function Abdul Qadeer Khan * * Correspondence:

More information

Review Article Solution and Attractivity for a Rational Recursive Sequence

Review Article Solution and Attractivity for a Rational Recursive Sequence Discrete Dynamics in Nature and Society Volume 2011, Article ID 982309, 17 pages doi:10.1155/2011/982309 Review Article Solution and Attractivity for a Rational Recursive Sequence E. M. Elsayed 1, 2 1

More information

Research Article Global Attractivity and Periodic Character of Difference Equation of Order Four

Research Article Global Attractivity and Periodic Character of Difference Equation of Order Four Discrete Dynamics in Nature and Society Volume 2012, Article ID 746738, 20 pages doi:10.1155/2012/746738 Research Article Global Attractivity and Periodic Character of Difference Equation of Order Four

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

Unboundedness Results for Rational Difference Equations

Unboundedness Results for Rational Difference Equations University of Rhode Island DigitalCommons@URI Open Access Dissertations 203 Unboundedness Results for Rational Difference Equations Gabriel Lugo University of Rhode Island, lugogabrielmath@gmailcom Follow

More information

A matrix over a field F is a rectangular array of elements from F. The symbol

A matrix over a field F is a rectangular array of elements from F. The symbol Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted

More information

ON THE RECURSIVE SEQUENCE x n+1 = A x n. 1. Introduction Our aim in this paper is to establish that every positive solution of the equation

ON THE RECURSIVE SEQUENCE x n+1 = A x n. 1. Introduction Our aim in this paper is to establish that every positive solution of the equation PROCEEDINGS OF THE MERICN MTHEMTICL SOCIETY Volume 26, Number, November 998, Pages 3257 326 S 0002-9939(98)04626-7 ON THE RECURSIVE SEQUENCE x n+ = x n R. DEVULT, G. LDS, ND S. W. SCHULTZ (Communicated

More information

1 Functions and Graphs

1 Functions and Graphs 1 Functions and Graphs 1.1 Functions Cartesian Coordinate System A Cartesian or rectangular coordinate system is formed by the intersection of a horizontal real number line, usually called the x axis,

More information

DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k

DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k RALF BUNDSCHUH AND PETER BUNDSCHUH Dedicated to Peter Shiue on the occasion of his 70th birthday Abstract. Let F 0 = 0,F 1 = 1, and F n = F n 1 +F

More information

Ch 9/10/11/12 Exam Review

Ch 9/10/11/12 Exam Review Ch 9/0// Exam Review The vector v has initial position P and terminal point Q. Write v in the form ai + bj; that is, find its position vector. ) P = (4, 6); Q = (-6, -) Find the vertex, focus, and directrix

More information

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 = Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values

More information

Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers

Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers University of South Carolina Scholar Commons Theses and Dissertations 2017 Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers Wilson Andrew Harvey University of South Carolina

More information

Nonautonomous difference equations: Open problems and conjectures

Nonautonomous difference equations: Open problems and conjectures Trinity University Digital Commons @ Trinity Mathematics Faculty Research Mathematics Department 7-2003 Nonautonomous difference equations: Open problems and conjectures Saber Elaydi Trinity University,

More information

Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26

Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26 Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem The Chinese Remainder Theorem Kyle Miller Feb 13, 2017 The Chinese Remainder Theorem says that systems of congruences always have a solution (assuming pairwise coprime moduli): Theorem 1 Let n, m N with

More information

Global Stability and Periodic Solutions for a Second-Order Quadratic Rational Difference Equation

Global Stability and Periodic Solutions for a Second-Order Quadratic Rational Difference Equation International Journal of Difference Equations ISSN 0973-6069, Volume 11, Number 1, pp. 79 103 (2016) http://campus.mst.edu/ijde Global Stability and Periodic Solutions for a Second-Order Quadratic Rational

More information

Introduction to Lucas Sequences

Introduction to Lucas Sequences A talk given at Liaoning Normal Univ. (Dec. 14, 017) Introduction to Lucas Sequences Zhi-Wei Sun Nanjing University Nanjing 10093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun Dec. 14, 017

More information

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

SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS J MC LAUGHLIN Abstract Let fx Z[x] Set f 0x = x and for n 1 define f nx = ff n 1x We describe several infinite

More information

MATH FINAL EXAM REVIEW HINTS

MATH FINAL EXAM REVIEW HINTS MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any

More information

Sums of Products of Bernoulli Numbers*

Sums of Products of Bernoulli Numbers* journal of number theory 60, 234 (996) article no. 00 Sums of Products of Bernoulli Numbers* Karl Dilcher Department of Mathematics, Statistics, and Computing Science, Dalhousie University, Halifax, Nova

More information

CALCULUS JIA-MING (FRANK) LIOU

CALCULUS JIA-MING (FRANK) LIOU CALCULUS JIA-MING (FRANK) LIOU Abstract. Contents. Power Series.. Polynomials and Formal Power Series.2. Radius of Convergence 2.3. Derivative and Antiderivative of Power Series 4.4. Power Series Expansion

More information

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

Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,

More information

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

be a formal power series with h 0 = 1, v(h^) = \ and v(h n ) > 1 for n > 1. Define a n by THE POWER OF 2 DIVIDING THE COEFFICIENTS OF CERTAIN POWER SERIES F. T. Howard Wake Forest University, Box 7388 Reynolda Station, Winston-Salem, NC 27109 (Submitted August 1999-Final Revision January 2000)

More information

Stability In A Nonlinear Four-Term Recurrence Equation

Stability In A Nonlinear Four-Term Recurrence Equation Applied Mathematics E-Notes, 4(2004), 68-73 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Stability In A Nonlinear Four-Term Recurrence Equation Shu-rong Sun, Zhenlai

More information

The Weil bounds. 1 The Statement

The Weil bounds. 1 The Statement The Weil bounds Topics in Finite Fields Fall 013) Rutgers University Swastik Kopparty Last modified: Thursday 16 th February, 017 1 The Statement As we suggested earlier, the original form of the Weil

More information

#A66 INTEGERS 14 (2014) SMITH NUMBERS WITH EXTRA DIGITAL FEATURES

#A66 INTEGERS 14 (2014) SMITH NUMBERS WITH EXTRA DIGITAL FEATURES #A66 INTEGERS 14 (2014) SMITH NUMBERS WITH EXTRA DIGITAL FEATURES Amin Witno Department of Basic Sciences, Philadelphia University, Jordan awitno@gmail.com Received: 12/7/13, Accepted: 11/14/14, Published:

More information

Book 4. June 2013 June 2014 June Name :

Book 4. June 2013 June 2014 June Name : Book 4 June 2013 June 2014 June 2015 Name : June 2013 1. Given that 4 3 2 2 ax bx c 2 2 3x 2x 5x 4 dxe x 4 x 4, x 2 find the values of the constants a, b, c, d and e. 2. Given that f(x) = ln x, x > 0 sketch

More information

Executive Assessment. Executive Assessment Math Review. Section 1.0, Arithmetic, includes the following topics:

Executive Assessment. Executive Assessment Math Review. Section 1.0, Arithmetic, includes the following topics: Executive Assessment Math Review Although the following provides a review of some of the mathematical concepts of arithmetic and algebra, it is not intended to be a textbook. You should use this chapter

More information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

x 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line?

x 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line? 1 How many natural numbers are between 1.5 and 4.5 on the number line? 2 How many composite numbers are between 7 and 13 on the number line? 3 How many prime numbers are between 7 and 20 on the number

More information

ON THE ELEMENTS OF THE CONTINUED FRACTIONS OF QUADRATIC IRRATIONALS

ON THE ELEMENTS OF THE CONTINUED FRACTIONS OF QUADRATIC IRRATIONALS ON THE ELEMENTS OF THE CONTINUED FRACTIONS OF QUADRATIC IRRATIONALS YAN LI AND LIANRONG MA Abstract In this paper, we study the elements of the continued fractions of Q and ( 1 + 4Q + 1)/2 (Q N) We prove

More information

CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS

CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get short-changed at PROMYS, but they are interesting in their own right and useful in other areas

More information

LOCAL STABILITY IMPLIES GLOBAL STABILITY IN SOME ONE-DIMENSIONAL DISCRETE SINGLE-SPECIES MODELS. Eduardo Liz. (Communicated by Linda Allen)

LOCAL STABILITY IMPLIES GLOBAL STABILITY IN SOME ONE-DIMENSIONAL DISCRETE SINGLE-SPECIES MODELS. Eduardo Liz. (Communicated by Linda Allen) DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS SERIES B Volume 7, Number 1, January 2007 pp. 191 199 LOCAL STABILITY IMPLIES GLOBAL STABILITY IN SOME ONE-DIMENSIONAL DISCRETE

More information

The Invariant Curve in a Planar System of Difference Equations

The Invariant Curve in a Planar System of Difference Equations Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 13, Number 1, pp. 59 71 2018 http://campus.mst.edu/adsa The Invariant Curve in a Planar System of Difference Equations Senada Kalabušić,

More information

NOTES ON DIOPHANTINE APPROXIMATION

NOTES ON DIOPHANTINE APPROXIMATION NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics

More information

Introduction to Techniques for Counting

Introduction to Techniques for Counting Introduction to Techniques for Counting A generating function is a device somewhat similar to a bag. Instead of carrying many little objects detachedly, which could be embarrassing, we put them all in

More information

Nonautonomous Beverton-Holt Equations and the Cushing-Henson Conjectures

Nonautonomous Beverton-Holt Equations and the Cushing-Henson Conjectures Trinity University Digital Commons @ Trinity Mathematics Faculty Research Mathematics Department 4-2005 Nonautonomous Beverton-Holt Equations and the Cushing-Henson Conjectures Saber Elaydi Trinity University,

More information

2 Series Solutions near a Regular Singular Point

2 Series Solutions near a Regular Singular Point McGill University Math 325A: Differential Equations LECTURE 17: SERIES SOLUTION OF LINEAR DIFFERENTIAL EQUATIONS II 1 Introduction Text: Chap. 8 In this lecture we investigate series solutions for the

More information

Homework 8 Solutions to Selected Problems

Homework 8 Solutions to Selected Problems Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x

More information

Notes on Systems of Linear Congruences

Notes on Systems of Linear Congruences MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the

More information

Pre AP Algebra. Mathematics Standards of Learning Curriculum Framework 2009: Pre AP Algebra

Pre AP Algebra. Mathematics Standards of Learning Curriculum Framework 2009: Pre AP Algebra Pre AP Algebra Mathematics Standards of Learning Curriculum Framework 2009: Pre AP Algebra 1 The content of the mathematics standards is intended to support the following five goals for students: becoming

More information

On a generalization of addition chains: Addition multiplication chains

On a generalization of addition chains: Addition multiplication chains Discrete Mathematics 308 (2008) 611 616 www.elsevier.com/locate/disc On a generalization of addition chains: Addition multiplication chains Hatem M. Bahig Computer Science Division, Department of Mathematics,

More information

Notes on generating functions in automata theory

Notes on generating functions in automata theory Notes on generating functions in automata theory Benjamin Steinberg December 5, 2009 Contents Introduction: Calculus can count 2 Formal power series 5 3 Rational power series 9 3. Rational power series

More information

Higher-order ordinary differential equations

Higher-order ordinary differential equations Higher-order ordinary differential equations 1 A linear ODE of general order n has the form a n (x) dn y dx n +a n 1(x) dn 1 y dx n 1 + +a 1(x) dy dx +a 0(x)y = f(x). If f(x) = 0 then the equation is called

More information

ARTICLE IN PRESS. J. Math. Anal. Appl. ( ) Note. On pairwise sensitivity. Benoît Cadre, Pierre Jacob

ARTICLE IN PRESS. J. Math. Anal. Appl. ( ) Note. On pairwise sensitivity. Benoît Cadre, Pierre Jacob S0022-27X0500087-9/SCO AID:9973 Vol. [DTD5] P.1 1-8 YJMAA:m1 v 1.35 Prn:15/02/2005; 16:33 yjmaa9973 by:jk p. 1 J. Math. Anal. Appl. www.elsevier.com/locate/jmaa Note On pairwise sensitivity Benoît Cadre,

More information

Johns Hopkins Math Tournament 2018 Proof Round: Sequences

Johns Hopkins Math Tournament 2018 Proof Round: Sequences Johns Hopkins Math Tournament 2018 Proof Round: Sequences February 17, 2018 Section Total Points Score 1 5 2 20 3 15 4 25 Instructions The exam is worth 60 points; each part s point value is given in brackets

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

More information

SOME FORMULAE FOR THE FIBONACCI NUMBERS

SOME FORMULAE FOR THE FIBONACCI NUMBERS SOME FORMULAE FOR THE FIBONACCI NUMBERS Brian Curtin Department of Mathematics, University of South Florida, 4202 E Fowler Ave PHY4, Tampa, FL 33620 e-mail: bcurtin@mathusfedu Ena Salter Department of

More information

Advanced Counting Techniques

Advanced Counting Techniques . All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Advanced Counting

More information

On the Solutions of the Recursive Sequence. i=0. Saniye Ergin and Ramazan Karataş 1

On the Solutions of the Recursive Sequence. i=0. Saniye Ergin and Ramazan Karataş 1 Thai Journal of Mathematics Volume 14 (2016) Number 2 : 391 397 http://thaijmathincmuacth ISSN 1686-0209 On the Solutions of the Recursive Sequence ax n k a k x n i Saniye Ergin and Ramazan Karataş 1 Akdeniz

More information

A Note on the Positive Nonoscillatory Solutions of the Difference Equation

A Note on the Positive Nonoscillatory Solutions of the Difference Equation Int. Journal of Math. Analysis, Vol. 4, 1, no. 36, 1787-1798 A Note on the Positive Nonoscillatory Solutions of the Difference Equation x n+1 = α c ix n i + x n k c ix n i ) Vu Van Khuong 1 and Mai Nam

More information

Math 0230 Calculus 2 Lectures

Math 0230 Calculus 2 Lectures Math 00 Calculus Lectures Chapter 8 Series Numeration of sections corresponds to the text James Stewart, Essential Calculus, Early Transcendentals, Second edition. Section 8. Sequences A sequence is a

More information