The recurrence relation for the solution G(K) =
is-
Answers
Answered by
0
Given :
To Find : The recurrence relation for the
Solution:
put k = 0
=> G(0) = 5.2⁰ = 5
put k = n - 1
=> G(n-1) = 5 . 2ⁿ⁻¹
put k = n
=> G(n ) = 5 . 2ⁿ
G(n ) = 5 . 2⁽ⁿ⁻¹⁾⁺¹
=> G(n ) = 5 . 2⁽ⁿ⁻¹⁾ . 2
=> G(n) = 2. (5 . 2ⁿ⁻¹)
=> G(n) = 2. G(n-1) where G(0) = 5
=> Gₙ = 2Gₙ₋₁ where G₀ = 5.
The recurrence relation is Gₙ = 2Gₙ₋₁ , G₀ = 5.
Learn More:
The tens digit in a two-digit number is twice the unit's digit. Which of ...
brainly.in/question/17248092
Sanjana Roll Number Is A Two Digit Number Her Friend Redhima ...
brainly.in/question/11138006
Similar questions
Environmental Sciences,
2 months ago
Math,
2 months ago
English,
4 months ago
Accountancy,
4 months ago
Chemistry,
10 months ago
Science,
10 months ago
Science,
10 months ago