Lesson 16 of 24 • 0 upvotes • 12:06mins
In this session we try to understand the concept behind the Euclidean Division Algorithm.
24 lessons • 4h 3m
Module 4 | HCF & LCM | Introduction & Agenda
8:24mins
Module 4 | HCF & LCM | HCF & LCM via Venn Diagrams
13:14mins
Module 4 | HCF & LCM | HCF & LCM of Fractions
10:20mins
Module 4 | HCF & LCM | No. of 2-number sets for a given LCM.
11:36mins
Module 4 | HCF & LCM | Relationship b/w Product of Numbers and HCF & LCM.
10:38mins
Module 4 | HCF & LCM | Case of inverse nature of relationship b/w HCF & LCM.
13:34mins
Module 4 | HCF & LCM | Largest/smallest possible values of LCM & HCF if Prod(A,B) is given.
9:37mins
Module 4 | HCF & LCM | The Euclidean Division Algorithm
8:48mins
Module 4 | HCF & LCM | No. of 2-number sets for a given LCM.
11:36mins
Module 4 | HCF & LCM | Relationship b/w Product of Numbers and HCF & LCM.
10:38mins
Module 4 | HCF & LCM | Understanding the concept behind the Euclidean Division Algorithm.
12:06mins
Module 4 | HCF & LCM | Relationship b/w x, y with (x+y), (x-y), given that x & y are co-prime.
9:55mins
Module 4 | HCF & LCM | Application of Relationship b/w x, y with (x+y), (x-y).
10:06mins
Module 4 | HCF & LCM | HCF or LCM (na, nb) = n x HCF(a,b) or LCM (a, b) respectively.
8:04mins
Module 4 | HCF & LCM | Case of inverse nature of relationship b/w HCF & LCM.
13:34mins
Module 4 | HCF & LCM | No. of HCF values possible for numbers of the form, N & N+15.
8:07mins
Module 4 | HCF & LCM | No. of HCF values possible for numbers of the form: N, N+10, N+25, N+30...
8:57mins
Module 4 | HCF & LCM | Applications 1
10:48mins
Module 4 | HCF & LCM | Understanding the concept behind the Euclidean Division Algorithm.
12:06mins
Module 4 | HCF & LCM | Applications 2
8:25mins
Module 4 | HCF & LCM | Applications 3
8:52mins
Module 4 | HCF & LCM | No. of HCF values possible for numbers of the form, N & N+15.
8:07mins
Module 4 | HCF & LCM | Applications 4
8:06mins
Module 4 | HCF & LCM | HCF or LCM (na, nb) = n x HCF(a,b) or LCM (a, b) respectively.
8:04mins