# Difference between revisions of "Real Numbers"

(→Problem Solving Sessions) |
(→Problem Solving Sessions) |
||

Line 35: | Line 35: | ||

=Problem Solving Sessions= | =Problem Solving Sessions= | ||

− | Problem Solving Session # 1 Show that | + | [https://youtu.be/KR4BRId5E7I/ Problem Solving Session # 1] Show that n^2-1 is divisible by 8 if n is an odd positive integer. |

## Revision as of 18:33, 16 March 2019

Concepts Lectures on Real Numbers and Divisibility

# Concept Lectures

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

# Problem Solving Sessions

Problem Solving Session # 1 Show that n^2-1 is divisible by 8 if n is an odd positive integer.