ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

116 results

Kiran Dyaanand
MATH 1152 G2 Tutorial - GCD and the Euclidean Algorithm

Hi guys, this video covers the last segment of Chapter 4 - Methods of Proof and Number Systems. Take particular note on finding ...

11:51
MATH 1152 G2 Tutorial - GCD and the Euclidean Algorithm

76 views

2 weeks ago

edu-TrIIx guru
HCF by Euclid's division algorithm

this video helps to revise hcf of two positive integers by using euclid's division algorithm.

13:21
HCF by Euclid's division algorithm

121 views

11 days ago

Emmanuel Jesuyon Dansu
35. Polynomial GCD & Euclidean Algorithm

This lesson provides a clear, structured introduction to Polynomial GCD and the Euclidean Algorithm, showing how to determine ...

1:11:46
35. Polynomial GCD & Euclidean Algorithm

44 views

2 weeks ago

Berit Givens
A useful lemma about the GCD of two numbers.

If a, b, and c are nonzero integers and a=bx+c for some integer x, then gcd(a,b)=gcd(b,c). This lemma is the key tool used in ...

5:57
A useful lemma about the GCD of two numbers.

0 views

7 days ago

EMI-BRAIN TUTOR
Greatest Common Divisor (GCD) Explained | 4 Easy Methods Step-by-Step

In this video, you will learn how to find the Greatest Common Divisor (GCD), also known as the Highest Common Factor (HCF), ...

1:04:58
Greatest Common Divisor (GCD) Explained | 4 Easy Methods Step-by-Step

17 views

2 weeks ago

Kenton's Channel
How to Find Gcd and Lcm - Easy Guide

How to Find Gcd and Lcm - Easy Guide | Surfshark VPN Deal — Stay private and secure. $1.99/mo + 3 Months Free ...

1:41
How to Find Gcd and Lcm - Easy Guide

0 views

4 days ago

Sigma Solver
GCD By Euclidean | Extended Euclidean | Linear Combination | Modular Inverse

In this tutorial, we explore the Euclidean Algorithm and its powerful extension — the Extended Euclidean Algorithm — the ...

10:50
GCD By Euclidean | Extended Euclidean | Linear Combination | Modular Inverse

25 views

2 weeks ago

Dogmathic
Hunting Bézout Coefficients in Q[x] | Abstract Algebra | Poly Rings | Dogmathic

https://dogmathic.com/ Today we hunt down Bézout coefficients in Q[x]. Given f(x) = x^2 - 3x + 2 and g(x) = x^2 + x + 1, we want r(x) ...

19:04
Hunting Bézout Coefficients in Q[x] | Abstract Algebra | Poly Rings | Dogmathic

83 views

13 days ago

Shiva Maths
GCD of polynomials x^4-1,x^3-11x^2+x-11

Master the method for finding the Greatest Common Divisor (GCD) of two polynomials using the long division (Euclidean ...

6:08
GCD of polynomials x^4-1,x^3-11x^2+x-11

11 views

4 weeks ago

Aditya Pateriya
Day 05 | GCD Re-Explained: Proper Euclid’s Algorithm + O(log n) Intuition

In my earlier video where I explained 7 basic math problems for DSA beginners, I covered GCD but very quickly. So in this video, ...

47:53
Day 05 | GCD Re-Explained: Proper Euclid’s Algorithm + O(log n) Intuition

19 views

3 weeks ago

O.R. institute
Class 10th RD Sharma, chapter 1, real number, Euclid divisional algorithm

Use Euclid division algorithm to find HCF of  1. 210 and 55. 2. 4052 and 12576. 3. 441,576 and 693. 4. 616 and 32.

8:23
Class 10th RD Sharma, chapter 1, real number, Euclid divisional algorithm

0 views

2 weeks ago

Yash Poonia
Common Divisors | Codeforces 1300 | GCD + Divisors Trick Explained

In this video, we solve the “Common Divisors” problem from Codeforces (1300 rating) using a ...

12:03
Common Divisors | Codeforces 1300 | GCD + Divisors Trick Explained

149 views

11 days ago

Shiva Maths
Algebra GCD of polynomials  3x^4 + 6x^3 - 12x^2 - 24x,4x^4+11x^3+8x^2-8x,

This in-depth tutorial (in Tamil) teaches you how to find the Greatest Common Divisor (GCD) of complex polynomials by first ...

10:16
Algebra GCD of polynomials 3x^4 + 6x^3 - 12x^2 - 24x,4x^4+11x^3+8x^2-8x,

12 views

4 weeks ago

ZeroToInfinity
Highest Common Factor (HCF) by Division Method #HCFBYDIVISIONMETHOD #GREATESTCOMMONDIVISOR @ZOI-F8Z

Understanding Highest Common Factor (HCF) The Highest Common Factor (HCF), also known as the Greatest Common Divisor ...

2:33
Highest Common Factor (HCF) by Division Method #HCFBYDIVISIONMETHOD #GREATESTCOMMONDIVISOR @ZOI-F8Z

70 views

9 days ago

Dogmathic
Turning Ugly Polynomial Congruences Into Clean Solutions | Abstract Algebra | Poly Rings | Dogmathic

In this video we solve a linear polynomial congruence over the rationals: find a polynomial f(x) in Q[x] such that x^9 f(x) is ...

16:55
Turning Ugly Polynomial Congruences Into Clean Solutions | Abstract Algebra | Poly Rings | Dogmathic

201 views

1 month ago

Bala Hema tnpsc studies and hobbis
How to find LCM and HCF Euclid division algorithm lemma
11:18
How to find LCM and HCF Euclid division algorithm lemma

22 views

4 weeks ago

Vehaan Vedic Maths by Dr Md. Abdul Riyaz
1. Find the H.C.F of 12,18 & 22,26 by using CONTINUOUS DIVISION & EUCLID'S ALGORITHM(Division)method

1. Find the H.C.F of 12,18 2. Find the H.C.F of 22,26, by using CONTINUOUS DIVISION Method and EUCLID'S ALGORITHM ...

5:24
1. Find the H.C.F of 12,18 & 22,26 by using CONTINUOUS DIVISION & EUCLID'S ALGORITHM(Division)method

5 views

23 hours ago

Kenton's Channel
How to Find the Hcf of Two Numbers Quickly - Full Guide

How to Find the Hcf of Two Numbers Quickly - Full Guide | Surfshark VPN Deal — Stay private and secure. $1.99/mo + 3 ...

1:44
How to Find the Hcf of Two Numbers Quickly - Full Guide

0 views

1 month ago

ICPC Zagazig University Community
Week 6 - Level 0 - 25` Round 1 - Math

This session provided a structured explanation of key mathematical concepts, emphasizing step-by-step reasoning and practical ...

1:44:43
Week 6 - Level 0 - 25` Round 1 - Math

150 views

2 weeks ago

KambeNeeds 69
Number Theory Euclidean Algorithm(Finding Greatest Common Divisor) pt.2
6:55
Number Theory Euclidean Algorithm(Finding Greatest Common Divisor) pt.2

16 views

3 weeks ago