Module Name | Download |
---|---|
noc20_ma39_assignment_Week_0 | noc20_ma39_assignment_Week_0 |
noc20_ma39_assignment_Week_1 | noc20_ma39_assignment_Week_1 |
noc20_ma39_assignment_Week_10 | noc20_ma39_assignment_Week_10 |
noc20_ma39_assignment_Week_11 | noc20_ma39_assignment_Week_11 |
noc20_ma39_assignment_Week_12 | noc20_ma39_assignment_Week_12 |
noc20_ma39_assignment_Week_2 | noc20_ma39_assignment_Week_2 |
noc20_ma39_assignment_Week_3 | noc20_ma39_assignment_Week_3 |
noc20_ma39_assignment_Week_4 | noc20_ma39_assignment_Week_4 |
noc20_ma39_assignment_Week_5 | noc20_ma39_assignment_Week_5 |
noc20_ma39_assignment_Week_6 | noc20_ma39_assignment_Week_6 |
noc20_ma39_assignment_Week_7 | noc20_ma39_assignment_Week_7 |
noc20_ma39_assignment_Week_8 | noc20_ma39_assignment_Week_8 |
noc20_ma39_assignment_Week_9 | noc20_ma39_assignment_Week_9 |
Sl.No | Chapter Name | MP4 Download |
---|---|---|
1 | Lecture 1 : Integers | Download |
2 | Lecture 2 : Divisibility and primes | Download |
3 | Lecture 3 : Infinitude of primes | Download |
4 | Lecture 4 : Division algorithm and the GCD | Download |
5 | Lecture 5 : Computing the GCD and Euclid's lemma | Download |
6 | Lecture 6 : Fundamental theorem of arithmetic | Download |
7 | Lecture 7 : Stories around primes | Download |
8 | Lecture 8 : Winding up on `Primes' and introducing `Congruences' | Download |
9 | Lecture 9 : Basic results in congruences | Download |
10 | Lecture 10 : Residue classes modulo n | Download |
11 | Lecture 11 : Arithmetic modulo n, theory and examples | Download |
12 | Lecture 12 : Arithmetic modulo n, more examples | Download |
13 | Lecture 13 : Solving linear polynomials modulo n - I | Download |
14 | Lecture 14 : Solving linear polynomials modulo n - II | Download |
15 | Lecture 15 : Solving linear polynomials modulo n - III | Download |
16 | Lecture 16 : Solving linear polynomials modulo n - IV | Download |
17 | Lecture 17 : Chinese remainder theorem, the initial cases | Download |
18 | Lecture 18 : Chinese remainder theorem, the general case and examples | Download |
19 | Lecture 19 : Chinese remainder theorem, more examples | Download |
20 | Lecture 20 : Using the CRT, square roots of 1 in ℤn | Download |
21 | Lecture 21 : Wilson's theorem | Download |
22 | Lecture 22 : Roots of polynomials over ℤp | Download |
23 | Lecture 23 : Euler 𝜑-function - I | Download |
24 | Lecture 24 : Euler 𝜑-function - II | Download |
25 | Lecture 25 : Primitive roots - I | Download |
26 | Lecture 26 : Primitive roots - II | Download |
27 | Lecture 27 : Primitive roots - III | Download |
28 | Lecture 28 : Primitive roots - IV | Download |
29 | Lecture 29 : Structure of Un - I | Download |
30 | Lecture 30 : Structure of Un - II | Download |
31 | Lecture 31 : Quadratic residues | Download |
32 | Lecture 32 : The Legendre symbol | Download |
33 | Lecture 33 : Quadratic reciprocity law - I | Download |
34 | Lecture 34 : Quadratic reciprocity law - II | Download |
35 | Lecture 35 : Quadratic reciprocity law - III | Download |
36 | Lecture 36 : Quadratic reciprocity law - IV | Download |
37 | Lecture 37 : The Jacobi symbol | Download |
38 | Lecture 38 : Binary quadratic forms | Download |
39 | Lecture 39 : Equivalence of binary quadratic forms | Download |
40 | Lecture 40 : Discriminant of a binary quadratic form | Download |
41 | Lecture 41 : Reduction theory of integral binary quadratic forms | Download |
42 | Lecture 42 : Reduced forms up to equivalence - I | Download |
43 | Lecture 43 : Reduced forms up to equivalence - II | Download |
44 | Lecture 44 : Reduced forms up to equivalence - III | Download |
45 | Lecture 45 : Sums of squares - I | Download |
46 | Lecture 46 : Sums of squares - II | Download |
47 | Lecture 47 : Sums of squares - III | Download |
48 | Lecture 48 : Beyond sums of squares - I | Download |
49 | Lecture 49 : Beyond sums of squares - II | Download |
50 | Lecture 50 : Continued fractions - basic results | Download |
51 | Lecture 51 : Dirichlet's approximation theorem | Download |
52 | Lecture 52 : Good rational approximations | Download |
53 | Lecture 53 : Continued fraction expansion for real numbers - I | Download |
54 | Lecture 54 : Continued fraction expansion for real numbers - II | Download |
55 | Lecture 55 : Convergents give better approximations | Download |
56 | Lecture 56 : Convergents are the best approximations - I | Download |
57 | Lecture 57 : Convergents are the best approximations - II | Download |
58 | Lecture 58 : Quadratic irrationals as continued fractions | Download |
59 | Lecture 59 : Some basics of algebraic number theory | Download |
60 | Lecture 60 : Units in quadratic fields: the imaginary case | Download |
61 | Lecture 61 : Units in quadratic fields: the real case | Download |
62 | Lecture 62 : Brahmagupta-Pell equations | Download |
63 | Lecture 63 : Tying some loose ends | Download |
Sl.No | Chapter Name | English |
---|---|---|
1 | Lecture 1 : Integers | Download To be verified |
2 | Lecture 2 : Divisibility and primes | Download To be verified |
3 | Lecture 3 : Infinitude of primes | Download To be verified |
4 | Lecture 4 : Division algorithm and the GCD | Download To be verified |
5 | Lecture 5 : Computing the GCD and Euclid's lemma | Download To be verified |
6 | Lecture 6 : Fundamental theorem of arithmetic | Download To be verified |
7 | Lecture 7 : Stories around primes | Download To be verified |
8 | Lecture 8 : Winding up on `Primes' and introducing `Congruences' | Download To be verified |
9 | Lecture 9 : Basic results in congruences | Download To be verified |
10 | Lecture 10 : Residue classes modulo n | Download To be verified |
11 | Lecture 11 : Arithmetic modulo n, theory and examples | Download To be verified |
12 | Lecture 12 : Arithmetic modulo n, more examples | Download To be verified |
13 | Lecture 13 : Solving linear polynomials modulo n - I | Download To be verified |
14 | Lecture 14 : Solving linear polynomials modulo n - II | Download To be verified |
15 | Lecture 15 : Solving linear polynomials modulo n - III | Download To be verified |
16 | Lecture 16 : Solving linear polynomials modulo n - IV | Download To be verified |
17 | Lecture 17 : Chinese remainder theorem, the initial cases | Download To be verified |
18 | Lecture 18 : Chinese remainder theorem, the general case and examples | Download To be verified |
19 | Lecture 19 : Chinese remainder theorem, more examples | Download To be verified |
20 | Lecture 20 : Using the CRT, square roots of 1 in ℤn | Download To be verified |
21 | Lecture 21 : Wilson's theorem | Download To be verified |
22 | Lecture 22 : Roots of polynomials over ℤp | Download To be verified |
23 | Lecture 23 : Euler 𝜑-function - I | Download To be verified |
24 | Lecture 24 : Euler 𝜑-function - II | Download To be verified |
25 | Lecture 25 : Primitive roots - I | Download To be verified |
26 | Lecture 26 : Primitive roots - II | Download To be verified |
27 | Lecture 27 : Primitive roots - III | Download To be verified |
28 | Lecture 28 : Primitive roots - IV | Download To be verified |
29 | Lecture 29 : Structure of Un - I | Download To be verified |
30 | Lecture 30 : Structure of Un - II | Download To be verified |
31 | Lecture 31 : Quadratic residues | Download To be verified |
32 | Lecture 32 : The Legendre symbol | Download To be verified |
33 | Lecture 33 : Quadratic reciprocity law - I | Download To be verified |
34 | Lecture 34 : Quadratic reciprocity law - II | Download To be verified |
35 | Lecture 35 : Quadratic reciprocity law - III | Download To be verified |
36 | Lecture 36 : Quadratic reciprocity law - IV | Download To be verified |
37 | Lecture 37 : The Jacobi symbol | Download To be verified |
38 | Lecture 38 : Binary quadratic forms | Download To be verified |
39 | Lecture 39 : Equivalence of binary quadratic forms | Download To be verified |
40 | Lecture 40 : Discriminant of a binary quadratic form | Download To be verified |
41 | Lecture 41 : Reduction theory of integral binary quadratic forms | Download To be verified |
42 | Lecture 42 : Reduced forms up to equivalence - I | Download To be verified |
43 | Lecture 43 : Reduced forms up to equivalence - II | Download To be verified |
44 | Lecture 44 : Reduced forms up to equivalence - III | Download To be verified |
45 | Lecture 45 : Sums of squares - I | Download To be verified |
46 | Lecture 46 : Sums of squares - II | Download To be verified |
47 | Lecture 47 : Sums of squares - III | Download To be verified |
48 | Lecture 48 : Beyond sums of squares - I | Download To be verified |
49 | Lecture 49 : Beyond sums of squares - II | Download To be verified |
50 | Lecture 50 : Continued fractions - basic results | Download To be verified |
51 | Lecture 51 : Dirichlet's approximation theorem | Download To be verified |
52 | Lecture 52 : Good rational approximations | Download To be verified |
53 | Lecture 53 : Continued fraction expansion for real numbers - I | Download To be verified |
54 | Lecture 54 : Continued fraction expansion for real numbers - II | Download To be verified |
55 | Lecture 55 : Convergents give better approximations | Download To be verified |
56 | Lecture 56 : Convergents are the best approximations - I | Download To be verified |
57 | Lecture 57 : Convergents are the best approximations - II | Download To be verified |
58 | Lecture 58 : Quadratic irrationals as continued fractions | Download To be verified |
59 | Lecture 59 : Some basics of algebraic number theory | Download To be verified |
60 | Lecture 60 : Units in quadratic fields: the imaginary case | Download To be verified |
61 | Lecture 61 : Units in quadratic fields: the real case | Download To be verified |
62 | Lecture 62 : Brahmagupta-Pell equations | Download To be verified |
63 | Lecture 63 : Tying some loose ends | Download To be verified |
Sl.No | Language | Book link |
---|---|---|
1 | English | Not Available |
2 | Bengali | Not Available |
3 | Gujarati | Not Available |
4 | Hindi | Not Available |
5 | Kannada | Not Available |
6 | Malayalam | Not Available |
7 | Marathi | Not Available |
8 | Tamil | Not Available |
9 | Telugu | Not Available |