How to Solve a Recurrence Relation using Backtracking: a_n = 2a_(n-1)

Показать описание

In this video I go through the steps of solving a recurrence relation using something called backtracking. This is a simple example so if you are new to this it may be useful. This is something you typically see in a discrete math class.

I hope this video helps someone:)

Рекомендации по теме

Комментарии

I am from Saudi Arabia and I really want to say thank you much.

Zeous

I'm not working on recurrence relations but I found the video helpful anyway. Keep making amazing content!

liftsu

please sir, please explain this question:

the Fibonacci sequence
fn = fn-1 + fn-2

wezzchannel

thank you so much sir for clearing up my concept

abhaatripathi

This is so true I can understand what your saying but is there any way to get some of the worksheet pen

georgettebeulah

it was a great way of explaining thank you for this lovely video

inkiadbinershad

Superb thank you so much respected sir...

SADDAMHUSSAIN-mwcv

helped a lot with disccrete math in college!, also nice hair man!

AneeqAhmed-MSIS

Thank you sir!! very helpful for my studies!!

amirhamzah

ty! so helpful! what bout if theres an operation at back? like 2An-1 + 1?

waniazlan

how would you find a characteristic equation?

zaitmartinez

so if a0 change to a1 how the last calculation?

muhdafiq

This helped me alot.Thanks for this explanation!

BobbyDigMOB

Thanks, the only part that I found confusing is the way to did the subscript arithmetic and substitutions

gregorywilson

Can you please explain how to solve this using induction?

angelmehta

Thank you, you made it very clear! ♡♡

roaahm

thank you so much very helpful btw it is my first comment which giving on a video....

habibimohammadbilal

A recurring nightmare is a nightmare no more thanks to the witchcraft done by the almighty Math Sorcerer

saadafm

Why is this in my 10th std syllabii dudee!!

new

Ty so much, this was helpful, but is the method still applicable for....
a1 = 2 and an = (an−1)
2 +1, for n ≥ 2
Write down the first five terms of this sequence

iamnayomie

How to Solve a Recurrence Relation using Backtracking: a_n = 2a_(n-1)

How To Solve Recurrence Relations

how to solve a recurrence relation (3 ways + 1 bonus)

Solved Recurrence - Iterative Substitution (Plug-and-chug) Method

RECURRENCE RELATIONS - DISCRETE MATHEMATICS

How to Solve a Second Order Linear Homogeneous Recurrence Relation(Distinct Real Roots Case)

2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1

Solved Recurrence Tree Method

L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm

L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them

Solving a Recurrence (Iterative Approach)

L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm

Finding a solution to a recurrence relation

Solve Recurrence Relations for Computer Science

Recurrence Relations Problem 1 - Recurrence Relation - Discrete Mathematics

How To Solve Recurrence Relations With Generating Functions

Iteration Method To Solve Recurrence Relation (Data Structure and Algorithms)

Finding a Recurrence Relation for the Fibonacci Sequence

Recurrence relation using Backtracking method

Discrete Math - 2.4.2 Recurrence Relations

L-2.9: Recurrence Relation [T(n)= 2T(n/2) +cn] | Recursive Tree method | Algorithm

Solving Recurrence Relation of an Algorithm- Introduction

Solve a Recurrence Relation Using the Telescoping Technique

Solving the MergeSort recurrence

Solving recurrence relation with given initial terms.