Example 1. Figure 1, shows that Eq.(1) has no prime period two solutions if k = 2, 1 = 4, o = 6, x_6 1, x-5 = 2, x_4 = 3, x_3 = 4, x_2 = 5, x-1 = 6, x0 = 7, A |3| || || %3D 300, В — 200, С%3D 100, D %3D 75, b %3D 50, 30, е %3 d || || = 20. plot of y(-=(A*y(n)+B*y(n-2)+C*y(n-4)+D*y(n-6))+((b*y(n-2))/(d*y(n-2)-e*y(n-4))) 14.0005 7.0003 50 100 150 200 n-iteration solution of y(n+1)

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Code of matlab

Example 1. Figure 1, shows that Eq.(1) has no prime
period two solutions if k = 2, 1= 4, o = 6, x_6 =
1, х-5 3D 2, х-4 3D 3, х-з 3 4, х-2 3D 5, х-1 — 6, хо — 7,
A = 300, B = 200, C= 100, D= 75, b = 50, d =
30, е — 20.
plot of y(=(A*y(n)+B*y(n-2)+C*y(n-4)+D*y(n-6))+((b'y(n-2))(d*y(n-2)-e*y(n-4)))
14.0005
7.0003
50
100
n-iteration
150
200
The objective of this article is to investigate some
qualitative behavior of the solutions of the nonlinear
difference equation
bxn-k
[dxn-k- exn-1)
Xn+1
Axn+ Bxn-k+ CXp-1+DXp-o +
n= 0,1,2,..
(1)
where the coefficients A, B, C, D, b, d, e e (0,0), while
k, 1 and o are positive integers. The initial conditions
X-o,..., X_1,..., X_k, ..., X_1, X0 are arbitrary positive real
numbers such that k <1< o. Note that the special cases
of Eq. (1) have been studied in [1] when B=C = D=0,
and k = 0,1= 1, b is replaced by
B= C= D=0, and k = 0, b is replaced by – b and in
[33] when B
A=C= D=0, 1=0, b is replaced by – b.
%3D
– b and in [27] when
= C = D = 0,
1
0 and in [32] when
solution of y(n+1)
Transcribed Image Text:Example 1. Figure 1, shows that Eq.(1) has no prime period two solutions if k = 2, 1= 4, o = 6, x_6 = 1, х-5 3D 2, х-4 3D 3, х-з 3 4, х-2 3D 5, х-1 — 6, хо — 7, A = 300, B = 200, C= 100, D= 75, b = 50, d = 30, е — 20. plot of y(=(A*y(n)+B*y(n-2)+C*y(n-4)+D*y(n-6))+((b'y(n-2))(d*y(n-2)-e*y(n-4))) 14.0005 7.0003 50 100 n-iteration 150 200 The objective of this article is to investigate some qualitative behavior of the solutions of the nonlinear difference equation bxn-k [dxn-k- exn-1) Xn+1 Axn+ Bxn-k+ CXp-1+DXp-o + n= 0,1,2,.. (1) where the coefficients A, B, C, D, b, d, e e (0,0), while k, 1 and o are positive integers. The initial conditions X-o,..., X_1,..., X_k, ..., X_1, X0 are arbitrary positive real numbers such that k <1< o. Note that the special cases of Eq. (1) have been studied in [1] when B=C = D=0, and k = 0,1= 1, b is replaced by B= C= D=0, and k = 0, b is replaced by – b and in [33] when B A=C= D=0, 1=0, b is replaced by – b. %3D – b and in [27] when = C = D = 0, 1 0 and in [32] when solution of y(n+1)
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY