
Advanced Engineering Mathematics
10th Edition
ISBN: 9780470458365
Author: Erwin Kreyszig
Publisher: Wiley, John & Sons, Incorporated
expand_more
expand_more
format_list_bulleted
Question

Transcribed Image Text:sequences, that is: an-c1r-1+c2r2-1, where c1 and c2 still need to be
determined
- to determine the constants c1 and c2, use the starting values a and a2given
above to set up a system of 2 equations for the 2 values c1 and c2
- finally, solve the system of 2 equations to determine c1 and c2
Put all the parts together and you should now have a closed formula for the
sequence in the form a,=cr,n-1+cr2n-1, where the growth rates r and r2 and the
constants C and c2 are all known values.
C2
To verify that you have correctly solved this recurrence relation and constructed the
correct closed formula, in the box below enter the ratio of the 2 constants cl
(If your answer is a decimal, round it correctly to 4 decimal places.)
Answer:

Transcribed Image Text:A sequence is defined by the recurrence relation an-(p+q)an-1-(pq)an-2, where p-D4
and q=5. The first two terms of the sequence are a1=-1 and a2=2.
To determine a closed formula for the terms of the sequence, we can follow the
procedure we discussed in class:
• substitute a geometric sequence an=rn-1 into the recurrence relation (and also
substitute appropriately adjusted expressions for an-1 and an-2)
• collect all the terms onto one side of the equation and factor out a common
factor of rn-3
• solve the resulting quadratic equation to get 2 possible geometric growth
rates, r, and r2
• our closed formula must therefore be be some combination of 2 geometric
sequences, that is: a,=c1r1"-1+c2r2 c1 and c2 still need to be
n-1 where
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps

Knowledge Booster
Similar questions
- 3. Is the sequence defined by a = 2(-4)" + 3 a n solution of the recurrence relation - 3 a +4a a =- n n-1 ? Justify your answer. n-2arrow_forwardWrite down the first five terms of the following recursively defined sequence. a1 = a1 a2 = a3 a4 = a5 || || || 3; an+1 = an +9arrow_forwardThe sequence {a} begins with 2, 1,-1, -2, -1, 1, 2, ... n From the list below select a recurrence relation and initial conditions that define the given sequence. {a}: 2, 1, 1, -2, -1, 1, 2, ... n O a = 2, a₁ = 1, a = a₁ 1 n n-1 O a = 3, a₁ = -1, a = a 1 n a=2, a₁ =1, a n a n-2 a=2, a₁ = 1, a = a n -an-2 + a n-2 .a n-1 n-1 n-2-an-1arrow_forward
- 8. Given the recursive sequence ɑn 3. an-1 - 2· an-2, where ao = 0, a1 = 1, %3D (a) Find a2, a3, a4, a5, a6 using the recurrence relation.arrow_forwardFind the first five terms of the sequence defined by the following recursive definition. a, = 13 an = an-1+4, ifn>1 How is the sequence related to the sequence a, = 4n +9? ..... The first term of the sequence defined by the recursive definition is The second term of the recursive sequence is The third term of the recursive sequence is The fourth term of the recursive sequence The fifth term of the recursive sequence is How is the recursive sequence related to the sequence a, = 4n + 9? O A. The values of the sequence defined by the recursive definition are half of the values of the sequence a, = 4n + 9. O B. The values of the sequence defined by the recursive definition are greater than the values of the sequence a, = 4n + 9. OC. The values of both the sequences are the same. D. The values of the sequence defined by the recursive definition are smaller than the values of the sequence a, = 4n +9.arrow_forwardPlease explain.arrow_forward
- Explain each qarrow_forward(a) Is the sequence {(-2)"} is a solution of the recurrence relation a, = -an-1 + 2a,-2? Show your work. (b) Is the sequence {n®2"} a solution of the recurrence relation a, = 2a,-1 – 4a,-2? Show your work. (c) Is the sequence {2(-4)" + 3} is a solution of the recurrence relation a, Aan-2?Show your work. -3an-1 +arrow_forwardFor the infinite geometric sequence (xn) whose first four terms are: 1.3, 3.77, 10.933, 31.7057 find the values of the first term a and a common ratio r and write down a common recurrence system for this sequence. Next, write down a closed form for this sequence and calculate the tenth term in this sequence to 3 dparrow_forward
- The odd numbers are the numbers in the sequence 1, 3, 5, 7, 9, . . .. Define the sequence of S- numbers as follows: The first S-number is 1. The second S-number is the sum of the first S-number and the second odd number. The third S-number is the sum of the second S-number and the third odd number. The fourth S-number is the sum of the third S-number and the fourth odd number, etc., ... Compute the first seven S-numbers. Make a note of any patterns you notice. Enter the first seven S-numbers as a comma-separated list: First seven S-numbers = help (numbers)arrow_forwarddiscrete matharrow_forwardWhich recursive sequence would produce the sequence 4, 15, 59, ..? a1 = 4 and a, 5an-1 — 5 – 5 | a1 = 4 and an -5am-1 +5 ai 4 and an = = -an-1 + 4 a1 = 4 and an 4ап-1 — 1 |arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Advanced Engineering MathematicsAdvanced MathISBN:9780470458365Author:Erwin KreyszigPublisher:Wiley, John & Sons, IncorporatedNumerical Methods for EngineersAdvanced MathISBN:9780073397924Author:Steven C. Chapra Dr., Raymond P. CanalePublisher:McGraw-Hill EducationIntroductory Mathematics for Engineering Applicat...Advanced MathISBN:9781118141809Author:Nathan KlingbeilPublisher:WILEY
- Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,

Advanced Engineering Mathematics
Advanced Math
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Wiley, John & Sons, Incorporated

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...
Advanced Math
ISBN:9781118141809
Author:Nathan Klingbeil
Publisher:WILEY

Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,

