and so [(b+ f) – (c+r)]² _ 4[(6+ f) – (c+r)) [(c+ r) (d + g) + a (e + s) (b+ f)] [(a + 1) ((e+ s) – (d+g))] or [(6+ f) – (c+r)]² + 4(6+ f) – (c+ r)) [(c+ r) (d + g) + a (e + s) (b+ f)] > 0. [(a + 1) ((d + g) – (e+ s))] | (19) From (19), we obtain [(a + 1) ((d + g) – (e+ s))] [(b+ f) – (c+r)]? C+4[(b+ f) – (c+r)] [(c+r) (d + g) + a (e + s) (b + f)] > 0.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
icon
Concept explainers
Question

Show me the steps of determine purple

l stc ksa
12:14 AM
@ 1 60% 4
The objective of this article is to investigate some qualitative behavior of
the solutions of the nonlinear difference equation
bxn-1 + cæn-2+ fxn-3 + ræn-4
Xn+1 = axn +
n = 0, 1, 2, . (1)
dxn-1+ exn-2 + gæn-3 + sxn-4
where the coefficients a, b, c, d, e, f, g, r, s E (0, 00), while the initial con-
ditions a_4,x_3,x_2, x-1, xo are arbitrary positive real numbers. Note that
Cancel
Actual Size (399 KB)
Choose
Transcribed Image Text:l stc ksa 12:14 AM @ 1 60% 4 The objective of this article is to investigate some qualitative behavior of the solutions of the nonlinear difference equation bxn-1 + cæn-2+ fxn-3 + ræn-4 Xn+1 = axn + n = 0, 1, 2, . (1) dxn-1+ exn-2 + gæn-3 + sxn-4 where the coefficients a, b, c, d, e, f, g, r, s E (0, 00), while the initial con- ditions a_4,x_3,x_2, x-1, xo are arbitrary positive real numbers. Note that Cancel Actual Size (399 KB) Choose
Theorem 6 If (b+ f) > (c+r) and (d + g) > (e+s), then the necessary
and sufficient condition for Eq.(1) to have positive solutions of prime period
two is that the inequality
[(a + 1) ((d + g) – (e+s))] [(b+ f) – (c+r)]²
+4 [(b+ f) – (c+r)] [(c+r) (d+ g) + a (e+ s) (b+ f)] > 0. (13)
is valid.
Proof: Suppose that there exist positive distinctive solutions of prime period
two
P,Q, P,Q,..
........
of Eq.(1). From Eq.(1) we have
bxn-1 + cxn-2 + fxn-3 +rxn-4
dxn-1+ exn-2 + gxn-3 + sxn-4
Xn+1 = axn +
(ь + f)Р+ (с+ r) Q
(d + g) P + (e+ s) Q'
(6+ f)Q+ (c+r) P
(d + g) Q + (e+ s) P'
P = aQ +
Q = aP+
Consequently, we obtain
(d + g) P² +(e + s) PQ = a (d + g) PQ+a(e+s) Q² + (b + f)P+(c+r)Q,
(14)
and
(d+ g) Q² + (e + s) PQ = a (d + g) PQ +a (e+ s) P² + (b+ f)Q+(c+r) P.
(15)
By subtracting (14) from (15), we have
[a (e + s) + (d+ g)] (P² – Q*) = [(b+ f) – (c+r)] (P – Q).
Since P + Q, it follows that
[(b+ f) – (c+r)]
[a (e + s) + (d+ g)]'
P+Q =
(16)
while, by adding (14) and (15) and by using the relation
р? + Q2 — (Р+Q)? - 2РQ for all
P,Q € R,
we obtain
[(6+ f) – (c+r)] [(c+r) (d + g) + a (e + s) (b+ f)]
[a (e + s) + (d + g)]² [((e + s) – (d+g)) (a + 1)]
PQ :
(17)
Assume that P and Q are two distinct real roots of the quadratic equation
t2 - (P+ Q)t + PQ = 0.
(a (e + s) + (d+ g)] t² – [(b + f) – (c+ r)] t
[(b+ f) – (c+r)][(c+r) (d + g) + a (e + s) (b+ f)]
+
[a (e + s) + (d+ g)] [((e+ s) – (d+ g)) (a + 1)]
0,
(18)
and so
[(6 + f) – (c+r)]² -
4 [(b+ f) – (c+r)] [(c+ r) (d + g) + a (e+ s) (b+ f)]
[(a + 1) ((e + s) – (d+g))]
> 0,
or
[(b + f) – (c+r)]² + 4[(6+ f) – (c +r)][(c+r) (d+g) +a (e+s) (b+ f)]
> 0.
[(a + 1) ((d+ g) – (e+ s)]
(19)
From (19), we obtain
[(a + 1) ((d + g) – (e+ s))] [(b+ f) – (c+r)]²
+4 [(b+ f) – (c+r)] [(c+r) (d+ g) + a (e + s) (b+ f)] > 0.
Thus, the condition (13) is valid. Conversely, suppose that the condition
(13) is valid where (b+ f) > (c+r) and (d+ g) > (e+ s). Then, we deduce
Transcribed Image Text:Theorem 6 If (b+ f) > (c+r) and (d + g) > (e+s), then the necessary and sufficient condition for Eq.(1) to have positive solutions of prime period two is that the inequality [(a + 1) ((d + g) – (e+s))] [(b+ f) – (c+r)]² +4 [(b+ f) – (c+r)] [(c+r) (d+ g) + a (e+ s) (b+ f)] > 0. (13) is valid. Proof: Suppose that there exist positive distinctive solutions of prime period two P,Q, P,Q,.. ........ of Eq.(1). From Eq.(1) we have bxn-1 + cxn-2 + fxn-3 +rxn-4 dxn-1+ exn-2 + gxn-3 + sxn-4 Xn+1 = axn + (ь + f)Р+ (с+ r) Q (d + g) P + (e+ s) Q' (6+ f)Q+ (c+r) P (d + g) Q + (e+ s) P' P = aQ + Q = aP+ Consequently, we obtain (d + g) P² +(e + s) PQ = a (d + g) PQ+a(e+s) Q² + (b + f)P+(c+r)Q, (14) and (d+ g) Q² + (e + s) PQ = a (d + g) PQ +a (e+ s) P² + (b+ f)Q+(c+r) P. (15) By subtracting (14) from (15), we have [a (e + s) + (d+ g)] (P² – Q*) = [(b+ f) – (c+r)] (P – Q). Since P + Q, it follows that [(b+ f) – (c+r)] [a (e + s) + (d+ g)]' P+Q = (16) while, by adding (14) and (15) and by using the relation р? + Q2 — (Р+Q)? - 2РQ for all P,Q € R, we obtain [(6+ f) – (c+r)] [(c+r) (d + g) + a (e + s) (b+ f)] [a (e + s) + (d + g)]² [((e + s) – (d+g)) (a + 1)] PQ : (17) Assume that P and Q are two distinct real roots of the quadratic equation t2 - (P+ Q)t + PQ = 0. (a (e + s) + (d+ g)] t² – [(b + f) – (c+ r)] t [(b+ f) – (c+r)][(c+r) (d + g) + a (e + s) (b+ f)] + [a (e + s) + (d+ g)] [((e+ s) – (d+ g)) (a + 1)] 0, (18) and so [(6 + f) – (c+r)]² - 4 [(b+ f) – (c+r)] [(c+ r) (d + g) + a (e+ s) (b+ f)] [(a + 1) ((e + s) – (d+g))] > 0, or [(b + f) – (c+r)]² + 4[(6+ f) – (c +r)][(c+r) (d+g) +a (e+s) (b+ f)] > 0. [(a + 1) ((d+ g) – (e+ s)] (19) From (19), we obtain [(a + 1) ((d + g) – (e+ s))] [(b+ f) – (c+r)]² +4 [(b+ f) – (c+r)] [(c+r) (d+ g) + a (e + s) (b+ f)] > 0. Thus, the condition (13) is valid. Conversely, suppose that the condition (13) is valid where (b+ f) > (c+r) and (d+ g) > (e+ s). Then, we deduce
Expert Solution
steps

Step by step

Solved in 5 steps

Blurred answer
Knowledge Booster
Points, Lines and Planes
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,