Abstract Algebra Class 3: GCD, Euclidean Algorithm, Modular Arithmetic, GCD & LCM Facts

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


Abstract Algebra Screencast of Class 3 on February 5, 2021.

(0:00) Introduction.
(1:04) Find the greatest common divisor (gcd) with factor trees.
(9:24) Find the gcd with the Euclidean Algorithm (which uses the Division Algorithm).
(17:24) GCD is a linear combination theorem.
(28:35) Scratch work for proof of modular arithmetic facts (If a mod n = a' and b mod n = b', then (a + b) mod n = (a' + b') mod n and (a*b) mod n = (a'*b') mod n.
(53:30) If t divides a and t divides b, then t divides gcd(a,b). If a divides s and b divides s, then lcm(a,b) divides s.

#abstractalgebra #abstractalgebraclass #numbertheory

AMAZON ASSOCIATE
As an Amazon Associate I earn from qualifying purchases.
  1. Bill Kinney
  2. abstract algebra
  3. abstract algebra class
  4. abstract algebra screencast
  5. number theory
  6. greatest common divisor
Рекомендации по теме
Abstract Algebra Class 1:08:57

Abstract Algebra Class 3: GCD, Euclidean Algorithm, Modular Arithmetic, GCD & LCM Facts

How to Find 0:04:10

How to Find the Greatest Common Divisor by Using the Euclidian Algorithm

Abstract Algebra: Using 0:04:31

Abstract Algebra: Using the Euclidean Algorithm to Compute GCD

GCD(greatest common divisor)| 0:00:06

GCD(greatest common divisor)| Number theory | Abstract Algebra

GCD - Euclidean 0:14:38

GCD - Euclidean Algorithm (Method 1)

[Discrete Mathematics] Primes 0:08:23

[Discrete Mathematics] Primes and GCD

Polynomial GCD and 0:42:07

Polynomial GCD and PIDs -- Abstract Algebra 23

gcd(a^3,b^4) 0:00:42

gcd(a^3,b^4)

Abstract Algebra | 0:15:44

Abstract Algebra | Writing the gcd of polynomials as a combination.

Discrete Math 4.3.2 0:08:37

Discrete Math 4.3.2 GCD's and LCM's

Euclidean Algorithm to 0:04:32

Euclidean Algorithm to Find the GCD of Two Numbers | Why Does It Work?

How to Find 0:00:51

How to Find the GCD of 9 and 15

Find GCD of 0:00:58

Find GCD of the given polynomials. #easy #tutorial

What does a 0:05:45

What does a ≡ b (mod n) mean? Basic Modular Arithmetic, Congruence

[a^k] = [a^gcd(n,k)] 0:12:24

[a^k] = [a^gcd(n,k)] and |a^k| = n/gcd(n,k) Proof (Abstract Algebra)

Find gcd and 0:04:40

Find gcd and Express gcd as linear combination || Number Theory || Divisibility Theory | Maths

Why greatest Mathematicians 0:00:38

Why greatest Mathematicians are not trying to prove Riemann Hypothesis? || #short #terencetao #maths

GCD & Euclid's 0:07:53

GCD & Euclid's Algorithm, part 3

All Maths Sign/Symbols 0:00:46

All Maths Sign/Symbols

Euclidean algorithm to 0:05:15

Euclidean algorithm to find GCD of two number

Abstract Algebra - 0:13:25

Abstract Algebra - 4.2 Cyclic Groups and Their Properties a^k=a^gcd(n,k)

Don't forget this 0:00:45

Don't forget this identity.

The Best Book 0:00:24

The Best Book for Learning to Trade Stocks

Комментарии
Автор

Hello Professor, I am from Iraq and I have benefited from your lectures a lot. I ask God to protect you

ahmedabdulateefibrahim
Автор

hi Professor. How is this similar or different from the playlist in the description dated 2020? Also, it started in Class 3, where are Classes 1 and 2? By the way, thank you for uploading this.

guillermobautistajr.