Тёмный

Divisibility |Part 5| Euclidean Algorithm 

MathPod
Подписаться 20 тыс.
Просмотров 6 тыс.
50% 1

This video is about Euclidean Algorithm to find gcd of two integers and also about Extended Euclidean algorithm which write gcd of these two integers as linear combinations of two integers.
Divisibility |Part 1|: • Divisibility |Part 1| ...
Divisibility |Part 2|: • Divisibility |Part 2| ...
Divisibility |Part 3|: • Divisibility |Part 3| ...
Divisibility |Part 4|: • Divisibility |Part 4| ...

Опубликовано:

 

14 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 6   
@valeriereid2337
@valeriereid2337 Месяц назад
Thank you so much! The worked example most certainly helped.
@kantaprasadsinha8025
@kantaprasadsinha8025 3 года назад
Dr Rana this is Aryabhatiya ' s verses 32;-33 of Gantapada . Read Bhaskara 1 also.
@sussybaka356
@sussybaka356 2 года назад
your playlist is good I'M in grade 12th right and it is pretty easy to understand stuff and do questions of olyampaids
@manojkumardandapat2037
@manojkumardandapat2037 3 года назад
Thank u mam ..very nice class
@deeptaroy8580
@deeptaroy8580 3 года назад
Mam how can you say gcd of (a,b) = gcd of (b,r) at 5.22 second of the video
@MathPod
@MathPod 3 года назад
I have added the proof after 5.22, see the proof of lemma to know gcd(a, b)=gcd(b, r).
Далее
Kaprekar's Constant
9:44
Просмотров 1 млн
Grand Final | IEM RIO 2024 | BO5 | КРNВОЙ ЭФИР
6:35:24
НЮША РОЖАЕТ?
00:17
Просмотров 948 тыс.
The Test That Terence Tao Aced at Age 7
11:13
Просмотров 4,4 млн
how to study less and get higher grades
11:16
Просмотров 615 тыс.
Divisibility |Part 1| Division algorithm
11:28
Просмотров 23 тыс.
Why is this "Fundamental" to Arithmetic? #SoMEpi [5th]
22:45
Some silly number systems
8:17
Просмотров 44 тыс.
Divisibility |Part 8| Relation of LCM and GCD
6:53
Просмотров 7 тыс.
An Exact Formula for the Primes: Willans' Formula
14:47