Elementary Number Theory Primes, Congruences, and Secrets
Elementary Number Theory Primes, Congruences, and Secrets
Elementary Number Theory Primes, Congruences, and Secrets
This is a
textbook about classical elementary number theory and elliptic curves. The first
part discusses elementary topics such as primes, factorization, continued
fractions, and quadratic forms, in the context of cryptography, computation, and
deep open research problems. The second part is about elliptic curves, their
applications to algorithmic problems, and their connections with problems in
number theory.
This note explains the following topics: Integral ring extensions, Ideals of Dedekind rings, Finiteness
of the class number, Dirichlets unit theorem, Splitting and ramification,
Cyclotomic fields, Valuations and local fields, The theorem of Kronecker
weber.
This lecture note is
an elementary introduction to number theory with no algebraic prerequisites.
Topics covered include primes, congruences, quadratic reciprocity, diophantine
equations, irrational numbers, continued fractions, and partitions.
This note covers the following topics: Divisibility and
Primes, Congruences, Congruences with a Prime-Power Modulus, Euler's Function
and RSA Cryptosystem, Units Modulo an Integer, Quadratic Residues and Quadratic
Forms, Sum of Powers, Fractions and Pell's Equation, Arithmetic Functions, The
Riemann Zeta Function and Dirichlet L-Function.