Difference between revisions of "Real Numbers"
Line 13: | Line 13: | ||
Session # 7 [https://youtu.be/qb5MZTW_8J0/ Euclid's Division Lemma : Part 3] | Session # 7 [https://youtu.be/qb5MZTW_8J0/ Euclid's Division Lemma : Part 3] | ||
− | Session # 8 [https://youtu.be/e7hjSWysQwE /Proof of the Euclid's Division Lemma] | + | Session # 8 [https://youtu.be/e7hjSWysQwE/ Proof of the Euclid's Division Lemma] |
Session # 9 [https://youtu.be/K1-b2hat-ME/ Euclid's Division Lemma - Applications] | Session # 9 [https://youtu.be/K1-b2hat-ME/ Euclid's Division Lemma - Applications] | ||
Session # 10 [https://youtu.be/VF4NtFu4Qgw/ Euclid's Division Algorithm] | Session # 10 [https://youtu.be/VF4NtFu4Qgw/ Euclid's Division Algorithm] | ||
+ | |||
+ | Session # 11 [https://youtu.be/DNcmtKfH6Jg/ Euclid's Division Algorithm: What is GCD?] | ||
+ | |||
+ | Session # 12 [https://youtu.be/i6bbiERYT4o/ Euclid's Division Algorithm: What are co-prime numbers?] | ||
+ | |||
+ | Session # 13 [https://youtu.be/lPQtHgtH4cA/ Euclid's Division Algorithm: Finding GCD of Two Positive Integers] | ||
+ | |||
+ | Session # 14 [https://youtu.be/x9V--jkiuN8/ Euclid's Division Algorithm: Theorem 1 and its proof] | ||
+ | |||
+ | Session # 15 [https://youtu.be/sBGt9ncvd_I/ Expressing GCD of Two Positive Integers as a Linear Combination] | ||
+ | |||
+ | Session # 16 [https://youtu.be/MvslTd4_xgw/ Fundamental Theorem of Arithmetic] |
Revision as of 18:27, 16 March 2019
Session # 1 What are Real Numbers?
Session # 2 What is meant by divisibility?
Session # 3 Properties of divisibility : Part 1
Session # 4 Properties of divisibility : Part 2
Session # 5 Euclid's Division Lemma : Part 1
Session # 6 Euclid's Division Lemma : Part 2
Session # 7 Euclid's Division Lemma : Part 3
Session # 8 Proof of the Euclid's Division Lemma
Session # 9 Euclid's Division Lemma - Applications
Session # 10 Euclid's Division Algorithm
Session # 11 Euclid's Division Algorithm: What is GCD?
Session # 12 Euclid's Division Algorithm: What are co-prime numbers?
Session # 13 Euclid's Division Algorithm: Finding GCD of Two Positive Integers
Session # 14 Euclid's Division Algorithm: Theorem 1 and its proof
Session # 15 Expressing GCD of Two Positive Integers as a Linear Combination
Session # 16 Fundamental Theorem of Arithmetic