A fractal pattern has the sequence (1, 3, 9, 27, ...). The recursive formula is O a O b Oc Od a₁ = 1,an = an-1 +3, for n ≥2 a₁ = 1, an = an-1-3, for n ≤ 2 a₁ = 1,an = an-1-3, for n ≥ 2 A₁ = 1,ªn = ªn−13, for n ≥ 2
A fractal pattern has the sequence (1, 3, 9, 27, ...). The recursive formula is O a O b Oc Od a₁ = 1,an = an-1 +3, for n ≥2 a₁ = 1, an = an-1-3, for n ≤ 2 a₁ = 1,an = an-1-3, for n ≥ 2 A₁ = 1,ªn = ªn−13, for n ≥ 2
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section10.3: Geometric Sequences
Problem 1E
Related questions
Question
Transcribed Image Text:A fractal pattern has the sequence (1, 3, 9, 27, ...). The recursive formula is
O a
O b
Oc
O d
a₁ = 1, an an-1 +3, for n ≥ 2
=
a₁ = 1,anan-1.3, for n ≤ 2
=
a₁ = 1,ªn = an-1-3, for n ≥ 2
a₁ = 1,ªn = an-1.3, for n ≥2
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage