filmov
tv
Using a recurrence relationship with arithmetic sequences | Year 11 General Maths | MaffsGuru.com

Показать описание
**
This video is the next in the Sequences series of lessons for the General Maths Units 1 and 2 course. Having looked at the basics of arithmetic sequences, we now look at the different ways of writing a sequence. One of the most important for the General Maths Units 3 and 4 course will be the knowledge of how to write a recurrence relationship. These are a way of writing both arithmetic and geometric sequence and are used a lot. I show how to read them and use them in a range of questions.
**
00:00 - Introduction
00:07 - Welcome
00:54 - Learning Objectives
01:09 - Recap of past learning
02:17 - A recurrence relationship
05:27 - A recurrence relationship: Showing your working out
07:37 - Example: Using a recurrence relationship
11:11 - Example 2: Application of arithmetic sequences
17:21 - Final words
This maths video has been created for courses which are delivered in Australia but, as Maths is a constant, it is equally helpful for students in the USA, UK and other countries who are looking for good maths videos for both high school and middle school.
RECURRENCE RELATIONS - DISCRETE MATHEMATICS
2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1
How To Solve Recurrence Relations
Recursive Formulas For Sequences
how to solve a recurrence relation (3 ways + 1 bonus)
Recurrence Relations
How to Solve a Recurrence Relation using Backtracking: a_n = 2a_(n-1)
L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them
CH14 Théorèmes de récurrence 1 / 1
How to Solve a Second Order Linear Homogeneous Recurrence Relation(Distinct Real Roots Case)
Edexcel A Level Maths: 3.7 Recurrence Relations (Increasing/Decreasing/Periodic Sequence and Series)
A-Level Maths: D2-02 Sequences: Inductive Definitions and Recurrence Relations
Solve a Recurrence Relation Using the Telescoping Technique
L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm
Solved Recurrence - Iterative Substitution (Plug-and-chug) Method
Recurrence Relations Problem 1 - Recurrence Relation - Discrete Mathematics
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm
Recurrence Relation Proof By Induction
Discrete Math - 2.4.2 Recurrence Relations
Using a recurrence relationship with arithmetic sequences | Year 11 General Maths | MaffsGuru.com
Solved Recurrence Tree Method
How To Solve Recurrence Relations With Generating Functions
Using the Recurrence Relation for Compound Interest
L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm
Комментарии