(a) Show that for any integer n 21, 0 ≤ 22n² + 9n²+ 6n ≤ 37nª. Proof: Suppose n is any integer such that n 2 1 We must show that 0 Now, since n is positive Os 22n +9n²+ 6n (Inequality 1) because every term in 22n + 9n² + 6n is positive In addition, 22n4 +9n²+ 6n s 22n² +9n² +6n4 (Inequality 2) because when n 2 1, 9n² s 154-6n 22n +9² +6n 22n +9n²+ 6n X Add like terms on the right-hand side of Inequality 2 to obtain (Inequality 3). s and on s 37 s37² Then use the transitive property of inequality to combine inequalities 1 and 3, and conclude that

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
Question
(d) Use the O- and -notations to express the results of parts (a) and (b).
By part (a),
By part (b),
is O n
is Ω
(e) What can you deduce about the order of 22n4 +9n² + 6n?
Applying either the definition of -notation or Theorem 11.2.1 to the previous results gives that 22n4 + 9n² + 6n is e
Transcribed Image Text:(d) Use the O- and -notations to express the results of parts (a) and (b). By part (a), By part (b), is O n is Ω (e) What can you deduce about the order of 22n4 +9n² + 6n? Applying either the definition of -notation or Theorem 11.2.1 to the previous results gives that 22n4 + 9n² + 6n is e
(a) Show that for any integer n ≥ 1,
0 ≤ 22n4 +9n² + 6n ≤ 37n4.
Proof: Suppose n is any integer such that n ≥ 1
We must show that 0
Now, since n is positive
0 ≤ 22n4 +9n² + 6n (Inequality 1)
because every term in 22n4 + 9n² + 6n is positive V
In addition,
22n4 +9n² + 6n ≤ 22n² + 9n² + 6n² (Inequality 2)
≤ 22n²+ +9n² +6n
22n4 + 9n² + 6n ≤
because when n ≥ 1, 9n² ≤ 15nª - 6n
X
Add like terms on the right-hand side of Inequality 2 to obtain
and 6n ≤ 37n²
We must show that
(Inequality 3).
Then use the transitive property of inequality to combine inequalities 1 and 3, and conclude that
(b) Show that for any integer n ≥ 1, 22n4 ≤ 22n4 + 9n² + 6n.
Proof: Suppose n is any integer such that n 2 1
s
≤37n²
1
Transcribed Image Text:(a) Show that for any integer n ≥ 1, 0 ≤ 22n4 +9n² + 6n ≤ 37n4. Proof: Suppose n is any integer such that n ≥ 1 We must show that 0 Now, since n is positive 0 ≤ 22n4 +9n² + 6n (Inequality 1) because every term in 22n4 + 9n² + 6n is positive V In addition, 22n4 +9n² + 6n ≤ 22n² + 9n² + 6n² (Inequality 2) ≤ 22n²+ +9n² +6n 22n4 + 9n² + 6n ≤ because when n ≥ 1, 9n² ≤ 15nª - 6n X Add like terms on the right-hand side of Inequality 2 to obtain and 6n ≤ 37n² We must show that (Inequality 3). Then use the transitive property of inequality to combine inequalities 1 and 3, and conclude that (b) Show that for any integer n ≥ 1, 22n4 ≤ 22n4 + 9n² + 6n. Proof: Suppose n is any integer such that n 2 1 s ≤37n² 1
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
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,