Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

Lectures
Lecture-wise break up
Fibonacci Numbers
Continued Fractions
Simple Inﬁnite Continued Fraction
Rational Approximation of Irrationals
Primes and ther Inﬁnitude
Tchebychev’s Theorem
9.1 Primes and their Distribution
10.1 Linear Diophantine Equations
10.2 Linear congruences
10.3 Chinese Remainder Theorem
10.4 Fermat’s Little Theorem
11.1 Introduction
11.2 EULER s PHI-FUNCTION
11.3 FERMAT’s THEOREM
11.4. EULER S GENERALIZATION OF FERMAT S THEOREM 59
11.4 EULER s GENERALIZATION of FERMAT s THEOREM
11.5 GAUSS s THEOREM
11.6 Diﬀerent Proof of CRT
11.7 Signiﬁcance of CRT
Congrunces of Higher Degree
Lagrange’s Theorem
13.1 Lecture 12
13.1.1 Theorem 12.1
13.1.2 Theorem 12.2 - Lagrange’s Theorem
13.1.3 Theorem 12.3
Primitive Roots and Euler’s Criterion
14.1 Euler’s Criterion and Strengthened Euler’s Criterion
14.2 The Order of an Integer Modulo n
14.3 Primitive Roots of Primes
15.2 Gauss’ Lemma
15.3 Gauss’ Reciprocity Law
The Jacobi Symbol
Elementary Algebraic Concepts
Sylow’s Theorem
20.1 Introduction
20.2 Characters of Finite Abelian Groups
20.3. CHARACTERS OF A FINITE ABELIAN GROUP 101
20.3 Characters of a Finite Abelian Group
20.4 Dirichlet Characters
Dirichlet Products
Primes are in P
23.1 Example 1
23.2 Example 2
23.3 Example 3
23.4 Example 4
23.5 Example 5
Rahul Gupta
24.1 Linear Congruences
24.2 Euler Function
24.3 Primitive Roots
25.1 Fibonacci Numbers
25.2 Fermat’s Little theorem
25.3 Chinese Remainder Theorem
25.4 Euler’s Criterion
25.5 GCD
Ashish Rastogi
26.1 Greatest Common Divisor
26.2 General Number Theory
26.3 Fibonacci Numbers
26.5 Multiplicative Functions and Perfect Numbers
27.1 Exercise 1
27.2 Exercise 2
27.3 Exercise 3
27.4 Exercise 4
27.5 Exercise 5
28.1 GCD
28.2 Fibonacci Numbers
28.3 Euler’s Phi Function
28.4 Chinese Remainder Theorem
28.5 Jacobi Symbol
29.1 Fermat’s Little Theorem
29.2 Tchebychev’s Theorem
29.3 Prime Numbers
29.4 Congruences
29.5 Continued Fractions
30.1 CRT
30.2 FLT
30.3 GCD
30.4 Linear Congruences
30.5 Primes
31.1 Euler φ function, FLT
31.2 Congruences of higher degree
31.4 Congruence, Euclidian Algorithm
31.5 Primitive Roots
32.1 Example 1
32.2 Example 2
32.3 Example 3
32.4 Example 4
32.5 Example 5
Vipul Jain
33.1 Primes and their Distribution
33.2 Linear Congruence
33.3 The Fibonacci Sequence
33.4 Euler’s Phi function
33.5 Fermat’s Little Theorem
Tushar Chaudhary
34.1 Fibonacci numbers
34.2 Chinese Remainder Theorem
34.3 Wilson’s Theorem
34.4 GCD, Continued Fractions
34.5 Fermat’s Little Theorem
by Fermat’s Little Theorem
35.1 Inﬁnitude of Primes
35.3 Approximation of Irrationals
35.4 Congruences
35.5 Divisibility
36.1 Euclidean Algorithm
36.2 Linear Conrguence
36.3 Periodic Continued Fraction
36.5 MultiplicativeFunction
Sai Pramod Kumar
37.1 Congruences
37.2 Inﬁnite Continued Fractions
37.3 Diophantine Equations
37.4 Primitive Roots
Tariq Aftab
38.1 Congruences of higher degree
38.2 Divisibility
38.3 Euler’s Totient Function
38.4 Fibonacci Numbers
38.5 Tchebychev’s Theorem
39.1 Generalisation of Euler’s Thoerem *
39.2 Primes and Congruence
39.3 Diophantine Equations
39.4 Chinese Remainder Theorem
39.5 Algebraic Number Theory (Fields)
39.6 Greatest Integer Function
Anuj Saxena
40.1 Chinese Remainder Theorem
40.2 Euler’s φ-Function
40.3 General Number Theory
40.5 Sylow Theorem
0 of .
Results for:
P. 1
Algorithmic Number Theory-IITD

# Algorithmic Number Theory-IITD

Ratings: (0)|Views: 214|Likes:

### Availability:

See more
See less

03/19/2013

pdf

text

original

Pages 5 to 20 are not shown in this preview.
Pages 25 to 30 are not shown in this preview.
Pages 35 to 72 are not shown in this preview.
Pages 77 to 109 are not shown in this preview.
Pages 114 to 200 are not shown in this preview.